Overheads in course TTT4130 Digital Communication Adaptive equalization

Curriculum found in Barry, Lee, Messerschmitt, Chapter 9

IET, NTNU Digital Communication, Adaptive equalization

Adaptive equalizer

IET, NTNU Digital Communication, Adaptive equalization 2

Adaptive DFE

IET, NTNU Digital Communication, Adaptive equalization 3

Linear equalizer:
L

C(z) =

cm z
m= L

Decision feedback equalizer (DFE):

0

C(z) =
M

cm z
m= N +1

D(z) =
m=1

dm z

IET, NTNU Digital Communication, Adaptive equalization 4

Linear equalizer
Error signal: Equalizer output: Coefcient vector: Mean square error:

E k = Ak Qk
Qk = c Trk k

NB.: Real signals are assumed

c T = [c L , ... c 0 , ... c L ] k
L

Input signal vector: rkT = [ Rk +L , ... Rk , ... Rk

2 k

= E[ E k ] = E[(Ak c Trk ) 2 ] = k

E[Ak2 ] 2E[Ak c Trk ] + E[c Trk rkTc k ] = k k E[Ak2 ] 2c T E[Ak rk ] + c T E[rk rkT ]c k = k k E[Ak2 ] 2c T + c T c k , k k
where
IET, NTNU Digital Communication, Adaptive equalization 5

= E[rk rkT ] (Autocorrelation matrix)

= E[Ak rk ] (Cross correlation vector)

Linear equalizer, cntd.

Autocorrelation matrix:
0 1 1 0 1 2 1 0 2 1 2L 2 1 0 2L

= E[rk r ] =

T k

Matrix elements:

= E[Rk Rk + j ]
IET, NTNU

Digital Communication, Adaptive equalization

Linear equalizer, cntd.

Mean square error: Minimum wrt. ck: Optimum lter vector: Minimum square error:
min
k

= E[Ak2 ] 2c T + c T c k , k k

grad( k ) = 2 + 2 c k = 0
ck

c opt =

= E[Ak2 ] 2
T 1

E[Ak2 ]

IET, NTNU Digital Communication, Adaptive equalization 7

Linear equalizer, example

Ak = 1

h
0.6],
1

Qk

Rk
1

Ak

Ek

hT = [0.5 1
j

H(z) = 0.5z + 1 0.6z

1

= E[Rk Rk + j ] = E[
j

hi1hi2 Ak i1 Ak + j
i1= 1 i2= 1

i2

E[Ak Ak + j ] =
1 j

) : contributions for i2 = i1+ j

0

=
i1= 1

hi1 hi1+ j ,

= 1.61,

= 0.10,

= 0.30,

=0

j >2

For L = 1 or N = 2L+1 = 3:

1.61 0.1 0.3 0.1 1.61 0.1 3 = 0.3 0.1 1.61

IET, NTNU 8

Digital Communication, Adaptive equalization

Linear equalizer, example cntd.

1 j

= E[Ak Rk j ] = E[Ak
i= 1

hi Ak

j i

],

contributions for

j= i

h j 0

j >1
3

For N = 3:

= [ 0.6 1 0.5]T

Optimum lter vector, N = 3: Minimum error, N = 3: Minimum error for different lter lengths

c opt 3 = [ 0.2786 0.6223 0.2973]T

min 3

= E[Ak2 ]

T 3

1 3 3

= 0.0619
min

Filter length, N 3 5 7 9
Digital Communication, Adaptive equalization

Minimum error, 0.0619 0.0134 0.0029 0.0006

IET, NTNU 9

N=3

IET, NTNU Digital Communication, Adaptive equalization 10

N=5

IET, NTNU Digital Communication, Adaptive equalization 11

N=7

IET, NTNU Digital Communication, Adaptive equalization 12

N=9

IET, NTNU Digital Communication, Adaptive equalization 13

The principle of orthogonality

For optimum ck, copt:

E[E k rk ] = E[(Ak c T rk )rk ] = opt E[Ak rk ] E[rk rkT ]c opt =

For optimum coefcients ck: Rk-i and Ek are uncorrelated for -L

c opt = 0

IET, NTNU Digital Communication, Adaptive equalization 14

MSE gradient algorithm

(= steepest descent algorithm)
2 c k +1 = c k + ( c k +1 = c k grad( k )
ck

c k ) = (I
1

)c k +

Deviation from optimum coefcients:

qk = c k c opt = c k qk +1 + qk +1 = (I
Convergence:
1

= (I )qk qk = (I

)(qk +

)+

) k q0
IET, NTNU 15

Digital Communication, Adaptive equalization

Convergence for the MSE gradient algorithm

IET, NTNU Digital Communication, Adaptive equalization 16

Convergence for the MSE gradient algorithm

Diagonalization of , is Hermitian
T= * 1, 2,

The autocorrelation matrix

has N eigenvalues,

...

Normalized eigenvectors v1, v2, ... vN Eigenvector matrix: V is unitary ):

