.png){kind=icon}
返回
An algorithm based on non-squared sum of the errors
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2015.03.012.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In adaptive filtering, several algorithms are developed in the quest for greater convergence speed, mostly relying on second order statistics. Here we modify the Recursive Least Square (RLS) equations by using as performance surface a weighted sum of even error power. As a result, the equations turn out to be simple, elegant, while yielding faster convergence and preserving the computational cost when compared with the existing RLS algorithm. (C) 2015 Published by Elsevier B.V.
Keyword:
RLS
Adaptive filtering
Non-quadratic function
Convergence speed
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
引用论文
An adaptive recursive algorithm based on non-quadratic function of the error.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
分享收藏