- Research Article
- Open Access
Blind Channel Equalization Using Constrained Generalized Pattern Search Optimization and Reinitialization Strategy
EURASIP Journal on Advances in Signal Processing volume 2008, Article number: 765462 (2008)
We propose a global convergence baud-spaced blind equalization method in this paper. This method is based on the application of both generalized pattern optimization and channel surfing reinitialization. The potentially used unimodal cost function relies on higher- order statistics, and its optimization is achieved using a pattern search algorithm. Since the convergence to the global minimum is not unconditionally warranted, we make use of channel surfing reinitialization (CSR) strategy to find the right global minimum. The proposed algorithm is analyzed, and simulation results using a severe frequency selective propagation channel are given. Detailed comparisons with constant modulus algorithm (CMA) are highlighted. The proposed algorithm performances are evaluated in terms of intersymbol interference, normalized received signal constellations, and root mean square error vector magnitude. In case of nonconstant modulus input signals, our algorithm outperforms significantly CMA algorithm with full channel surfing reinitialization strategy. However, comparable performances are obtained for constant modulus signals.
To access the full article, please see PDF.
About this article
Cite this article
Zaouche, A., Dayoub, I., Rouvaen, J.M. et al. Blind Channel Equalization Using Constrained Generalized Pattern Search Optimization and Reinitialization Strategy. EURASIP J. Adv. Signal Process. 2008, 765462 (2008). https://doi.org/10.1155/2008/765462
- Global Minimum
- Vector Magnitude
- Error Vector Magnitude
- Signal Constellation
- Channel Equalization