Some New Algorithms for Recursive Estimation in Constant, Linear, Discrete-Time Systems

IEEE Transactions on Automatic Control

Volumn 19, Issue 4, 1974, Pages 315-323

  Morf, Martin ^a   Sidhu, Gursharan S ^a   Kailath, Thomas ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL SYSTEMS, DISCRETE TIME;

RECURSIVE ESTIMATION; RICCATI EQUATION;

CONTROL SYSTEMS;

EID: 0016093313     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/TAC.1974.1100576     Document Type: Article

References (44)

1. T. Kailath, “Some new algorithms for recursive estimation in constant linear systems,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 750–760, Nov, 1973.
2. S. Levinson, “The Wiener RMS (root mean square) error criterion in filter design and prediction,” J. Math. Phys., vol. XXV, pp. 261–278, Jan. 1947.
3. also N. Wiener, The Extrapolation, Interpolation and Smoothing of Stationary Time Series with Engineering Applications. New York: Wiley, 1949, Appendix.
4. R. A. Wiggins and E. A. Robinson, “Recursive solution to the multichannel filtering problem,” J. Geophys. Res., vol. 70, pp. 1885–1891, Apr. 1965.
5. E. A. Robinson, Multichannel Time Series Analysis with Digital Computer Programs. San Francisco, Calif.: Holden Day, 1967.
6. J. Durbin, “The fitting of time-series models,” Rev. Inst. Int. Statist., vol. 28, 233–244, 1960.
7. P. Whittle, “On the fitting of multivariate autoregressions, and the approximate canonical factorization of a spectral density matrix,” Biometrika, vol. 50, 129–134, 1963.
8. P. Whittle, Prediction and Regulation by Linear Least-Squares Methods. Princeton, N.J.: Van Nostrand, 1963.
9. J. Burg, “Maximum entropy spectral analysis,” presented at the 37th Annu. Meeting of Soc. Explor. Geophys., Oklahoma City, Okla., 1967.
10. J. A. Edward and M. M. Fitelson, “Notes on maximum-entropy processing,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-19, 232–234, Mar. 1973.
11. F. Itakura, “Extraction of feature parameters of speech by statistical methods,” in Proc. 8th Symp. Speech Information Processing, RIEC Tohoku University, Sendai, Japan, Feb. 1971, pp. II-5-1 to II-5-12.
12. F. Itakura and S. Saito, “Analysis synthesis telephony based on the maximum likelihood method,” in Rep. 6th Int. Congress Acoustics, Y. Kohashi, Ed. Tokyo, 1968, pp. C-5-5.
13. H. Wakita, “Estimation of the vocal tract shape by optimal inverse filtering and acoustic/articulatory conversion methods,” Speech Communications Res. Lab., Inc., Santa Barbara, Calif., Monograph 9, July 1972.
14. J. Rissanen, ‘Algorithms for triangular decomposition of block Hankel and Toeplitz matrices with applications to factoring positive matrix polynomials,” Math. Comput., vol. 27, Jan. 1973.
15. M. Morf, “Fast algorithms for multivariable systems,” Ph.D. dissertation, Dept. Elec. Eng., Stanford University, Stanford, Calif., 1974.
16. R. E. Kalman, “A new approach to linear filtering and prediction problems,” Trans. ASME, (J. Basic Eng.), vol. 82D, pp. 34–45, Mar. 1960.
17. R. E. Kalman, “New methods in Wiener filtering theory,” in Proc. 1st Symp. Eng. Appl. of Random Functions Theory and Problems, J. L. Bogdanoff and F. Kozin, Eds. New York: Wiley, 1963.
18. G. S. Sidhu, T. Kailath, and M. Morf, “Development of fast algorithms via innovations decomposition,” in Proc. of 7th Hawaii Intl. Conf. Systems Sciences, Honolulu, Hawaii, Jan. 1974, pp. 192–195.
19. G. S. Sidhu and T. Kailath “Development of new estimation algorithms by innovations analysis and shift-invariance properties,” IEEE Trans. Inform. Theory, to be published.
20. G. S. Sidhu, Ph.D. dissertation, Dept. Elec. Eng., Stanford University, Stanford, Calif., 1974.
21. A. E. Bryson and Y. C. Ho, Applied Optimal Control. Boston, Mass.: Ginn, 1969.
22. M. E. Womble and J. E. Potter, “A prefiltering version of the Kalman filter with new numerical integration formulas for Riccati equations,” in Proc. 1973 IEEE Conf. Decision and Control, San Diego, 63–67, Dec. 1973.
23. P. G. Kaminski, “Square root filtering and smoothing for discrete processes,” Ph.D. dissertation, Dept. Aero and Astro., Stanford University, Stanford, Calif., Sept. 1971.
24. D. G. Lainiotis, “Optimal linear smoothing: Continuous data case,” Int. J. Contr. vol. 17, May, 1973.
25. —, “Optimal nonlinear estimation,” Int. J. Contr. vol. 14, Dec, 1971.
26. D. G. Lainiotis, S. K. Park, and R. Krishnaiah, “Optimal state-vector estimation for non-Gaussian initial state-vector,” IEEE Trans. Automat. Contr. (Corresp.), vol. AC-16, pp. 197–198, Apr. 1971.
27. P. G. Kaminski, A. E. Bryson, Jr., and S. F. Schmidt, “Discrete square root filtering: A survey of current techniques,” IEEE Trans. Automat. Contr., vol. AC-16, pp. 727–736, Dec. 1971.
28. T. Kailath, M. Morf, and G. S. Sidhu, “Some new algorithms for recursive estimation in constant, linear, discrete-time systems,” in Proc. 7th Annu. Princeton Conf. Information Sciences and Systems, Princeton, N.J., Mar. 1973, pp. 344–352.
29. R. E. Kalman, P. L. Falb, and M. A. Arbib, Topics in Mathematical System Theory. N.Y.: McGraw-Hill, 1969.
30. B. Dickinson, M. Morf, and T. Kailath, “A minimal realization algorithm for matrix sequences,” in Proc. 1973 IEEE Conf. Decision and Control, San Diego, Calif., Dec. 1973, pp. 303–307.
31. T. Kailath and R. A. Geesey, “An innovations approach to least squares estimation—Part IV: Recursive estimation given lumped covariance functions,” IEEE Trans. Automat. Contr., vol. AC-16, pp. 720–727, Dec. 1971.
32. M. Gevers and T. Kailath, “An innovations approach to least-squares estimation—Part VI: Discrete-time innovations representations and recursive estimation,” IEEE Trans: Automat. Contr., vol. AC-18, pp. 588–600, Dec. 1973.
33. M. Gevers, “Structural properties of realizations of discrete time Markovian processes,’ Ph.D. dissertation, Dept. Elec. Eng., Stanford University, Stanford, Calif., May 1972.
34. T. Kailath, “A view of three decades of linear filtering theory,” IEEE Trans. Inform. Theory (Invited Paper), pp. 146–181, Mar. 1974.
35. S. Sandor, “Sur l'equation differentielle matricielle de type Riccati,” Bull. Math. Soc. Sci. Math. Phys. R. P. Roumaine (N.S.), vol. 3, pp. 229–249, 1959.
36. H. J. Payne and L. M. Silverman, “Matrix Riccati equations and systems structure,” in Proc. 1973 IEEE Conf. Decision and Control, San Diego, Calif., Dec. 1973, pp. 558–563.
37. M. Morf and T. Kailath, “Square-root algorithms for least-squares estimation and control,” in Proc. 8th Princeton Symp. and System Sci., Princeton, N.J., Mar. 1974.
38. H. B. Aasnaes and T. Kailath, “An innovations approach to least-squares estimation—Part VII: Some applications of vector autoregressive-moving average models,” IEEE Trans. Automat. Contr., vol. AC-18, pp. 601–607, Dec. 1973.
39. J. Rissanen and L. Barbosa, ‘Properties of infinite covariance matrices and stability of optimum predictors,” Inform. Sci., vol. 1, pp. 221–236, 1969.
40. J. Rissanen, “A fast algorithm for optimum linear predictors,” IEEE Trans. Automat. Contr. (Tech. Notes and Corresp.), vol. AC-18, p. 555, Oct. 1973.
41. J. P. Burg and J. F. Claerbout, personal communication.
42. A. Lindquist, “A new algorithm for optimal filtering of discrete-time stationary processes.” to be published.
43. M. Morf, G. S. Sidhu, and T. Kailath “Canonical multivariable able ARMA and state models in estimation and control,” to be published.
44. R. S. Bucy, D. Rappaport, and L. M. Silverman “Correlated noise filtering and invariant directions of the Riccati equation,” IEEE Trans. Automat. Contr., vol. AC-15, pp. 535–540, Oct. 1970.