A Lattice Shalvi-Weinstein Algorithm for Blind Equalization

Author

Bernardes, D.B. ; Miranda, Maria D. ; Silva, Magno T. M.

Author_Institution

Pos-Graduacao em Engenharia Eletrica, Univ. Presbiteriana Mackenzie, Brazil

Volume

3

fYear

2007

fDate

15-20 April 2007

Abstract

In blind equalization, the constant modulus algorithm (CMA) and Shalvi-Weinstein algorithm (SWA) present an unfavorable tradeoff between convergence rate and computational cost. Inspired in supervised order-recursive algorithms, we propose a lattice SWA, which has the number of operations per iteration of the equalizer order and maintains the SWA convergence rate. It presents a more robust behavior than that of SWA, avoiding numerical divergence when implemented in finite precision.

Keywords

adaptive filters; blind equalisers; adaptive filters; blind equalization; constant modulus algorithm; lattice Shalvi-Weinstein algorithm; supervised order-recursive algorithms; Adaptive equalizers; Blind equalizers; Computational complexity; Computational efficiency; Convergence; Cost function; Lattices; Least squares approximation; Resonance light scattering; Robustness; Adaptive filters; Shalvi-Weinstein Algorithm; blind equalization; lattice structure; order-recursive algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on

Conference_Location

Honolulu, HI

ISSN

1520-6149

Print_ISBN

1-4244-0727-3

Type

conf

DOI

10.1109/ICASSP.2007.367100

Filename

4217973