.png){kind=icon}
Return
Optimal step-size constant modulus algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2008.050484.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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:
adaption coefficient
blind equalization
CMA
exact line search
SIMO and SISO channels
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveHydrogen-bond basicity of the sulfonyl group. The case of strongly basic sulfonamidates RSO2NNMe3
PREAI
ShareSaveShareSave
View more