.png){kind=icon}
返回
Fast square-root RLS adaptive filtering algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/S0165-1684(97)00006-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper two fast RLS adaptive filtering algorithms are described. Both algorithms compute the lattice coefficients and are based on the development of square-root factorizations of the autocorrelation matrix. Due to the square-root nature of the algorithms, the recursion is numerically stable. Experimental evaluations have been performed in limited precision environment, and comparison with the stabilized fast transversal filter algorithm (Slock and Kailath, 1991) has been made. Since the described algorithms require O(N) operations per sample, where N is the filter order, from a computational complexity point of view they represent a substantial advantage over the O(N-2) complexity of classical square-root algorithms. (C) 1997 Elsevier Science B.V.
Keyword:
adaptive filtering
fast algorithms
recursive least squares
square-root factorization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
暂无机构信息
引用论文
Robust bulk preparation and characterization of sulfamethazine and saccharine salt and cocrystal polymorphs.png)
CrystEngComm
CrystEngCommIF0
PREAI
分享收藏 没有更多内容
没有更多内容