Skip to main content

Conventional RLS Adaptive Filter

  • Chapter
Book cover Adaptive Filtering

Part of the book series: The Kluwer International Series in Engineering and Computer Science ((SECS,volume 694))

  • 439 Accesses

Abstract

Least-squares algorithms aim at the minimization of the sum of the squares of the difference between the desired signal and the model filter output [1]–[2]. When new samples of the incoming signals are received at every iteration, the solution for the least-squares problem can be computed in recursive form resulting in the recursive least-squares (RLS) algorithms. The conventional version of these algorithms will be the topic of the present chapter.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. C. Goodwin and R. L. Payne, Dynamic System Identification: Experiment Design and Data Analysis, Academic Press, New York, NY, 1977.

    MATH  Google Scholar 

  2. S. Haykin, Adaptive Filter Theory, Prentice Hall, Englewood Cliffs, NJ, 4th edition, 2002.

    Google Scholar 

  3. S. H. Ardalan, “Floating-point analysis of recursive least-squares and leastmean squares adaptive filters,” IEEE Trans, on Circuits and Systems, vol. CAS-33, pp. 1192–1208, Dec. 1986.

    Article  Google Scholar 

  4. J. M. Ciofß, “Limited precision effects in adaptive filtering,” IEEE Trans, on Circuits and Systems, vol. CAS-34, pp. 821–833, July 1987.

    Google Scholar 

  5. R. S. Medaugh and L. J. Griffiths, “A comparison of two linear predictors,” Proc. IEEE Intern. Conf. on Acoust., Speech, Signal Processing, Atlanta, GA, pp. 293–296, April 1981.

    Google Scholar 

  6. F. Ling and J. G. Proakis, “Nonstationary learning characteristics of least squares adaptive estimation algorithms,” Proc. IEEE Intern. Conf. on Acoust., Speech, Signal Processing, San Diego, CA, pp. 30.3.1.–30.3.4, March 1984.

    Google Scholar 

  7. E. Eleftheriou and D. D. Falconer, “Tracking properties and steady-state performance of RLS adaptive filter algorithms,” IEEE Trans, on Acoust., Speech, and Signal Processing, vol. ASSP-34, pp. 1097–1110, Oct. 1986.

    Article  Google Scholar 

  8. J. M. Cioffi and T. Kailath, “Fast recursive-least-squares transversal filters for adaptive filtering,” IEEE Trans, on Acoust., Speech, and Signal Processing, vol. ASSP-32, pp. 304–337, April 1984.

    Article  Google Scholar 

  9. S. Ardalan, “On the sensitivity of transversal RLS algorithms to random perturbations in the filter coefficients,” IEEE Trans, on Acoust., Speech, and Signal Processing, vol. 36, pp. 1781–1783, Nov. 1988.

    Article  MATH  Google Scholar 

  10. C. R. Johnson, Jr., Lectures on Adaptive Parameter Estimation, Prentice Hall, Englewood Cliffs, NJ, 1988.

    Google Scholar 

  11. O. M. Macchi and N. J. Bershad, “Adaptive recovery of a chirped sinusoid in noise, Part 1: performance of the RLS algorithm,” IEEE Trans, on Signal Processing, vol. 39, pp. 583–594, March 1991.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media New York

About this chapter

Cite this chapter

Ramirez, P.S. (2002). Conventional RLS Adaptive Filter. In: Adaptive Filtering. The Kluwer International Series in Engineering and Computer Science, vol 694. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3637-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3637-3_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4757-3639-7

  • Online ISBN: 978-1-4757-3637-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics