The hopping discrete fourier transform

Chun Su Park; Sung Jea Ko

doi:10.1109/MSP.2013.2292891

The hopping discrete fourier transform

Chun Su Park
, Sung Jea Ko

Research output: Contribution to journal › Article › peer-review

48 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 language	English
Article number	6739232
Pages (from-to)	135-139
Number of pages	5
Journal	IEEE Signal Processing Magazine
Volume	31
Issue number	2
DOIs	https://doi.org/10.1109/MSP.2013.2292891
Publication status	Published - 2014 Mar

ASJC Scopus subject areas

Signal Processing
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1109/MSP.2013.2292891

Cite this

@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 Ko, \{Sung Jea\}",

year = "2014",

month = mar,

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/3

Y1 - 2014/3

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 - https://www.scopus.com/pages/publications/85032751298

U2 - 10.1109/MSP.2013.2292891

DO - 10.1109/MSP.2013.2292891

M3 - Article

AN - SCOPUS:85032751298

SN - 1053-5888

VL - 31

SP - 135

EP - 139

JO - IEEE Signal Processing Magazine

JF - IEEE Signal Processing Magazine

IS - 2

M1 - 6739232

ER -

The hopping discrete fourier transform

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this