Regularization of the RLS Algorithm

被引：18

作者：

Benesty, Jacob ^{[1
]}

Paleologu, Constantin ^{[2
]}

Ciochina, Silvia ^{[2
]}

机构：

[1] Univ Quebec, INRS EMT, Montreal, PQ H5A 1K6, Canada

[2] Univ Politehn Bucuresti, Bucharest, Romania

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2011年 / E94A卷 / 08期

关键词：

echo cancellation; adaptive filters; regularization; recursive least-squares (RLS) algorithm;

D O I：

10.1587/transfun.E94.A.1628

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Regularization plays a fundamental role in adaptive filtering. There are, very likely, many different ways to regularize an adaptive filter. In this letter, we propose one possible way to do it based on a condition that makes intuitively sense. From this condition, we show how to regularize the recursive least-squares (RLS) algorithm.

引用

页码：1628 / 1629

页数：2