Advertisement
Published in:
2011 | OriginalPaper | Chapter
Recursive Least-Squares Algorithms
Authors : Jacob Benesty, Constantin Paleologu, Tomas Gänsler, Silviu Ciochină
Published in: A Perspective on Stereophonic Acoustic Echo Cancellation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Thanks to their fast convergence rate, recursive least-squares (RLS) algorithms are very popular in SAEC [1]. Indeed, it is well known that the convergence rate of RLS-type algorithms are not much affected by the nature of the input signal, even when this one is ill-conditioned. Actually, the very first SAEC prototype was based on the fast RLS (FRLS) algorithm, which was implemented in subbands [2]. In this chapter, we derive the RLS and FRLS algorithms in the WL context.