Fixed window constant modulus algorithms

Author

Xiang-Yang Zhaung ; Swindlehurst, A. Lee

Author_Institution

Dept. of Electr. & Comput. Eng., Brigham Young Univ., Provo, UT, USA

Volume

5

fYear

1999

fDate

1999

Firstpage

2623

Abstract

We propose two batch versions of the constant modulus algorithm in which a fixed block of samples is iteratively reused. The convergence rate of the algorithms is shown to be very fast. The delay to which the algorithms converge can be determined if the peak position of the initialized global channel/equalizer response is known. These fixed window CM algorithms are data efficient, computationally inexpensive and no step-size tuning is required. The effect of noise, and the relationship between the converging delay and noise enhancement are analyzed as well

Keywords

convergence of numerical methods; delays; equalisers; iterative methods; noise; signal sampling; telecommunication channels; batch versions; computationally inexpensive algorithm; convergence rate; converging delay; data efficient algorithm; fixed window CM algorithms; fixed window constant modulus algorithms; initialized global channel/equalizer response; iterations; noise effect; noise enhancement; peak position; samples; Antenna arrays; Approximation algorithms; Convergence; Cost function; Delay effects; Equalizers; Finite impulse response filter; Iterative algorithms; Large scale integration; Noise robustness;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1999. Proceedings., 1999 IEEE International Conference on

Conference_Location

Phoenix, AZ

ISSN

1520-6149

Print_ISBN

0-7803-5041-3

Type

conf

DOI

10.1109/ICASSP.1999.761235

Filename

761235