Sliding DFT
Jump to navigation
Jump to search
![]() | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
|
In applied mathematics, the sliding discrete Fourier transform is a recursive algorithm to compute successive STFTs of input data frames that are a single sample apart (hopsize − 1).[1]
Definition
Assuming that the hopsize between two consecutive DFTs is 1 sample, then
From this definition, the DFT can be computed recursively thereafter.
References
- ^ Bradford, Russell (2005). "SLIDING IS SMOOTHER THAN JUMPING" (PDF). Proceedings ICMC 2005.
Jacobsen, E., Lyons, R.: ‘The sliding DFT’, IEEE Signal Process. Mag., 2013, 20, (2), pp. 74–80
Jacobsen, E., Lyons, R.: ‘An update to the sliding DFT’, IEEE Signal Process. Mag., 2014, 21, (1), pp. 110–111
Categories:
- Articles needing additional references from February 2020
- All articles needing additional references
- Justapedia articles needing context from February 2020
- Articles with invalid date parameter in template
- All Justapedia articles needing context
- All pages needing cleanup
- Articles with multiple maintenance issues
- FFT algorithms
- All stub articles
- Signal processing stubs