By Topic

A Levinson-type algorithm for modeling fast-sampled data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
R. Vijayan ; Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA ; H. V. Poor ; J. B. Moore ; G. C. Goodwin

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

Published in:

IEEE Transactions on Automatic Control  (Volume:36 ,  Issue: 3 )