Loading…

Blind constant modulus equalization via convex optimization

In this paper, we formulate the problem of blind equalization of constant modulus (CM) signals as a convex optimization problem. The convex formulation is obtained by performing an algebraic transformation on the direct formulation of the CM equalization problem. Using this transformation, the origi...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 2003-03, Vol.51 (3), p.805-818
Main Authors: Mariere, B., Zhi-Quan Luo, Davidson, T.N.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we formulate the problem of blind equalization of constant modulus (CM) signals as a convex optimization problem. The convex formulation is obtained by performing an algebraic transformation on the direct formulation of the CM equalization problem. Using this transformation, the original nonconvex CM equalization formulation is turned into a convex semidefinite program (SDP) that can be efficiently solved using interior point methods. Our SDP formulation is applicable to baud spaced equalization as well as fractionally spaced equalization. Performance analysis shows that the expected distance between the equalizer obtained by the SDP approach and the optimal equalizer in the noise-free case converges to zero exponentially as the signal-to-noise ratio (SNR) increases. In addition, simulations suggest that our method performs better than standard methods while requiring significantly fewer data samples.
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2002.808112