A Lattice Version of the Multichannel Fast QRD Algorithm Based on A Posteriori Backward Errors
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.
KeywordsPrediction Error Cholesky Factor Speech Enhancement Order Matrix Scalar Operation
Unable to display preview. Download preview PDF.
- 1.Kalouptsidis, N., Theodoridis, S.: Adaptive Systems Identification and Signal Processing Algorithms. Prentice Hall, Englewood Cliffs (1993)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