Optimal Step-Size Constant Modulus Algorithm

Abstract : The step size leading to the global minimum of the constant modulus (CM) criterion along the search direction can be obtained algebraically at each iteration among the roots of a third-degree polynomial. The resulting optimal step-size CMA (OS-CMA) is compared with other CM-based iterative techniques in terms of performance-versus-complexity trade-off.
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00327594
Contributor : Pierre Comon <>
Submitted on : Wednesday, October 8, 2008 - 8:32:42 PM
Last modification on : Monday, November 5, 2018 - 3:52:01 PM
Document(s) archivé(s) le : Friday, June 4, 2010 - 12:22:48 PM

Files

tcom-05-0484.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Vicente Zarzoso, Pierre Comon. Optimal Step-Size Constant Modulus Algorithm. IEEE Transactions on Communications, Institute of Electrical and Electronics Engineers, 2008, 56 (1), pp.10-13. ⟨10.1109/TCOMM.2008.050484⟩. ⟨hal-00327594⟩

Share

Metrics

Record views

331

Files downloads

1246