Premium
Soft constraint satisfaction (SCS) blind channel equalization algorithms
Author(s) -
Tanrikulu Oğuz,
Baykal Buyurman,
Constantinides Anthony G.,
Chambers Jonathon A.
Publication year - 1998
Publication title -
international journal of adaptive control and signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.73
H-Index - 66
eISSN - 1099-1115
pISSN - 0890-6327
DOI - 10.1002/(sici)1099-1115(199803)12:2<117::aid-acs483>3.0.co;2-y
Subject(s) - constant (computer programming) , constraint (computer aided design) , autoregressive model , blind equalization , algorithm , channel (broadcasting) , equalization (audio) , modulus , computer science , mathematics , mathematical optimization , control theory (sociology) , artificial intelligence , statistics , telecommunications , programming language , control (management) , geometry
The constant modulus adaptive blind equalization algorithms presented in this paper are shown to correspond to an error performance surface which is much improved upon that of existing algorithms such as the well‐known constant modulus (or Godard) algorithm. Many undesirable local solutions (ULSs) are avoided by careful derivation. We use a deterministic optimization criterion with a soft constraint to obtain an update equation which contains a normalized gradient vector and a particular continuous non‐linearity. This approach is extended to multiple constraints to yield faster converging algorithms. An autoregressive AR channel model is studied to demonstrate analytically the absence of a class of ULSs. Finally, the findings are verified experimentally for various (AR) and moving‐average (MA) channels. © 1998 John Wiley & Sons, Ltd.