A comparison of three algorithms for blind equalization based on the constant modulus error criterion

Authors:
T. Schirtzinger;X. Li;W. K. Jenkins
Affiliations:
Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA;Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA;Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA
Venue:
ICASSP '95 Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02
Year:
1995

Citing 0
Cited 3

A Novel Approach for Blind Channel Equalization

ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Variable Step-Size Constant Modulus Algorithm Employing Fuzzy Logic Controller

Wireless Personal Communications: An International Journal
Promising Technique of Parameterization For Reconfigurable Radio, the Common Operators Technique: Fundamentals and Examples

Journal of Signal Processing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Three constant modulus algorithms (CMA), the fast quasi-Newton CMA, the transform domain CMA, and the genetic search based CMA are proposed in this paper. The performances of these three algorithms are compared with each other via computer simulation. It is shown that the fast quasi-Newton CMA and the transform domain CMA achieve much faster convergence rate than the constant modulus algorithm based on the LMS algorithm. This fact shows that the whitening technique is not only useful but also necessary for the CMA.