Back to Search
Start Over
The Hopping Discrete Fourier Transform [sp Tips&Tricks].
- Source :
- IEEE Signal Processing Magazine; Mar2014, Vol. 31 Issue 2, p135-139, 5p
- Publication Year :
- 2014
-
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]. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 10535888
- Volume :
- 31
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- IEEE Signal Processing Magazine
- Publication Type :
- Academic Journal
- Accession number :
- 94502704
- Full Text :
- https://doi.org/10.1109/MSP.2013.2292891