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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benesty, J., Gänsler, T., Morgan, D.R., Sondhi, M.M., Gay, S.L.: Advances in Network and Acoustic Echo Cancellation. Springer, Berlin (2001)
Eneroth, P., Gay, S.L., Gänsler, T., Benesty, J.: A real-time implementation of a stereophonic acoustic echo canceler. IEEE Trans. Audio, Speech Process. 9, 513–523 (2001)
Bellanger, M.G.: Adaptive Filters and Signal Analysis. Marcel Dekker, New York (1988)
Haykin, S.: Adaptive Filter Theory, 4th edn. Prentice- Hall, Upper Saddle River (2002)
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Benesty, J., Paleologu, C., Gänsler, T., Ciochină, S. (2011). Recursive Least-Squares Algorithms. In: A Perspective on Stereophonic Acoustic Echo Cancellation. Springer Topics in Signal Processing, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22574-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-22574-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22573-4
Online ISBN: 978-3-642-22574-1
eBook Packages: EngineeringEngineering (R0)