Optimal Step-Size Constant Modulus Algorithm
Résumé
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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...