DocumentCode
2396090
Title
A new efficient algorithm for computing a few DFT points
Author
Sorensen, Henrik V. ; Burrus, C.S. ; Jones, Douglas L.
Author_Institution
Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA
fYear
1988
fDate
7-9 June 1988
Firstpage
1915
Abstract
The authors describe an efficient method for computing the discrete Fourier transform (DFT) when only a few output points are needed. The method is shown to be more efficient than either Goertzel´s method or pruning, and it allows any band in the output to be computed. It is based on a novel factorization of the DFT, where one part is computed using standard power-of-two FFTs (fast Fourier transforms) and the other uses a technique similar to the Goertzel algorithm.<>
Keywords
Fourier transforms; Goertzel algorithm; discrete Fourier transform; factorization; fast Fourier transforms; Digital signal processing; Discrete Fourier transforms; Equations; Fast Fourier transforms; Flexible printed circuits; Fourier transforms; Instruments; Narrowband; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1988., IEEE International Symposium on
Conference_Location
Espoo, Finland
Type
conf
DOI
10.1109/ISCAS.1988.15312
Filename
15312
Link To Document