Fast convergent algorithm for identification of noisy autoregressive signals

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)

Abstract

A fast convergent algorithm for unbiased identification of noisy autoregressive (AR) signals is presented. This algorithm is developed based on a bias correction procedure, but makes use of more autocovariances to estimate the variance of the corrupting noise which determines the noise-induced bias in the least-squares estimates of the AR parameters. Since better estimates of this corrupting noise variance can be attained at earlier stages of the iterative process, the proposed algorithm can achieve a faster rate of convergence. Simulation results are included that illustrate the good performances of the proposed algorithm.

Original languageEnglish
Pages (from-to)IV-497-IV-500
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume4
DOIs
Publication statusPublished - 2000
EventProceedings of the IEEE 2000 International Symposium on Circuits and Systems, ISCAS 2000 - Geneva, Switz, Switzerland
Duration: 28 May 200031 May 2000

Fingerprint

Dive into the research topics of 'Fast convergent algorithm for identification of noisy autoregressive signals'. Together they form a unique fingerprint.

Cite this