.png){kind=icon}
返回
RLS Algorithm With Convex Regularization
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2011.2159373.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this letter, the RLS adaptive algorithm is considered in the system identification setting. The RLS algorithm is regularized using a general convex function of the system impulse response estimate. The normal equations corresponding to the convex regularized cost function are derived, and a recursive algorithm for the update of the tap estimates is established. We also introduce a closed-form expression for selecting the regularization parameter. With this selection of the regularization parameter, we show that the convex regularized RLS algorithm performs as well as, and possibly better than, the regular RLS when there is a constraint on the value of the convex function evaluated at the true weight vector. Simulations demonstrate the superiority of the convex regularized RLS with automatic parameter selection over regular RLS for the sparse system identification setting.
Keyword:
Adaptive filter
convex regularization
l1 norm
l0 norm
RLS
sparsity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
2.0W
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容