Optimal Step-Size Constant Modulus Algorithm

Optimal Step-Size Constant Modulus Algorithm

The step size leading to the absolute 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 techni...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications 2008-01, Vol.56 (1), p.10-13
Hauptverfasser: Zarzoso, V., Comon, P.
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Algorithms
Applied sciences
Blind equalizers
Computer Science
Convergence
Cost function
Criteria
Delay
Detection, estimation, filtering, equalization, prediction
Digital communication
Engineering Sciences
Exact sciences and technology
Information, signal and communications theory
Matrix decomposition
Mean square error methods
Optimization
Polynomials
Recursive estimation
Roots
Searching
Signal and communications theory
Signal and Image Processing
Signal, noise
Stochastic processes
Telecommunications and information theory
Tradeoffs
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The step size leading to the absolute 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.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2008.050484