Premium
Blind equalization for QAM systems based on general linearly constrained convex cost functions
Author(s) -
Yamazaki Ken,
Kennedy Rodney A.
Publication year - 1996
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(199611)10:6<707::aid-acs406>3.0.co;2-b
Subject(s) - intersymbol interference , blind equalization , equalization (audio) , mathematics , mathematical optimization , convex optimization , qam , convergence (economics) , control theory (sociology) , adaptive equalizer , quadrature amplitude modulation , computer science , algorithm , regular polygon , decoding methods , control (management) , bit error rate , geometry , artificial intelligence , economics , economic growth
Most blind QAM equalization algorithms base their parameter adaptation on the minimization of non‐convex cost functions. These cost functions may exhibit local minima which can cause undesirable convergence to equalizer parameter settings, resulting in insufficient removal of the intersymbol interference In contrast, this work considers the minimization of a special convex cost function of the equalizer output in combination with an arbitrary non‐degenerate linear constraint. We establish the property that the cost minimization in the space of the equalizer parameters is achieved on a compact set that contains at least one ideal zero‐ISI equalizer parameter setting. Generically this compact set consists of a single point reflecting an ideal global convergence result, implying zero intersymbol interference. Further, through general abstract methods we demonstrate that this desirable convergence property is largely independent of the input constellation geometry and independent of the linear constraint chosen. The methods are developed for and motivated by the important classes of QAM constellations used in practice.