Avoiding divergence in the constant modulus algorithm

One of the most popular algorithms for blind equalization is the Constant Modulus Algorithm (CMA), due to its simplicity and low computational cost. However, if the step-size is not properly chosen or if the initialization is distant from the optimal solution, CMA can diverge or converge to undesirable local minima. In order to avoid divergence, we propose a dual-mode algorithm, which works as CMA with a time-variant step-size, but rejects non-consistent estimates of the transmitted signal. We present a deterministic analysis of the stability of the new algorithm for scalar filters. In the vector case, the good performance of the new algorithm is confirmed through numerical simulations.

• Type: Conference
• Year: 2008
• Where: ICASSP
• Authors: Maria D. Miranda, M. T. M. Silva, Vitor H. Nascimento
• Keywords: Algorithm, Constant Modulus Algorithm, ICASSP 2008, Signal Processing, Undesirable Local Minima