论文信息 - The Hopping Discrete Fourier Transform [sp Tips&Tricks]

The Hopping Discrete Fourier Transform [sp Tips&Tricks]

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

Sung-Jea Ko | Chun-Su Park

[1] Y. Lim,et al. A comment on the computational complexity of sliding FFT , 1992 .

[2] Alan V. Oppenheim,et al. Discrete-time signal processing (2nd ed.) , 1999 .

[3] E. Jacobsen,et al. The sliding DFT , 2003, IEEE Signal Process. Mag..

[4] R. Lyons,et al. An update to the sliding DFT , 2004, IEEE Signal Process. Mag..

[5] Lu Wang,et al. Fast Algorithms for the Computation of Sliding Sequency-Ordered Complex Hadamard Transform , 2010, IEEE Transactions on Signal Processing.

[6] Krzysztof Duda,et al. Accurate, Guaranteed Stable, Sliding Discrete Fourier Transform [DSP Tips & Tricks] , 2010, IEEE Signal Processing Magazine.

[7] B. Farhang-Boroujeny,et al. Generalized sliding FFT and its application to implementation of block LMS adaptive filters , 1994, IEEE Trans. Signal Process..