V = [v1 v 2 v N ]
V 1 = VH = V T

(vH v i = v T v i = 1) i i

The autocorrelation matrix may be expressed:

1

= V VH

0
2

where:

= diag( 1,

2 ,

N) =

0 0 0

0 0 0

0 0

0 0 0
N

IET, NTNU Digital Communication, Adaptive equalization 17

Convergence for the MSE gradient algorithm

qk +1 = (I )qk = (I V VH )qk

Multiplication by VH:
VHqk +1 = VHqk VH V VHqk = (I )VHqk

This is a modal decomposition of the deviation from optimum coefcients:

k

=[

(k ) 1

(k ) 2

(k ) N

] = VHqk
k +1

Convergence given by:

= (I

Independent convergence for each mode:

(k +1) i

= (1

(k ) i

= (1

) k +1

(0) i

i = 1, N
IET, NTNU 18

Digital Communication, Adaptive equalization

Conditions for convergence:

1
i

< 1,

i = 1,, N

0<

<

2
max

IET, NTNU Digital Communication, Adaptive equalization 19

Optimum step size for convergence

1
opt min

=1

opt

max

opt

=
max

2
min

IET, NTNU Digital Communication, Adaptive equalization 20

Speed of convergence vs. eigenvalue spread

Slow convergence

Fast convergence

IET, NTNU Digital Communication, Adaptive equalization 21

The effect of eigenvalue spread

IET, NTNU Digital Communication, Adaptive equalization 22

LMS algorithm for linear equalizer

Assuming real signals, minimize |Ek|2 (omit averaging):

E k2 = (Ak c Trk ) 2 k
grad(E k2 ) = 2(Ak c Trk )rk = 2E k rk k
ck

LMS algorithm:

c k +1 = c k

grad(E k2 )
ck

c k +1 = c k + E k rk
IET, NTNU Digital Communication, Adaptive equalization 23

Adaptation for the LMS algorithm

IET, NTNU Digital Communication, Adaptive equalization 24

IET, NTNU Digital Communication, Adaptive equalization 25

Convergence for the LMS algorithm

The convergence will be the same as for echo cancelling. If = the convergence will be determined by the factor = [1 - 2 + N 2 ], opt=1/N

IET, NTNU Digital Communication, Adaptive equalization 26

Excess error due to the LMS algorithm

Total error : E[| E k |2 ] =
min

+ E[qT qk ] k

E[ qk ] =

min min

E[| E k |2 ] = 2

IET, NTNU Digital Communication, Adaptive equalization 27

IET, NTNU Digital Communication, Adaptive equalization 28

IET, NTNU Digital Communication, Adaptive equalization 29

IET, NTNU Digital Communication, Adaptive equalization 30

Modications of the LMS algorithm

The normalized LMS algorithm is suitable if there are large variations in the power of the input signal. The step size is given by:

a
2 R

, a is a constant, = a 2 R +b

2 R

is an estimate of E(Rk2 )
(limit maximum )

Modied version:

Gear shift algorithm, set of different step sizes:

large
1

small
2

Use when |Ek| is large

Use when |Ek| is small

IET, NTNU 31

Digital Communication, Adaptive equalization

Sign algorithms
I II III

c k +1 = c k + c k +1 = c k + c k +1 = c k +

sign(E k )rk E k sign(rk ) sign(E k )sign(rk )

sign(rk ) = [Rk +L , Rk , Rk L ]T
- simpler implementation - slower convergence than the LMS algorithm
IET, NTNU Digital Communication, Adaptive equalization 32

Decision feedback equalizer (DFE)

IET, NTNU Digital Communication, Adaptive equalization 33

Model of DFE for correct decisions

IET, NTNU Digital Communication, Adaptive equalization 34

LMS algorithm for DFE equalization

Extended coefcient vector:

v T = [c k

N +1

, c 0 , d1, dM ]

Extended input signal vector:

wT = [Rk +N 1, Rk , Ak +1, Ak k
Error signal: LMS algorithm:

E k = Ak

v Tw k k

v k +1 = v k +

E k wk
IET, NTNU 35

Digital Communication, Adaptive equalization

IET, NTNU Digital Communication, Adaptive equalization 36

IET, NTNU Digital Communication, Adaptive equalization 37

Restricted region for lter coefcients

IET, NTNU Digital Communication, Adaptive equalization 38

Passband equalizer

IET, NTNU Digital Communication, Adaptive equalization 39

Passband equalizer

IET, NTNU Digital Communication, Adaptive equalization 40

Modem standards (ITU)

IET, NTNU Digital Communication, Adaptive equalization 41