Convergence and performance analysis of Godard family of blind equalization algorithms
Vinod Sharma, V. Naveen Raj · 2004
We obtain the convergence of the Godard family (including SATO and CM algorithms) in a unified way. Our assumptions are quite realistic: the channel input can be asymptotically stationary and ergodic, the channel impulse response is finite and can be stationary, ergodic (this models fading channels) and the equalizer length is finite. The noise is i.i.d. The channel input can be discrete or continuous. Our approach allows us to approximate the whole trajectory of the equalizer coefficients. This provides estimates of the rate of convergence and the system performance (symbol error rate) can be evaluated under transience and steady state.