On the Constant Modulus Criterion: A New Algorithm

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.