Increasing the speed of convergence of the constant modulus algorithm for blind channel equalization

Author

Nelatury, Sudarshan Rao ; Rao, Sathyanarayan S.

Author_Institution

Dept. of Electr. & Comput. Eng., Villanova Univ., PA, USA

Volume

50

Issue

6

fYear

2002

fDate

6/1/2002 12:00:00 AM

Firstpage

872

Lastpage

876

Abstract

The constant modulus algorithm (CMA) is an excellent technique for blind channel equalization. A signed error version of CMA (SE-CMA) and dithered signed error version (DSE-CMA) have been proposed which afford overall computational efficiency. We propose three different error functions for faster convergence. This would be essential for communication systems, which cannot afford a high startup delay or for systems, where the channel´s impulse response is rapidly fluctuating. One of these algorithms relies on the idea of a variable step size, which increases the rate of convergence

Keywords

blind equalisers; convergence of numerical methods; error analysis; telecommunication channels; transient response; BPSK; CMA; DSE-CMA; SE-CMA; blind channel equalization; channel impulse response; computational efficiency; constant modulus algorithm; convergence rate; convergence speed; dithered signed error CMA; error functions; signed error CMA; startup delay; variable step size; Adaptive algorithm; Algorithm design and analysis; Binary phase shift keying; Blind equalizers; Computational efficiency; Convergence; Delay lines; Delay systems; Error correction; Robustness;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2002.1010603

Filename

1010603