Principles of Communications: Chapter 5: Digital Transmission Through Bandlimited Channels
Principles of Communications: Chapter 5: Digital Transmission Through Bandlimited Channels
5MHz, 10MHz
20MHz 15MHz, 20MHz
On-off (unipolar)
polar
Return to zero
bipolar
Manchester
s (t )
g 0 (t + 2TS )
g1 (t − 2TS )
∞
s (t ) = ∑ sn (t ) Ts
n = −∞
g 0 (t − nTs ), with prob. P
sn (t ) =
g1 (t − nTs ), with prob. 1 − P
Meixia Tao @ SJTU 7
Power Spectral Density
PSD of the baseband signal s(t) is
2
∞
1 1 m m m
S (= p (1 − p ) G0 ( f ) − G1 ( f ) + 2 ∑ pG0 ( ) + (1 − p )G1 ( ) δ ( f − )
2
f)
Ts Ts m = −∞ Ts Ts Ts
1
S ( f ) = G( f )
2
unipolar
Return-to-zero polar
Return-to-zero unipolar
Source Σ
Input to tx filter =
xs (t ) ∑ A δ (t − iT )
i = −∞
i
∞
Output of tx filter =
xt (t ) ∑ A h (t − iT )
i = −∞
i T
Output of rx filter
Gaussian noise
Desired signal intersymbol interference (ISI)
Eye pattern
or
sin (π t / T ) t
p(t ) = = sinc
π t /T T
-1/2T 0 1/2T f
= Nyquist bandwdith,
P(f)
1 0 ≤| f |< f1
1
1 π (| f | − f1 )
P( f ) = 1 + cos f1 ≤| f |< 2 B0 − f1
2
02 B − 2 f1
2B0-f1
0 f1 B0 2B0 f
0 | f |≥ 2 B0 − f1
P(f)
α=0
Roll-off factor
1 α = 0.5 f1
α = 1−
0.5 α=1 B0
0 B0 1.5B0 2B0 f
Required bandwidth
cos(2πα B0t )
p(t ) = sinc(2 B0t )
1 − 16α 2 B02t 2
Ensures zero crossing at
desired sampling instants Decreases as 1/t2, such that the data
receiving is relatively insensitive to
sampling time error
0 Tb 2Tb
α=1
α=0.5
α=0
-2 -1 0 1 2 t/Tb
Ideal LPF
2Te − jπ fT cos π fT ( f ≤ 1/ 2T )
=
0 (ot her wi se)
T
{ck −1}
2Tje− j 2π fT sin 2π fT ( f ≤ 1/ 2T )
G ( f )= (1 − e − j 4π fT
)H L ( f ) =
0 otherwise
c=
k ak ⊕ ck − 2
The coded signal is
b=
k ck − ck − 2
+
+ +
-
2T
with
By Parseval’s theorem
Hence
Meixia Tao @ SJTU 37
Noise variance at the output of the receive filter is
Special case:
This is the ideal case with “flat” fading
No loss, same as the matched filter receiver for AWGN
channel
Meixia Tao @ SJTU 38
Exercise
Therefore
Let
Then
with
X
Threshold = γ
t m = mT
Let
1 error occurs
I ( x) =
0 else
∴
1 L
Pe = ∑ I X ( l )
L l =1
( )
where X(1), X(2), ... , X(L) are i.i.d. (independent and
identically distributed) random samples
Unequalized
input
c-N ⊗ c ⊗
-N+1 cN-1 ⊗ cN ⊗
t=nT
∑
Output
(τ=T)
(2N+1)-tap FIR equalizer
are the adjustable equalizer coefficients
is sufficiently large to span the length of ISI
Tx & Channel
At sampling time
or the middle-column of
− 4T + ∆t − 2T + ∆t T + ∆t 3T + ∆t
− 3T + ∆t − T + ∆t ∆t 2T + ∆t 4T + ∆t
Therefore,
c1=0.117, c-1=-0.158, c0 = 0.937, c1 = 0.133, c2 = -0.091
Drawback of ZF equalizer
Ignores the additive noise
Alternatively,
Relax zero ISI condition
Minimize the combined power in the residual ISI and
additive noise at the output of the equalizer
MMSE equalizer:
a channel equalizer that is optimized based on the minimum mean-
square error (MMSE) criterion
Output from
the channel
N
z (t ) = ∑ cn y (t − nT )
n=− N
[ ]
MSE = E (z ( mT ) − Am ) = Minimum
2
where
E is taken over and the
additive noise
Feedback
Filter
T T T T
Finite-state machine
Linear Non-linear
ZF DFE
MMSE MLSE