Performance Analysis in AWGN

Isolated Pulse Baseband Case

Performance of PAM Receivers

Govind Sharma

Department of Electrical Engineering

Indian Institute of Technology, Kanpur

G. Sharma EE321A
 Performance Analysis in AWGN

Isolated Pulse Baseband Case

y (t) t=0 y 1 z
r (t) h(−t) â
Eh
MF Slicer

y = aEh + N
N
z = a+
Eh

N0
At the output of the matched filter PSD of noise is |H(f )|2 .
2
N0 N0
Y ∼ N (aEh , Eh ) and Z ∼ N (a, )
2 2Eh

G. Sharma EE321A
 Performance Analysis in AWGN

Isolated Pulse Baseband Case

Minimum distance receiver is

â = arg min |z − a|2

a∈A

fZ (z| − a) fZ (z|a)

z
−a 0 a
d
d d2 N0
Pr[Symbol error]= Q( ), Ea = , σ 2 = , and
2σ 4 2Eh
Es = Ea Eh = Eb . Substituting we get
s !
2Eb
Pr[bit error] = Q
N0

G. Sharma EE321A
 Performance Analysis in AWGN

Isolated Pulse Baseband Case

• Probability of error does not depend on pulse shape

• Probability of error does not depend on bandwidth
We choose pulse shape to satisfy other criteria (ISI,
synchronization, spectral occupancy etc.)

G. Sharma EE321A
 Performance Analysis in AWGN

Baseband M-ary case

Im{a}
(M − 1)d . . . 3d d d 3d (M − 1)d
− − − ···
2 2 2 2 2 2 Re{a}
(M − 2) inner symbols have 2 neighbors each while two end points
have only one neighbor.
d
P[symbol error | innner symbol] = 2Q( )
2σ
d
P[symbol error | outer symbol] = Q( )
2σ
1 d

P[symbol error] = 2 1 − Q( )
M 2σ

G. Sharma EE321A
 Performance Analysis in AWGN

Baseband M-ary case

1 XM d2
Ea = (−M − 1 + 2k)2
M k=1 4
2 X M/2 d 2
= (−1 + 2k)2
M k=1 4
2 M 4(M/2) − 1 d 2
2
=
M 2 3 4
2
M −1 d 2
=
3 4 s !
1 6Es
 
P[symbol error] = 2 1 − Q
M (M 2 − 1)N0
d
= Nav Q( )
2σ

G. Sharma EE321A
 Performance Analysis in AWGN

Baseband M-ary case

Finding bit error is more difficult as a symbol error may cause one
bit or two bits or M bits error. We generally use Gray coding. In
Gray coding two nearest neighbour differ by only one bit change. A
necessary (but not sufficient) condition is that number of nearest
neighbours is at most b (where b is number of bits in the symbol).
The most likely error is nearest symbol. We make the
approximation that only nearest neighbour errors occur. Hence
1
P[bit error] ≈ P[symbol error]
b
using Es = bEb we get
s !
2 1 6bEb
 
P[bit error] ≈ 1− Q 2
b M (M − 1)N0

G. Sharma EE321A