We consider the problem of blind equalization of a constant modulus signal. One of the most popular classes of algorithms in this context is the Godard family of blind equalizers , which includes among others the Constant Modulus Algorithm (CMA) . A common drawback of these algorithms is that they may converge to undesired equalizer settings if not properly initialized. This is known as the problem of ill convergence and is primarily due to the non-convex form of the cost function of algorithms of this class with respect to the equalizer parameters. We propose a different approach to the problem, namely, abilinear one, which leads to a different parameterization and to the construction of a convex cost function with respect to the parameters introduced. In a perfectly parameterized case (the equalizer's order matches exactly the order of the channel inverse), the solution to the problem is unique and permits for a direct calculation of the optimal equalizer. In over-parameterized cases however, there exist multiple solutions to our cost function. However, we propose a method that still allows to determine the channel inverse in this case. Different adaptive schemes are proposed to adaptively compute the solution of our criterion and the influence of additive noise is also discussed.
Towards globally convergent blind equalization of constant modulus signals : a bilinear approach
EUSIPCO 1994, 7th European Signal Processing Conference, September 13-16, 1994, Edinburgh, UK
Systèmes de Communication
© EURASIP. Personal use of this material is permitted. The definitive version of this paper was published in EUSIPCO 1994, 7th European Signal Processing Conference, September 13-16, 1994, Edinburgh, UK and is available at :
PERMALINK : https://www.eurecom.fr/publication/530