A Simplified Constant Modulus Algorithm for Blind Recovery of MIMO QAM and PSK Signals: A Criterion with Convergence Analysis

被引:0
|
作者
Aissa Ikhlef
Daniel Le Guennec
机构
[1] IETR/SUPELEC,
来源
EURASIP Journal on Wireless Communications and Networking | / 2007卷
关键词
Cost Function; Imaginary Part; Computational Complexity; Stationary Point; Convergence Analysis;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
相关论文
共 50 条