Skip to main content

A Lattice Version of the Multichannel Fast QRD Algorithm Based on A Posteriori Backward Errors

  • Conference paper
Telecommunications and Networking - ICT 2004 (ICT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3124))

Included in the following conference series:

Abstract

Fast QR decomposition (QRD) RLS algorithms based on backward prediction errors are well known for their good numerical behavior and their low complexity when compared to similar algorithms with forward error update. Although the basic matrix expressions are similar, their application to multiple channel input signals generate more complex equations. This paper presents a lattice version of the multichannel fast QRD algorithm based on a posteriori backward errors updating. This new algorithm comprises scalar operations only; its modularity and pipelinability favors its systolic array implementation.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kalouptsidis, N., Theodoridis, S.: Adaptive Systems Identification and Signal Processing Algorithms. Prentice Hall, Englewood Cliffs (1993)

    Google Scholar 

  2. Apolinário Jr., J.A., Siqueira, M.G., Diniz, P.S.R.: Fast QR Algorithms Based on Backward Prediction Errors: A New Implementation and Its Finite Precision Performance. Birkhäuser Circuits, Systems, and Signal Processing 22(4), 335–349 (2003)

    MATH  Google Scholar 

  3. Rontogiannis, A.A., Theodoridis, S.: Multichannel fast QRD-LS adaptive filtering: New technique and algorithms. IEEE Transactions on Signal Processing 46, 2862–2876 (1998)

    Article  Google Scholar 

  4. Medina, C.A., Apolinário Jr., S.J.A., Siqueira, M.G.: A unified framework for multichannel fast QRD-LS adaptive filters based on backward prediction errors. IEEE Midwest Symposium on Circuits and Systems 3, 668–671 (2002)

    Google Scholar 

  5. Apolinário Jr., J.A.: New algorithms of adaptive filtering: LMS with data-reusing and fast RLS based on QR decomposition, D.Sc. Thesis, COPPE/Federal University of Rio de Janeiro, Rio de Janeiro, Brazil (1998)

    Google Scholar 

  6. Golub, G.H., Van Loan, C.F.: Matrix Computations. The Johns Hopkins University Press, Baltimore (1983)

    MATH  Google Scholar 

  7. Griffiths, L.J., Jim, C.W.: An alternative approach to linearly constrained adaptive beamforming. IEEE Transactions on Antennas and Propagation AP-30, 27–34 (1982)

    Article  Google Scholar 

  8. de Campos, M.L.R., Werner, S., Apolinário Jr., J.A., Laakso, T.I.: Constrained adaptation algorithms employing Housholder transformation. IEEE Transactions on Signal Processing 50(9), 2187–2195 (2002)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ramos, A.L.L., Apolinário, J.A. (2004). A Lattice Version of the Multichannel Fast QRD Algorithm Based on A Posteriori Backward Errors. In: de Souza, J.N., Dini, P., Lorenz, P. (eds) Telecommunications and Networking - ICT 2004. ICT 2004. Lecture Notes in Computer Science, vol 3124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27824-5_66

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27824-5_66

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22571-3

  • Online ISBN: 978-3-540-27824-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics