Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1587/transfun.E94.A.1628 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
echo cancellation, adaptive filters, regularization, recursive least-squares (RLS) algorithm | Mathematical optimization,System of linear equations,Linear system,Algorithm,Theoretical computer science,Regularization (mathematics),Adaptive filter,Mathematics,Recursive least squares filter,Recursion | Journal |
Volume | Issue | ISSN |
E94A | 8 | 0916-8508 |
Citations | PageRank | References |
5 | 0.55 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jacob Benesty | 1 | 32 | 5.57 |
| Constantin Paleologu | 2 | 227 | 35.46 |
| Silviu Ciochina | 3 | 285 | 35.23 |