New efficient algorithm for computing a few DFT points

Henrik V. Sorensen, C. Sidney Burrus, Douglas L Jones

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherPubl by IEEE
Pages1915-1918
Number of pages4
ISBN (Print)9517212402
StatePublished - Dec 1 1988
Externally publishedYes

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
Volume2
ISSN (Print)0271-4310

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'New efficient algorithm for computing a few DFT points'. Together they form a unique fingerprint.

  • Cite this

    Sorensen, H. V., Burrus, C. S., & Jones, D. L. (1988). New efficient algorithm for computing a few DFT points. In Proceedings - IEEE International Symposium on Circuits and Systems (pp. 1915-1918). (Proceedings - IEEE International Symposium on Circuits and Systems; Vol. 2). Publ by IEEE.