A fast spectral estimation algorithm based on the FFT

View Researcher's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Please contact us in case of a broken link from here

Authors P. Gough
Journal/Conference Name IEEE Transactions on Signal Processing
Paper Category
Paper Abstract A simple FFT-based algorithm for spectrum estimation is presented. The major difference between this and spectrum estimation using a single pass through the FFT is that the proposed algorithm is iterative and the FFT is used many times in a systematic may to search for individual spectral lines. Using simulated data, the proposed algorithm is able to detect mulitple sinusoids in additive noise. The algorithm is certainly better than the single pass FFT in separating closely spaced sinusoids. Finally the algorithm is applied to some experimental measurements to illustrate its properties. >
Date of publication 1994
Code Programming Language Jupyter Notebook

Copyright Researcher 2022