Optimum Detection of Binary PAM in Noise: PAM: Pulse Amplitude Modulation
Optimum Detection of Binary PAM in Noise: PAM: Pulse Amplitude Modulation
Optimum Detection of Binary PAM in Noise: PAM: Pulse Amplitude Modulation
Representation:
h(t)
1
0 T t
where bk represents the kth bit: bk= 0 or 1
h(t) is a rectangular pulse of length T centered at t=T/2.
Advantage of rectangular pulses:
No interference between pulses in the adjacent intervals. 1
Binary PAM in Noise
The matched filter for each pulse h(t-kT) in the interval (k-1)T< t < kT is:
gk(T-t)=h(t-kT)
=> The output of the matched filter receiver at the end of the kth symbol
interval is:
+∞
2
BER PERFORMANCE
A simple and efficient decision rule for deciding between the two
hypotheses is to choose H0 that is to choose 0 if y is less than some
threshold γ and choose 1 if not.
As symbols are separated in time, consider the detection of the first symbol
(k=0).
T
Matched filter output: Y = ∫ r ( t )dt = S + N
0
T
AT if H1 ( b 0 = 1)
=> Output signal: S = ∫ Ab0dt = Ab0T ; S=
0 0 if H 0 ( b 0 = 0)
T
Output noise: N = ∫ w ( t )dt
0
00 00
2 0
2 2
p(y/H1)
Pe1=
5
BER PERFORMANCE
p(y/H0)
Pe0 =
6
BER
=>
The average energy per bit Eb at the receiver input can be computed from the
first bit as:
=> (4)
8
NONRECTANGULAR PULSE SHAPES