DocumentCode :
1275112
Title :
A two step Burg algorithm [spectral analysis]
Author :
Bell, B.M. ; Percival, D.B.
Author_Institution :
Appl. Phys. Lab., Washington Univ., Seattle, WA, USA
Volume :
39
Issue :
1
fYear :
1991
fDate :
1/1/1991 12:00:00 AM
Firstpage :
185
Lastpage :
189
Abstract :
The problem of estimating the parameters of a real-valued, stationary, nondeterministic, autoregressive process of order p from a time series of finite length is discussed. Burg´s algorithm estimates these parameters indirectly by sequentially estimating one reflection coefficient at a time. The proposed approach is to sequentially estimate 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
Keywords :
computational complexity; parameter estimation; spectral analysis; time series; autoregressive process; computational complexity; finite length time series; nondeterministic process; parameter estimation; power spectral density; real-valued process; reflection coefficient; spectral analysis; stationary process; two step Burg algorithm; Autocorrelation; Autoregressive processes; Parameter estimation; Reflection; Signal analysis; Signal processing; Signal processing algorithms; Spectral analysis; Speech processing; Time frequency analysis;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/78.80803
Filename :
80803
Link To Document :
بازگشت