COMM 2 Notes
COMM 2 Notes
T: symbol duration
(Gray coding:
Neighbor symbols
differ by 1 bit only)
2 t −T/2
with : m I (t), m Q (t) = ± rect ( )
2 T
1
5. Detection of QP SK , P AM and QAM in
noise
2
Detection of QP SK in noise
YI
YQ
3
Detection of QP SK in noise
2nd bit
2 BPSK systems YQ
T
LPF Filtering (integrator): Similarly: YQ = ∫ [ ]dt
0
2 2
=> YI = ± A T + NI YQ = ± A T + NQ
4 4
T T
1 N T 1 N 0T
N I = ∫ n I (t)dt ;σ = 0
2
N Q = − ∫ n Q (t)dt ; σ2 = 4
0
2 4 0
2 4
Detection of QP SK in noise
2 N T
⇒ YI and YQ are identically distributed: YI , YQ : N(± A c T; 0 )
4 4
2 A c 2 .T
Pe =Q(d/2σ); d= A c .T => Pe = Q( )
2 4σ
In terms of Eb/N0:
Eb=Esymbol/2=(Ac2T/2)/2=Ac2T/4 => A c = 2 E b / T
N 0T N 0T
σ2 = => σ =
4 2
Replacing in Pe:
2E b
=> PeQPSK = Q( )
N0
Consequently, in terms of energy per bit, the QPSK performance is exactly the same as BPSK, even
though we are transmitting twice as many bits through the same channel. 5
Detection of M -P AM in noise
2) Detection of M-PAM
For example, with four-level PAM, the scalar ck could be selected from the
set {-3,-1,1,3}.
6
Detection of M -P AM in noise
Ex: 4-PAM
Receiver output samples (assuming T=1)
s1 s2 s3 s4
-3A -A +A +3A
1 M / 2−1 A 2T M / 2−1
Es = ∑ (2k + 1) A T =
M k =− M / 2
2 2
M
[2 ∑ (2k + 1) 2 ]
k =0
M / 2−1
A 2T
= [2 + 2 ∑ (2k + 1) 2 ]
M k =1
(M 2 − 1)A 2 T
= ..... =
3
M- PAM => Number of bits /symbol is: β=log2(M) => Eb=Es/β (2)
Advantage of M-PAM: increase the transmitted bit rate by increasing the number
of bits per symbol β=log2(M)
Let:
M=2 (binary PAM) => => same Pe result as in bipolar PAM, BPSK,
QPSK
M=4 (4-PAM) => => significantly more energy per bit must
be transmitted to obtain the same error
rate.