DocumentCode
1043548
Title
Optimal Step-Size Constant Modulus Algorithm
Author
Zarzoso, Vicente ; Comon, Pierre
Author_Institution
Univ. de Nice, Sophia Antipolis
Volume
56
Issue
1
fYear
2008
fDate
1/1/2008 12:00:00 AM
Firstpage
10
Lastpage
13
Abstract
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.
Keywords
iterative methods; polynomials; iterative techniques; optimal step-size constant modulus algorithm; performance-versus-complexity trade-off; third-degree polynomial; Blind equalizers; Convergence; Cost function; Delay; Digital communication; Matrix decomposition; Mean square error methods; Polynomials; Recursive estimation; Stochastic processes;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2008.050484
Filename
4436082
Link To Document