Skip to Main content Skip to Navigation
Conference papers

On the constant modulus criterion : a new algorithm

Abstract : In this paper, we propose a new iterative algorithm for the minimization of the constant modulus (CM) criterion. It is composed of two stages: Prewhitening followed by complex Givens rotations, whence the name Givens CMA (GCMA). Initially, prewhitening reduces the channel matrix into a unitary matrix. Subsequently, this unitary matrix is computed via complex Givens rotations by minimizing the CM criterion. The proposed algorithm provides similar or even better performance than the Analytical CMA (ACMA) algorithm at reduced computational cost. Some simulation results are provided to illustrate the effectiveness of the proposed algorithm.
Complete list of metadata
Contributor : Myriam Andrieux Connect in order to contact the contributor
Submitted on : Friday, April 9, 2010 - 9:13:46 AM
Last modification on : Thursday, January 20, 2022 - 12:54:10 PM


  • HAL Id : hal-00471825, version 1


Aissa Ikhlef, Karim Abed-Meraim, Daniel Le Guennec. On the constant modulus criterion : a new algorithm. IEEE International Conference on Communications, ICC 2010, May 2010, Cap Town, South Africa. 5 p. ⟨hal-00471825⟩



Les métriques sont temporairement indisponibles