We present a new class of adaptive filltering algorithms for blind equalization of constant modulus signals. The algorithms are first derived in a classical system identification context by minimizing at each iteration a deterministic criterion and then their counterpart for blind equalization is derived by modifying this criterion taking into account the constant-modulus property of the transmitted signal. The algorithms impose more constraints than the classical Constant Modulus Algorithm (CMA) and as a result achieve faster convergence. An asymptotic analysis has provided useful parameter bounds that guarantee the algorithms' stability. A priori knowledge of these bounds helps the algorithms escape from undesirable local minima of their cost function thus giving them a potential advantage over the classical CMA. An efficient computational organization for the derived algorithms is also proposed and their behaviour has been tested by means of computer simulations.
New adaptive blind equalization algorithms for constant modulus constellations
ICASSP 1994, 19th IEEE International Conference on Acoustics, Speech, and Signal Processing, 19-22 April 1994, Adelaide, Australia
Systèmes de Communication
© 1994 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
PERMALINK : https://www.eurecom.fr/publication/527