Fast identification of autoregressive signals from noisy observations

Abstract

The purpose of this brief is to derive, from the previously developed least-squares (LS) based method, a faster convergent approach to identification of noisy autoregressive (AR) stochastic signals. The feature of the new algorithm is that in its bias correction procedure, it makes use of more autocovariance samples to estimate the variance of the additive corrupting noise which determines the noise-induced bias in the LS estimates of the AR parameters. Since more accurate 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.