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. © Springer-Verlag 2004.
Cite
CITATION STYLE
Ramos, A. L. L., & Apolinário, J. A. (2004). A lattice version of the multichannel fast QRD algorithm based on A Posteriori backward errors. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3124, 488–497. https://doi.org/10.1007/978-3-540-27824-5_66
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
