.png){kind=icon}
返回
Optimal step-size constant modulus algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2008.050484.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
adaption coefficient
blind equalization
CMA
exact line search
SIMO and SISO channels
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
.png){kind=icon}
Hydrogen-bond basicity of the sulfonyl group. The case of strongly basic sulfonamidates RSO2NNMe3
PREAI
分享收藏
查看更多内容