DocumentCode
3382967
Title
A normalized constant-modulus algorithm
Author
Jones, Douglas L.
Author_Institution
Coordinated Sci. Lab., Urbana, IL, USA
Volume
1
fYear
1995
fDate
Oct. 30 1995-Nov. 1 1995
Firstpage
694
Abstract
The constant-modulus algorithm (CMA), while the most commonly used blind equalization technique, converges very slowly. We propose a "normalized" constant-modulus algorithm (analogous to the widely used normalized LMS algorithm) with an adjustable step size that greatly increases the convergence rate for noise colorings with large eigenvalue spreads. The normalized step size is proportional to that required to achieve the desired modulus with the current data vector. Only a few extra operations per update are required. Many applications now using the constant modulus algorithm should achieve greatly improved convergence rates at almost negligible computational increase by adopting the new normalized CMA algorithm.
Keywords
adaptive equalisers; convergence of numerical methods; eigenvalues and eigenfunctions; noise; adjustable step size; blind adaptive equalization technique; convergence rate; data vector; large eigenvalue spreads; noise colorings; normalized CMA algorithm; normalized LMS algorithm; normalized constant-modulus algorithm; Adaptive equalizers; Adaptive filters; Blind equalizers; Colored noise; Convergence; Costs; Digital communication; Eigenvalues and eigenfunctions; Least squares approximation; Robustness;
fLanguage
English
Publisher
ieee
Conference_Titel
Signals, Systems and Computers, 1995. 1995 Conference Record of the Twenty-Ninth Asilomar Conference on
Conference_Location
Pacific Grove, CA, USA
ISSN
1058-6393
Print_ISBN
0-8186-7370-2
Type
conf
DOI
10.1109/ACSSC.1995.540639
Filename
540639
Link To Document