The hopping discrete fourier transform

Chun Su Park, Sung-Jea Ko

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

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
Volume31
Issue number2
DOIs
Publication statusPublished - 2014

Fingerprint

Discrete Fourier transform
Discrete Fourier transforms
Fast Fourier transform
Digital signal processing
Fast Fourier transforms
Signal Processing

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

The hopping discrete fourier transform. / Park, Chun Su; Ko, Sung-Jea.

In: IEEE Signal Processing Magazine, Vol. 31, No. 2, 6739232, 2014, p. 135-139.

Research output: Contribution to journalArticle

Park, Chun Su ; Ko, Sung-Jea. / The hopping discrete fourier transform. In: IEEE Signal Processing Magazine. 2014 ; Vol. 31, No. 2. pp. 135-139.
@article{177fe2d75b494b42bc02cb59c0f8a8d9,
title = "The hopping discrete fourier transform",
abstract = "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].",
author = "Park, {Chun Su} and Sung-Jea Ko",
year = "2014",
doi = "10.1109/MSP.2013.2292891",
language = "English",
volume = "31",
pages = "135--139",
journal = "IEEE Signal Processing Magazine",
issn = "1053-5888",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - The hopping discrete fourier transform

AU - Park, Chun Su

AU - Ko, Sung-Jea

PY - 2014

Y1 - 2014

N2 - 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].

AB - 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].

UR - http://www.scopus.com/inward/record.url?scp=85032751298&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85032751298&partnerID=8YFLogxK

U2 - 10.1109/MSP.2013.2292891

DO - 10.1109/MSP.2013.2292891

M3 - Article

AN - SCOPUS:85032751298

VL - 31

SP - 135

EP - 139

JO - IEEE Signal Processing Magazine

JF - IEEE Signal Processing Magazine

SN - 1053-5888

IS - 2

M1 - 6739232

ER -