Lattice Filter Parametrization and Modeling of Nonstationary Processes

IEEE Transactions on Information Theory

Volumn 30, Issue 1, 1984, Pages 2-16

  Lev Ari, Hanoch ^a   Kailath, T ^b  

^a Integrated Systems Inc   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SIGNAL FILTERING AND PREDICTION;

EID: 0021230482     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1984.1056849     Document Type: Article

References (33)

1. J. D. Markel and A. H. Gray, Jr., Linear Prediction of Speech. New York; Springer-Verlag, 1978.
2. E. A. Robinson, Multichannel Time Series Analysis with Digital Computers, 2nd ed. San Francisco: Holden-Day, 1978.
3. M. Morf, A. Vieira, and T. Kailath, “Covariance characterization by partial autocorrelation matrices,” Ann. Statist., vol. 6, no. 3, pp. 643-648, 1978. (See also IEEE Trans. Geosci. Electron., vol. GE-16, pp. 85–94, April 1978.)
4. R. H. Wiggins and L. Brantingham, “Three-chip system synthesizes human speech,” Electron., pp. 109ff, Aug. 31, 1978.
5. J. Makhoul, “Stable and efficient lattice methods for linear predict- ' ion,” IEEE Trans. Acoust., Speech, Signal Proc., vol. ASSP-25, pp. 423–428, Oct. 1977.
6. H. Lev-Ari and T. Kailath, “Schur and Levinson algorithms for nonstationary processes,” in Proc. Int. Conf. Acoustics, Speech, Signal Proc., Atlanta GA, pp. 860–864, Mar. 1981.
7. T. Kailath, “Time-variant and time-invariant lattice filters for nonstationary processes,” presented at the Workshop on Fast Algorithms for Linear Dynamical Systems, Aussois, France, Sept. 1981 and published in the series on Mathematical Tools and Models for Control Systems Analysis and Signal Processing, Vol. 2. Paris: Editions CNRS, 1982, pp. 417–464.
8. T. Kailath, S.-Y. Kung, and M. Morf, “Displacement ranks of matrices and linear equations,” J. Math. Anal. Appl., vol. 68, pp. 395-407, 1979. (See also Bull. Amer. Math. Soc., vol. 1, pp. 769–773, Sept. 1979.)
9. D. T. L. Lee, M. Morf, and B. Friedlander, “Recursive least squares ladder estimation algorithms,” IEEE Trans. Circuits Syst., vol. CAS-28, pp. 467–481, 1981.
10. B. Friedlander, T. Kailath, M. Morf, and L. Ljung, “Extended Levinson and Chandrasekhar equations for general discrete-time linear estimation problems,” IEEE Trans. Automatic Contr., vol. AC-23, no. 4, pp. 653–659, Aug. 1978.
11. J. M. Delosme, “Algorithms for finite shift-rank processes,” Ph.D. dissertation, Dept. of Electrical Eng., Stanford University, Stanford, CA, Sept. 1982.
12. I. Schur, “Uber Potenzreihen, die in Innem des Einheitskreises Beschrankt Sind,” J. fur die Reine und Angewandte Mathematik, vol. 147, pp. 205–232, Berlin,-1917.
13. P. Dewilde, A. Vieira, and T. Kailath, “On a generalized Szego-Levinson realization algorithm for optimal linear predictors based on a network synthesis approach,” IEEE Trans. Circuits Systs., vol. CAS-25, pp. 663–675, Sept. 1978.
14. P. Dewilde and H. Dym, “Schur recursions, error formulas, and convergence of rational estimators for stationary stochastic processes,” IEEE Trans. Inform. Theory, vol. IT-27, no. 4, pp. 446–461, July 1981.
15. G. Szego, Orthogonal Polynomials, Vol. 23. Providence, RI: American Mathematical Society Colloquium Publishing, 1939.
16. Y. Geronimus, Orthogonal Polynomials. New York: Consultant’s Bureau, 1961.
17. T. Kailath, A. Vieira, and M. Morf, “Inverses of Toeplitz operators, innovations, and orthogonal polynomials,” SIAM Rev., vol. 20, no. 1, pp. 106–119, 1978.
18. M. S. Livsic and A. A. Yantsevich, Operator Colligations in Hilbert Spaces. New York: Wiley and Sons 1979.
19. M. Brodskii, “Unitary operator colligations and their characteristic functions,” Russian Math. Surveys, vol. 33, pp. 159–191, 1978.
20. Y. Genin, P. Van Dooren, T. Kailath, J. Delosme, and M. Morf, “On 2-lossless transfer functions and related questions,” J. Linear Algebra and Its Appl., vol. 50, pp. 251–275, Apr. 1983.
21. H. Lev-Ari, “Nonstationary lattice-filtering modeling,” Ph.D. dissertation, Stanford University, Stanford, CA, 1983.
22. H. Lev-Ari, T. Kailath, and T. Cioffi “Least-squares adaptive lattice and transversal filters: A unified geometric theory,” submitted to IEEE Trans. Inform. Theory.
23. P. Delsarte, Y. Genin, and Y. Kamp, “A polynomial approach to the generalized Levinson algorithm,” IEEE Trans. Inform. Theory, vol. IT-30, no. 2, pp. 268–278, Mar. 1983.
24. G. Strang, Linear Algebra and Its Applications. New York, NY: Academic Press, 1980.
25. E. H. Bareiss, “Numerical solution of linear equations with Toeplitz and vector toeplitz matrices,” Numer. Math., vol. 13, pp. 404–424, Oct. 1969.
26. M. Morf, “Fast algorithms for multivariable systems,” Ph.D. dissertation, Dept. of Electrical Eng., Stanford University, Stanford, CA, 1974.
27. J. Rissanen, “Algorithms for triangular decomposition of block Hankel and Toeplitz matrices with application to factoring positive matrix polynomials,” Math. Comput., vol. 27, pp. 147–154, Jan. 1973.
28. B. R. Musicus, “Levinson and fast Cholesky algorithms for Toeplitz and almost toeplitz matrices,” Internal Rep. MIT, Nov. 1981.
29. M. Morf, “Doubling algorithms for Toeplitz and related equations,” in Proc. 1980 Inti Conf. Acoustics, Speech, Signal Proc., pp. 954–959, Apr. 1980.
30. R. R. Bitmead and B. D. O. Anderson, “Asymptotically fast solution of Toeplitz and related systems of linear equations,” J. Linear Algebra Its Appl., vol. 34, pp. 103–116, Dec. 1980.
31. D. R. Morgan, “Orthogonal triangularization methods for fast estimation algorithms,” Ph.D. dissertation, Dept. of Elec. Eng., Stanford University, Stanford, CA, 1983.
32. N. I. Akhiezer, The Classical Moment Problem. New York: Hafner Publishing, 1965 (Russian original, 1961).
33. N. Aronszajn, “Theory of reproducing kernels,” Trans. Amer. Math. Soc., vol. 68, pp. 337–404, 1950.