Computationally efficient suboptimum ARMA spectral estimation
M. Kaveh, S.P. Bruzzone
Abstract
M. Kaveh, S.P. Bruzzone
Abstract
There is a great deal of interest in data-adaptive spectral estimation. The general appeal of these methods stems from the fact that their resolution is not determined by a spectral window bandwidth (which depends on the data length) as in the traditional Blackman and Tukey estimators. The method most commonly used, is the autoregressive (AR) or the maximum entropy spectral estimator.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
There is a great deal of interest in data-adaptive spectral estimation. The general appeal of these methods stems from the fact that their resolution is not determined by a spectral window bandwidth (which depends on the data length) as in the traditional Blackman and Tukey estimators. The method most commonly used, is the autoregressive (AR) or the maximum entropy spectral estimator.
Key concepts: Maximum entropy spectral estimation, Spectral density estimation, Estimator, Autoregressive model, Spectral analysis, Computer science, Algorithm, Principle of maximum entropy