.png){kind=icon}
返回
Partial-update L∞-norm based algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSI.2006.883863.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The computational complexity of an adaptive filtering algorithm increases with increasing the filter tap length and therefore, the use of such a filter can become prohibitive for certain applications, especially for real-time implementation. In this paper, we develop low-complexity adaptive filtering algorithms by incorporating the concept of partial updating of the filter coefficients into the technique of finding the gradient vector in the hyperplane based on the L-infinity-norm criterion. Two specific partial update algorithms based on the sequential and M-Max coefficient updating are proposed. The statistical analyses of the two algorithms are carried out, and evolution equations for the mean and mean-square of the filter coefficient misalignment as well as the stability bounds on the step size are obtained. It is shown that the proposed partial update algorithm employing the M-Max coefficient updating can achieve a convergence rate that is closest to that of the full update algorithm. Finally, simulations are carried out to validate the theoretical results and study the convergence rate of the proposed algorithms.
Keyword:
adaptive filter
L-2-norm
L-infinity-norm
order statistics
partial update (PU)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.2
论文数:
9.9K
被引数:
2.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏An electron-spin resonance study of Rh2(O2CCH3) 4(H2O)2+: evidence of πRhRh ODD electron orbital
PREAI
分享收藏
查看更多内容