Adaptive Constant Modulus Algorithm Based on Complex Givens Rotations - Université d'Orléans Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Adaptive Constant Modulus Algorithm Based on Complex Givens Rotations

Résumé

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 here in 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.
Fichier principal
Vignette du fichier
2014-06-29_SSP_Adaptive_CMA_Based_On_Complex_Givens_Rotations.pdf (236.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01002437 , version 1 (12-01-2015)

Identifiants

  • HAL Id : hal-01002437 , version 1

Citer

Abdelwaheb Boudjellal, Karim Abed-Meraim, Adel Belouchrani, Philippe Ravier. Adaptive Constant Modulus Algorithm Based on Complex Givens Rotations. IEEE Workshop on Statistical Signal Processing (SSP), Jun 2014, Gold Coast, Australia. IEEE Statistical Signal Processing Workshop (SSP), Australia, July 2014. ⟨hal-01002437⟩
174 Consultations
486 Téléchargements

Partager

Gmail Facebook X LinkedIn More