Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Perspective on Stereophonic Acoustic Echo CancellationRecursive Least-Squares Algorithms

A Perspective on Stereophonic Acoustic Echo Cancellation: Recursive Least-Squares Algorithms [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.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Perspective on Stereophonic Acoustic Echo CancellationRecursive Least-Squares Algorithms

Part of the Springer Topics in Signal Processing Book Series (volume 4)
Benesty, Jacob; Paleologu, Constantin; Gänsler, Tomas; Ciochină, Silviu
Springer Journals — Jan 1, 2011
Download PDF
6 pages

Loading next page...
 
/lp/springer-journals/a-perspective-on-stereophonic-acoustic-echo-cancellation-recursive-a7O7DijJVX
Publisher
Springer Berlin Heidelberg
Copyright
© Springer-Verlag GmbH Berlin Heidelberg 2011
ISBN
978-3-642-22573-4
Pages
63 –69
DOI
10.1007/978-3-642-22574-1_6
Publisher site
See Chapter on Publisher Site

Abstract

[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.]

Published: Jan 1, 2011

There are no references for this article.