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

<p/> <p>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 i...

Full description

Bibliographic Details
Main Authors: Ikhlef Aissa, Le Guennec Daniel
Format: Article
Language:English
Published: SpringerOpen 2007-01-01
Series:EURASIP Journal on Wireless Communications and Networking
Online Access:http://jwcn.eurasipjournals.com/content/2007/090401
id doaj-e791354f878c412791d2903b6d98873c
record_format Article
spelling doaj-e791354f878c412791d2903b6d98873c2020-11-24T21:24:38ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14721687-14992007-01-0120071090401A Simplified Constant Modulus Algorithm for Blind Recovery of MIMO QAM and PSK Signals: A Criterion with Convergence AnalysisIkhlef AissaLe Guennec Daniel<p/> <p>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.</p> http://jwcn.eurasipjournals.com/content/2007/090401
collection DOAJ
language English
format Article
sources DOAJ
author Ikhlef Aissa
Le Guennec Daniel
spellingShingle Ikhlef Aissa
Le Guennec Daniel
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
author_facet Ikhlef Aissa
Le Guennec Daniel
author_sort Ikhlef Aissa
title A Simplified Constant Modulus Algorithm for Blind Recovery of MIMO QAM and PSK Signals: A Criterion with Convergence Analysis
title_short A Simplified Constant Modulus Algorithm for Blind Recovery of MIMO QAM and PSK Signals: A Criterion with Convergence Analysis
title_full A Simplified Constant Modulus Algorithm for Blind Recovery of MIMO QAM and PSK Signals: A Criterion with Convergence Analysis
title_fullStr A Simplified Constant Modulus Algorithm for Blind Recovery of MIMO QAM and PSK Signals: A Criterion with Convergence Analysis
title_full_unstemmed A Simplified Constant Modulus Algorithm for Blind Recovery of MIMO QAM and PSK Signals: A Criterion with Convergence Analysis
title_sort simplified constant modulus algorithm for blind recovery of mimo qam and psk signals: a criterion with convergence analysis
publisher SpringerOpen
series EURASIP Journal on Wireless Communications and Networking
issn 1687-1472
1687-1499
publishDate 2007-01-01
description <p/> <p>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.</p>
url http://jwcn.eurasipjournals.com/content/2007/090401
work_keys_str_mv AT ikhlefaissa asimplifiedconstantmodulusalgorithmforblindrecoveryofmimoqamandpsksignalsacriterionwithconvergenceanalysis
AT leguennecdaniel asimplifiedconstantmodulusalgorithmforblindrecoveryofmimoqamandpsksignalsacriterionwithconvergenceanalysis
AT ikhlefaissa simplifiedconstantmodulusalgorithmforblindrecoveryofmimoqamandpsksignalsacriterionwithconvergenceanalysis
AT leguennecdaniel simplifiedconstantmodulusalgorithmforblindrecoveryofmimoqamandpsksignalsacriterionwithconvergenceanalysis
_version_ 1725987190113042432