DocumentCode
1764643
Title
The Hopping Discrete Fourier Transform [sp Tips&Tricks]
Author
Park, C. ; Ko, Sungyeon
Volume
31
Issue
2
fYear
2014
fDate
41699
Firstpage
135
Lastpage
139
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].
Keywords
Algorithm design and analysis; Discrete Fourier transforms; Equations; Memory management; Signal processing algorithms;
fLanguage
English
Journal_Title
Signal Processing Magazine, IEEE
Publisher
ieee
ISSN
1053-5888
Type
jour
DOI
10.1109/MSP.2013.2292891
Filename
6739232
Link To Document