Blind Channel Equalization Using Constrained Generalized Pattern Search Optimization and Reinitialization Strategy

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 optimiza...

Full description

Bibliographic Details
Main Authors: Charles Tatkeu, Jean Michel Rouvaen, Iyad Dayoub, Abdelouahib Zaouche
Format: Article
Language:English
Published: SpringerOpen 2008-12-01
Series:EURASIP Journal on Advances in Signal Processing
Online Access:http://dx.doi.org/10.1155/2008/765462
id doaj-6d470d580b6e4ac084bea56c3324b9c4
record_format Article
spelling doaj-6d470d580b6e4ac084bea56c3324b9c42020-11-25T00:19:07ZengSpringerOpenEURASIP Journal on Advances in Signal Processing1687-61721687-61802008-12-01200810.1155/2008/765462Blind Channel Equalization Using Constrained Generalized Pattern Search Optimization and Reinitialization StrategyCharles TatkeuJean Michel RouvaenIyad DayoubAbdelouahib ZaoucheWe 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.http://dx.doi.org/10.1155/2008/765462
collection DOAJ
language English
format Article
sources DOAJ
author Charles Tatkeu
Jean Michel Rouvaen
Iyad Dayoub
Abdelouahib Zaouche
spellingShingle Charles Tatkeu
Jean Michel Rouvaen
Iyad Dayoub
Abdelouahib Zaouche
Blind Channel Equalization Using Constrained Generalized Pattern Search Optimization and Reinitialization Strategy
EURASIP Journal on Advances in Signal Processing
author_facet Charles Tatkeu
Jean Michel Rouvaen
Iyad Dayoub
Abdelouahib Zaouche
author_sort Charles Tatkeu
title Blind Channel Equalization Using Constrained Generalized Pattern Search Optimization and Reinitialization Strategy
title_short Blind Channel Equalization Using Constrained Generalized Pattern Search Optimization and Reinitialization Strategy
title_full Blind Channel Equalization Using Constrained Generalized Pattern Search Optimization and Reinitialization Strategy
title_fullStr Blind Channel Equalization Using Constrained Generalized Pattern Search Optimization and Reinitialization Strategy
title_full_unstemmed Blind Channel Equalization Using Constrained Generalized Pattern Search Optimization and Reinitialization Strategy
title_sort blind channel equalization using constrained generalized pattern search optimization and reinitialization strategy
publisher SpringerOpen
series EURASIP Journal on Advances in Signal Processing
issn 1687-6172
1687-6180
publishDate 2008-12-01
description 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.
url http://dx.doi.org/10.1155/2008/765462
work_keys_str_mv AT charlestatkeu blindchannelequalizationusingconstrainedgeneralizedpatternsearchoptimizationandreinitializationstrategy
AT jeanmichelrouvaen blindchannelequalizationusingconstrainedgeneralizedpatternsearchoptimizationandreinitializationstrategy
AT iyaddayoub blindchannelequalizationusingconstrainedgeneralizedpatternsearchoptimizationandreinitializationstrategy
AT abdelouahibzaouche blindchannelequalizationusingconstrainedgeneralizedpatternsearchoptimizationandreinitializationstrategy
_version_ 1725373268168278016