A normalized constant-modulus algorithm
Author:
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (10586393) , 694-697
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
This publication has 3 references indexed in Scilit:
- A comparison of three algorithms for blind equalization based on the constant modulus error criterion2002
- A new approach to multipath correction of constant modulus signalsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1983
- Self-Recovering Equalization and Carrier Tracking in Two-Dimensional Data Communication SystemsIEEE Transactions on Communications, 1980