A simplified constant modulus algorithm for blind recovery of MIMO QAM and PSK signals: A criterion with convergence analysis

19Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The problem of blind recovery of QAM and PSK signals for multiple-input multiple-output (MIMO) communication systems is investigated. We propose a simplified version of the well-known constant modulus algorithm (CMA), named simplified CMA (SCMA). The SCMA cost function consists in projection of the MIMO equalizer outputs on one dimension (either real or imaginary part). A study of stationary points of SCMA reveals the absence of any undesirable local stationary points, which ensures a perfect recovery of all signals and a global convergence of the algorithm. Taking advantage of the phase ambiguity in the solution of the new cost function for QAM constellations, we propose a modified cross-correlation term. It is shown that the proposed algorithm presents a lower computational complexity compared to the constant modulus algorithm (CMA) without loss in performances. Some numerical simulations are provided to illustrate the effectiveness of the proposed algorithm.

Cite

CITATION STYLE

APA

Ikhlef, A., & Le Guennec, D. (2007). A simplified constant modulus algorithm for blind recovery of MIMO QAM and PSK signals: A criterion with convergence analysis. Eurasip Journal on Wireless Communications and Networking, 2007. https://doi.org/10.1155/2007/90401

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free