Ill-convergence of Godard blind equalizers in data communication systems

Abstract

The existence of stable undesirable equilibria for the Godard algorithm is demonstrated through a simple autoregressive (AR) channel model. These undesirable equilibria correspond to local but nonglobal minima of the underlying mean cost function, and thus permit the ill-convergence of the Godard algorithms which are stochastic gradient descent in nature. Simulation results confirm predicted misbehavior. For channel input of constant modulus, it is shown that attaining the global minimum of the mean cost necessarily implies correct equalization. A criterion is also presented for allowing a decision at the equalizer as to whether a global or nonglobal minimum has been reached.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>