A lattice algorithm dual to the extended inverse QR algorithm

Abstract This paper presents a new lattice algorithm dual to the extended Inverse QR (IQR) algorithm recently derived by the authors. The original IQR and our extended IQR algorithms are transversal filter algorithms. We found that by assuming a spatial displacement property on the initial correlation matrix of reference data consistent with a time-shifting property of reference data stored in taps of a transversal filter, we could develop a fast version of the extended IQR algorithm. This fast IQR algorithm turns out to have a lattice filter structure instead of a transversal filter structure. Whereas the extended IQR algorithm requires O(M2p) computations per iteration, its fast version called a new hybrid QR/LLS algorithm requires O(Mp2p) computations per iteration, where M, the number of taps, is usually much greater than p, the number of channels. This new hybrid QR/LLS algorithm differs from Regalia and Bellanger's hybrid QR/LLS algorithm, because the former is dual to the IQR algorithm and is based on the use of variance-normalized a priori backwards prediction errors, while the latter is dual to the QR algorithm and is based on the use of variance-normalized a posteriori backwards prediction errors.

[1]  F. Ling.  Efficient least-squares lattice algorithms based on Givens rotation with systolic array implementations , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

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

[3]  H. Kotera,et al.  Application of Fast Kalman Estimation to Adaptive Equalization , 1978 .

[4]  S. Thomas Alexander,et al.  A Method for Recursive Least Squares Filtering Based Upon an Inverse QR Decomposition , 1993, IEEE Trans. Signal Process..

[5]  Thomas Kailath,et al.  An extended inverse QR adaptive filtering algorithm , 1994, Signal Process..

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

[7]  Bin Yang,et al.  Rotation-based RLS algorithms: unified derivations, numerical properties, and parallel implementations , 1992, IEEE Trans. Signal Process..

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

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

[10]  T. Kailath,et al.  Fast, recursive-least-squares transversal filters for adaptive filtering , 1984 .

[11]  M. Morf,et al.  Recursive least squares ladder estimation algorithms , 1981 .

[12]  Benjamin Friedlander,et al.  Least squares algorithms for adaptive linear-phase filtering , 1982 .

[13]  Ali H. Sayed,et al.  Extended Chandrasekhar recursions , 1994, IEEE Trans. Autom. Control..

[14]  Phillip A. Regalia.  Numerical stability issues in fast least-squares adaptive algorithms , 1991, Optics & Photonics.

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

[16]  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..

[17]  B. Friedlander,et al.  Lattice filters for adaptive processing , 1982, Proceedings of the IEEE.