A two step Burg algorithm [spectral analysis]


We consider the problem of estimating the parameters of a real-valued, stationary, nondeterministic, autoregressive process of order p from a time series of finite length. Burg’s algorithm estimates these parameters indirectly by sequentially estimating one reflection coefficient at a time. Our approach is to sequentially eTtimate the reflection coefficients in pairs. The new algorithm has the same order of computational complexity as Burg’s. It is guaranteed to generate parameter estimates that correspond to a stationary process (as does Burg’s), and it produces estimates of the power spectral density that do not appear to suffer from spectral line splitting-in contrast to Burg’s algorithm.

DOI: 10.1109/78.80803

Cite this paper

@article{Bell1991ATS, title={A two step Burg algorithm [spectral analysis]}, author={Bradley M. Bell and Donald B. Percival}, journal={IEEE Trans. Signal Processing}, year={1991}, volume={39}, pages={185-189} }