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).
Assuming that the hopsize between two consecutive DFTs is 1 sample,
From this definition, the DFT can be computed recursively thereafter.
- ^ 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