DocumentCode
1449954
Title
A Levinson-type algorithm for modeling fast-sampled data
Author
Vijayan, Rajiv ; Poor, H. Vincent ; Moore, John B. ; Goodwin, Graham C.
Author_Institution
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
Volume
36
Issue
3
fYear
1991
fDate
3/1/1991 12:00:00 AM
Firstpage
314
Lastpage
321
Abstract
The standard discrete-time autoregressive model is poorly suited for modeling series obtained by sampling continuous-time processes at fairly rapid rates. Large computational errors can occur when the Levinson algorithm is used to estimate the parameters of this model, because the Toeplitz covariance matrix is ill-suited for inversion. An alternative model is developed based on an incremental difference operator, rather than the shift operator. It is shown that, as the sampling period goes to zero, unlike the standard autoregressive parameters, the coefficients of this model converge to certain parameters that depend directly on the statistics of the continuous-time process. A Levinson-type algorithm for efficiently estimating the parameters of this model is derived. Numerical examples are given to show that when the sampling interval is small this algorithm is considerably less sensitivity to arithmetic roundoff errors than the Levinson algorithm
Keywords
matrix algebra; parameter estimation; statistics; Levinson-type algorithm; Toeplitz covariance matrix; arithmetic roundoff errors; autoregressive parameters; fast-sampled data; incremental difference operator; parameter estimation; sampling period; Covariance matrix; Digital filters; Filtering; Parameter estimation; Riccati equations; Roundoff errors; Sampling methods; State feedback; Statistics; Systems engineering and theory;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/9.73564
Filename
73564
Link To Document