Least-squares adaptive lattice and transversal filters: A unified geometric theory

A unified theory is presented to characterize least-squares adaptive filters, in either lattice or transversal-filter form, for nonstationary processes. The derivations are based upon a geometric formulation of least-squares estimation and on the concept of displacement rank. A few basic geometric relations are shown to underlie the various algorithms. Insights into the fundamental concepts that unify lattice- and transversal-filter approaches to least-squares adaptive filters are also given. The general results are illustrated by applications to the so-called "pre-windowed" and "growing-memory covariance" formulations of the deterministic least-squares problem.

[1]  Philippe Delsarte,et al.  A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distance , 1983, IEEE Trans. Inf. Theory.

[2]  B. S. Atal,et al.  Determination of the Vocal‐Tract Shape Directly from the Speech Wave , 1970 .

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

[4]  M. M. Sondhi,et al.  An adaptive echo canceller , 1967 .

[5]  M. Morf,et al.  A VLSI speech analysis chip set based on square root normalized ladder forms , 1981, ICASSP.

[6]  P. Kumar,et al.  Theory and practice of recursive identification , 1985, IEEE Transactions on Automatic Control.

[7]  M. Morf,et al.  Spectral Estimation , 2006 .

[8]  B. Friedlander.  Lattice methods for spectral estimation , 1982, Proceedings of the IEEE.

[9]  L. Ljung,et al.  Extended Levinson and Chandrasekhar equations for general discrete-time linear estimation problems , 1978 .

[10]  Karl Johan Åström,et al.  BOOK REVIEW SYSTEM IDENTIFICATION , 1994, Econometric Theory.

[11]  G. Yule.  On the Theory of Correlation for any Number of Variables, Treated by a New System of Notation , 1907 .

[12]  L. Griffiths.  A continuously-adaptive filter implemented as a lattice structure , 1977 .

[13]  M. Morf,et al.  Square root covariance ladder algorithms , 1982 .

[14]  M. Morf,et al.  Hilbert space array methods for finite rank process modeling and ladder form realizations , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

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

[16]  Thomas Kailath,et al.  Some new algorithms for recursive estimation in constant linear systems , 1973, IEEE Trans. Inf. Theory.

[17]  T. Kailath,et al.  Normalized lattice algorithms for least-squares FIR system identification , 1983 .

[18]  N. Levinson.  The Wiener (Root Mean Square) Error Criterion in Filter Design and Prediction , 1946 .

[19]  J. Makhoul,et al.  Linear prediction: A tutorial review , 1975, Proceedings of the IEEE.

[20]  T Kailath.  Time-Variant and Time-Invariant Lattice Filters for Nonstationary Processes. , 1982 .

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

[22]  George Carayannis,et al.  A fast sequential algorithm for least-squares filtering and prediction , 1983 .

[23]  T. Kailath,et al.  Ladder-form filters for nonstationary processes , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[24]  M. Morf,et al.  Displacement ranks of matrices and linear equations , 1979 .

[25]  L. Ljung,et al.  Fast calculation of gain matrices for recursive estimation schemes , 1978 .

[26]  M. Morf,et al.  Ladder forms for identification and speech processing , 1977, 1977 IEEE Conference on Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications.

[27]  Thomas Kailath,et al.  Displacement ranks of a matrix , 1979 .

[28]  J. P. Burg,et al.  Maximum entropy spectral analysis. , 1967 .

[29]  Thomas Kailath,et al.  Lattice filter parameterization and modeling of nonstationary processes , 1984, IEEE Trans. Inf. Theory.

[30]  F. K. Becker,et al.  Automatic equalization for digital communication , 1965 .

[31]  John Makhoul,et al.  Adaptive lattice methods for linear prediction , 1978, ICASSP.

[32]  James Durbin,et al.  The fitting of time series models , 1960 .

[33]  John E. Markel,et al.  Linear Prediction of Speech , 1976, Communication and Cybernetics.

[34]  M. Morf,et al.  Fast algorithms for recursive identification , 1976, 1976 IEEE Conference on Decision and Control including the 15th Symposium on Adaptive Processes.

[35]  J. Makhoul.  Stable and efficient lattice methods for linear prediction , 1977 .

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

[37]  J. L. Hock,et al.  An exact recursion for the composite nearest‐neighbor degeneracy for a 2×N lattice space , 1984 .

[38]  Jean-Marc Delosme,et al.  Highly concurrent computing structures for matrix arithmetic and signal processing , 1982, Computer.

[39]  Thomas Kailath,et al.  Schur and Levinson algorithms for nonstationary processes , 1981, ICASSP.

[40]  Lennart Ljung,et al.  Application of Fast Kalman Estimation to Adaptive Equalization , 1978, IEEE Trans. Commun..

[41]  C. Samson.  A unified treatment of fast algorithms for identification , 1982 .

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