Sliding window adaptive fast QR and QR-lattice algorithms

Sliding window formulations of the fast QR and fast QR-lattice algorithms are presented. The derivations are based on the partial triangularization of raw data matrices. Three methods for window downdating are discussed: the method of plane hyperbolic rotations, the Chambers' method, and the LINPACK algorithm. A numerically ill-conditioned stationary signal and a speech signal are used in finite wordlength simulations of the full QR (nonfast), fast QR, and QR-lattice algorithms. All algorithms are observed to be numerically stable over billions of iterations for double-precision mantissas (53 bits), but as the number of bits is decreased in the mantissa, the algorithms exhibit divergent behavior. Hence, practically, the algorithms can de regarded as numerically stable for long wordlengths.

[1]  Leon H. Sibul,et al.  A sliding window update for the basis matrix of the QR decomposition , 1993, IEEE Trans. Signal Process..

[2]  G. W. Stewart.  On the stability of sequential updates and downdates , 1995, IEEE Trans. Signal Process..

[3]  Fuyun Ling.  Givens rotation based least squares lattice and related algorithms , 1991, IEEE Trans. Signal Process..

[4]  Dirk T. M. Slock.  Backward consistency concept and round-off error propagation dynamics in recursive least-squares algorithms , 1992 .

[5]  Richard P. Brent,et al.  A Note on Downdating the Cholesky Factorization , 1987 .

[6]  Thomas Kailath,et al.  Windowed fast transversal filters adaptive algorithms with normalization , 1985, IEEE Trans. Acoust. Speech Signal Process..

[7]  John M. Cioffi,et al.  Limited-precision effects in adaptive filtering , 1987 .

[8]  Benjamin Friedlander,et al.  Square-root covariance ladder algorithms , 1981, ICASSP.

[9]  Kui Liu,et al.  Dual-state systolic architectures for up/downdating RLS adaptive filtering , 1992 .

[10]  Phillip A. Regalia,et al.  On the duality between fast QR methods and lattice methods in least squares adaptive filtering , 1991, IEEE Trans. Signal Process..

[11]  M. Bellanger.  A survey of QR based fast least squares adaptive filters: from principles to realization , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[12]  Simon Haykin,et al.  Adaptive filter theory (2nd ed.) , 1991 .

[13]  Phillip A. Regalia,et al.  Numerical stability properties of a QR-based fast least squares algorithm , 1993, IEEE Trans. Signal Process..

[14]  Fuyun Ling,et al.  A recursive modified Gram-Schmidt algorithm for least- squares estimation , 1986, IEEE Trans. Acoust. Speech Signal Process..

[15]  Phillip A. Regalia,et al.  Past input reconstruction in fast least-squares algorithms , 1997, IEEE Trans. Signal Process..

[16]  Fuyun Ling,et al.  Sliding window order-recursive least-squares algorithms , 1994, IEEE Trans. Signal Process..

[17]  Å. Björck,et al.  Accurate Downdating of Least Squares Solutions , 1994, SIAM J. Matrix Anal. Appl..

[18]  I. Proudler,et al.  Computationally efficient QR decomposition approach to least squares adaptive filtering , 1991 .

[19]  Haesun Park,et al.  Fast residual computation for sliding window recursive least squares methods , 1995, Signal Process..

[20]  K. J. Ray Liu,et al.  A unified square-root-free approach for QRD-based recursive-least-squares estimation , 1993, IEEE Trans. Signal Process..

[21]  Peter Strobach,et al.  A computation of the sliding window recursive QR decomposition , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[22]  John M. Cioffi,et al.  The fast adaptive ROTOR's RLS algorithm , 1990, IEEE Trans. Acoust. Speech Signal Process..

[23]  S. Haykin,et al.  Adaptive Filter Theory , 1986 .