Convergence analysis of the constant modulus algorithm

Authors:
O. Dabeer;E. Masry
Affiliations:
Dept. of Electr. & Comput. Eng., Univ. of California, Santa Barbara, CA, USA;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 4

Performance analysis of RLS linearly constrained constant modulus algorithm for multiuser detection

Signal Processing
A new multi-modulus blind equalization algorithm for QAM signals

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
DSP implementation and blind equalization algorithms based on coordinate transformation

CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 2
A regional multimodulus algorithm for blind equalization of QAM signals: Introduction and steady-state analysis

Signal Processing

Quantified Score

Hi-index	754.84

Visualization

Abstract

We study the global convergence of the stochastic gradient constant modulus algorithm (CMA) in the absence of channel noise as well as in the presence of channel noise. The case of fractionally spaced equalizer and/or multiple antenna at the receiver is considered. For the noiseless case, we show that with proper initialization, and with small step size, the algorithm converges to a zero-forcing filter with probability close to one. In the presence of channel noise such as additive Gaussian noise, we prove that the algorithm diverges almost surely on the infinite-time horizon. However, under suitable conditions, the algorithm visits a small neighborhood of the Wiener filters a large number of times before ultimately diverging.