A Levinson-Type Algorithm for Modeling Fast-Sampled Data

Rajiv Vijayan, H. Vincent Poor, John B. Moore, Graham C. Goodwin

Research output: Contribution to journalArticle

50 Scopus citations

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, due to the ill-conditioning of the Toeplitz covariance matrix to be inverted. 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 AR 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 sensitive to arithmetic roundoff errors than the Levinson algorithm.

Original languageEnglish (US)
Pages (from-to)314-321
Number of pages8
JournalIEEE Transactions on Automatic Control
Volume36
Issue number3
DOIs
StatePublished - Jan 1 1991

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A Levinson-Type Algorithm for Modeling Fast-Sampled Data'. Together they form a unique fingerprint.

  • Cite this