The hopping discrete fourier transform

Chun Su Park, Sung Jea Ko

Research output: Contribution to journalArticlepeer-review

44 Citations (Scopus)


The discrete Fourier transform (DFT) produces a Fourier representation for finite-duration data sequences. In addition to its theoretical importance, the DFT plays a key role in the implementation of a variety of digital signal-processing algorithms. Several algorithms including the fast Fourier transform (FFT) and the Goertzel algorithm have been introduced for the fast implementation of the DFT [1], [2].

Original languageEnglish
Article number6739232
Pages (from-to)135-139
Number of pages5
JournalIEEE Signal Processing Magazine
Issue number2
Publication statusPublished - 2014 Mar

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'The hopping discrete fourier transform'. Together they form a unique fingerprint.

Cite this