Skip to main content

Fast Transversal RLS Algorithms

  • Chapter
Adaptive Filtering

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

  • 460 Accesses

Abstract

Among the large number of algorithms that solve the least-squares problem in a recursive form, the fast transversal recursive least-squares (FTRLS) algorithms are very attractive due to their reduced computational complexity [1]–[7].

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. D. D. Falconer and L. Ljung, “Application of fast Kalman estimation to adaptive equalization,” IEEE Trans, on Communications, vol. COM-26, pp. 1439–1446, Oct. 1978.

    Article  Google Scholar 

  2. G. Carayannis, D. G. Manolakis, and N. Kalouptsidis, “A fast sequential algorithm for least-squares filtering and prediction,” IEEE Trans, on Acoust., Speech, and Signal Processing, vol. ASSP-31, pp. 1394–1402, Dec. 1983.

    Article  Google Scholar 

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

    Article  Google Scholar 

  4. J. M. Cioffi and T. Kailath, “Windowed fast transversal filters adaptive algorithms with normalization,” IEEE Trans, on Acoust., Speech, and Signal Processing, vol. ASSP-33, pp. 607–627, June 1985.

    Article  Google Scholar 

  5. S. Ljung and L. Ljung, “Error propagation properties of recursive least-squares adaptation algorithms,” Automatica, vol. 21, pp. 157–167, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  6. J.-L. Botto and G. V. Moustakides, “Stabilizing the fast Kalman algorithms,” IEEE Trans, on Acoust., Speech, and Signal Processing, vol. 37, pp. 1342–1348, Sept. 1989.

    Article  MATH  Google Scholar 

  7. M. Bellanger, “Engineering aspects of fast least squares algorithms in transversal adaptive filters,” Proc. IEEE Intern. Conf. on Acoust., Speech, Signal Processing, pp. 49.14.1–49.14.4, 1987.

    Google Scholar 

  8. D. T. M. Slock and T. Kailath, “Fast transversal filters with data sequence weighting,” IEEE Trans, on Acoust., Speech, and Signal Processing, vol. 37, pp. 346–359, March 1989.

    Article  MathSciNet  Google Scholar 

  9. D. T. M. Slock and T. Kailath, “Numerically stable fast transversal filters for recursive least squares adaptive filtering,” IEEE Trans, on Signal Processing, vol. 39, pp. 92–113, Jan. 1991.

    Article  MATH  Google Scholar 

  10. J. G. Proakis, C. M. Rader, F. Ling, and C. L. Nikias, Advanced Digital Signal Processing, MacMillan, New York, NY, 1992.

    MATH  Google Scholar 

  11. B. Toplis and S. Pasupathy, “Tracking improvements in fast RLS algorithms using a variable forgetting factor,” IEEE Trans, on Acoust., Speech, and Signal Processing, vol. 36, pp. 206–227, Feb. 1988.

    Article  MATH  Google Scholar 

  12. D. Boudreau and P. Kabal, “Joint-time delay estimation and adaptive recursive least squares filtering,” IEEE Trans, on Signal Processing, vol. 41, pp. 592–601, Feb. 1993.

    Article  MATH  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). Fast Transversal RLS Algorithms. 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_7

Download citation

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

  • 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