Adaptive Constant Modulus Algorithm based oncomplex Givens rotations

This paper deals with adaptive Constant Modulus Algorithm (CMA) for the blind separation of communication signals. Ikhlef et al. proposed in 2010 an efficient block implementation of the CMA using Givens rotations. We introduce herein a fast adaptive implementation of this method which exploits recent developments on whitening techniques together with appropriate updating of the used statistics and efficient selection of the Givens rotation parameters. The proposed algorithm shows significantly improved performance with respect to existing techniques as illustrated by the simulation results.