Constant modulus blind equalisation algorithms under soft constraint satisfaction

Tanrikulu, Oguz; Baykal, Buyurman; Constantinides, A.G.; Chambers, Jonathon

Constant modulus blind equalisation algorithms under soft constraint satisfaction

conference contribution

posted on 2010-01-26, 12:50 authored by Oguz Tanrikulu, Buyurman Baykal, A.G. Constantinides, Jonathon Chambers

New constant modulus (CM) algorithms are presented that are based on soft constraint satisfaction. The stationary points of an algorithm in this family are studied for an AR(p) channel and it is shown that Ding-type undesirable local solutions (ULS) do not exist. This is due to the normalisation of the gradient vector and the soft nonlinearity used in these algorithms. Error performance surfaces (EPS) and convergence trajectories from arbitrary initialisations are presented for various channels that support the analytical findings

History

School

Mechanical, Electrical and Manufacturing Engineering

Citation

TANRIKULU, O. ... et al, 1997. Constant modulus blind equalisation algorithms under soft constraint satisfaction. IN: Proceedings of the 1997 IEEE International Conference on Acoustics, Speech and Signal Processing. ICASSP-97, Munich, 21st-24th April 1997, Vol. 3, pp. 2517-2520

Publisher

Version

VoR (Version of Record)

Publication date

1997

Notes

This is a conference paper [© IEEE]. It is also available from: http://ieeexplore.ieee.org/. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.