A decision-directed constant modulus algorithm for higher-order source constellations

This paper discusses methods for calculating and implementing the update error term for the popular blind equalization algorithm known as Godard's (1980) algorithm, or the constant modulus algorithm (CMA), without the use of multipliers so that the chip area and signal latency are both substant...

Full description

Saved in:
Bibliographic Details
Published in2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100) Vol. 6; pp. 3382 - 3385 vol.6
Main Authors Endres, T.J., Hulyalkar, S.N., Strolle, C.H., Schaffer, T.A., Casas, R.A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2000
Subjects
Baseband
Costs
Delay
Equalizers
Error correction
Passband
Quadrature amplitude modulation
Quantization
Robustness
Table lookup
Online AccessGet full text

Cover

More Information
Summary:This paper discusses methods for calculating and implementing the update error term for the popular blind equalization algorithm known as Godard's (1980) algorithm, or the constant modulus algorithm (CMA), without the use of multipliers so that the chip area and signal latency are both substantially reduced. A decision-directed CMA update term is derived for higher-order (non-constant modulus) source alphabets. The modified update error term can be calculated using a look-up table in place of costly multipliers and adders. Baseband and passband implementations for one-dimensional and two-dimensional signaling are discussed.
ISBN:9780780362932
0780362934
ISSN:1520-6149
2379-190X
DOI:10.1109/ICASSP.2000.860126