Skip to main content

Fast Transversal RLS Algorithms

  • Chapter
  • First Online:
Adaptive Filtering
  • 2424 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,2,3,4,5,6,7].

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 129.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. D.D. Falconer, L. Ljung, Application of fast Kalman estimation to adaptive equalization. IEEE Trans. Comm. COM-26, 1439–1446 (1978)

    Article  Google Scholar 

  2. G. Carayannis, D.G. Manolakis, N. Kalouptsidis, A fast sequential algorithm for least-squares filtering and prediction. IEEE Trans. Acoust. Speech Signal Process. ASSP-31, 1394–1402 (1983)

    Article  Google Scholar 

  3. J.M. Cioffi, T. Kailath, Fast, recursive-least-squares transversal filters for adaptive filters. IEEE Trans. Acoust. Speech Signal Process. ASSP-32, 304–337 (1984)

    Google Scholar 

  4. S. Ljung, L. Ljung, Error propagation properties of recursive least-squares adaptation algorithms. Automatica 21, 157–167 (1985)

    Article  MathSciNet  Google Scholar 

  5. J.-L. Botto, G.V. Moustakides, Stabilizing the fast Kalman algorithms. IEEE Trans. Acoust. Speech Signal Process. 37, 1342–1348 (1989)

    Article  Google Scholar 

  6. M. Bellanger, Engineering aspects of fast least squares algorithms in transversal adaptive filters, in Proceedings of the IEEE International Conference on Acoustics, Speech, Signal Processing (1987), pp. 49.14.1–49.14.4

    Google Scholar 

  7. J.M. Cioffi, T. Kailath, Windowed fast transversal filters adaptive algorithms with normalization. IEEE Trans. Acoust. Speech Signal Process. ASSP-33, 607–627 (1985)

    Article  Google Scholar 

  8. D.T.M. Slock, T. Kailath, Numerically stable fast transversal filters for recursive least squares adaptive filtering. IEEE Trans. Signal Process. 39, 92–113 (1991)

    Article  Google Scholar 

  9. D.T.M. Slock, T. Kailath, Fast transversal filters with data sequence weighting. IEEE Trans. Acoust. Speech Signal Process. 37, 346–359 (1989)

    Article  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  11. B. Toplis, S. Pasupathy, Tracking improvements in fast RLS algorithms using a variable forgetting factor. IEEE Trans. Acoust. Speech Signal Process. 36, 206–227 (1988)

    Article  Google Scholar 

  12. D. Boudreau, P. Kabal, Joint-time delay estimation and adaptive recursive least squares filtering. IEEE Trans. Signal Process. 41, 592–601 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Paulo S. R. Diniz .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Diniz, P.S.R. (2020). Fast Transversal RLS Algorithms. In: Adaptive Filtering. Springer, Cham. https://doi.org/10.1007/978-3-030-29057-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-29057-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-29056-6

  • Online ISBN: 978-3-030-29057-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics