A Levinson-Type Algorithm for Modeling Fast-Sampled Data

IEEE Transactions on Automatic Control

Volumn 36, Issue 3, 1991, Pages 314-321

  Vijayan, Rajiv ^a   Poor, H Vincent ^b   Moore, John B ^c   Goodwin, Graham C ^d  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b PRINCETON UNIVERSITY   (United States)

^c AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^d NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL TECHNIQUES - ESTIMATION; STATISTICAL METHODS - TIME SERIES ANALYSIS;

PARAMETER ESTIMATION; ROUNDOFF ERRORS;

CONTROL SYSTEMS, SAMPLED DATA;

EID: 0026123181     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/9.73564     Document Type: Article

References (15)

1. R. C. Agarwall and C. S. Burrus, “New recursive digital filter structures having very low sensitivity and roundoff noise,” IEEE Trans. Circuits Syst., vol. CAS-22, pp. 921-927, Dec. 1975.
2. G. Cybenko, “The numerical stability of the Levinson-Durbin algorithm for Toeplitz systems of equations,” SIAM J. Sci. Statist. Comput., vol. 1, no. 3, pp. 303-319, Sept. 1980.
3. P. Dewilde, A. C. Vieira, and T.Kailath, “On a generalized Szego-Levinson realization algorithm for optimal linear predictors based on a network synthesis approach,” IEEE Trans. Circuits Syst., vol. CAS-25, no. 9, pp. 663-675, Sept. 1978.
4. T. Kailath, B. C. Levy, L. Ljung, and M. Morf, “Fast time-in-variant implementations of Gaussian signal detectors,” IEEE Trans. Informat. Theory, vol. IT-24, no. 4, pp. 469-477, July 1978.
5. T. Kailath, A. Vieira, and M. Morf, “Inverses of Toeplitz operators, innovations, and orthogonal polynomials,” SIAM J. Review, vol. 20, no. 1, pp. 106-119, Jan. 1978.
6. J. le Roux and C. Gueguen, “A fixed point computation of partial correlation coefficients,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, no. 3, pp. 257-259, June 1977.
7. D. G. Messerschmitt, “A class of generalized lattice filters,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP- 198-204, 1980.
8. R. H. Middleton and G. C. Goodwin, “Improved finite word length characteristics in digital control using delta operators,” IEEE Trans. Automat. Contr., vol. AC-31, pp. 1015-1021, Nov. 1986.
9. G. Orlandi and G. Martinelli, “Low-sensitivity recursive digital filters obtained via the delay replacement,” IEEE Trans. Circuits Syst., vol. CAS-31, pp. 654-656, July 1984.
10. D. T. Pham and A. le Breton, “Levinson-Durbin type algorithms for continuous time autoregressive models and applications,” Math. Contr. Signals, Syst., vol. 4, no. 1, pp. 69-79, 1991.
11. H. V. Poor, An Introduction to Signal Detection and Estimation. New York: Springer-Verlag, 1988.
12. M. Salgado, R. H. Middleton, and G. C. Goodwin, “Connection between continuous and discrete Riccati equations with applications to Kalman filtering,” IEE Proc., pt. D, vol. 135, no. 1, pp. 28-34, Jan. 1988.
13. G. Szego, “Orthogonal polynomials,” in Colloquium Publications, Vol. 23, 4th ed. Providence, RI: Amer. Math. Society, 1975.
14. D. Williamson, “Delay replacement in direct form structures,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-36, pp. 453-460, Apr. 1988.
15. A. E. Yagle and B. C. Levy, “The Schur algorithm and its applications,” Acta Applicandae Mathematicae, vol. 3, no. 3, pp. 255-284, May 1985.