This article has multiple issues. Please help or discuss these issues on the . (Learn how and when to remove these template messages)
This article needs additional citations for verification. Please help by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: – ···scholar·JSTOR(February 2020) (Learn how and when to remove this template message)
This article provides insufficient context for those unfamiliar with the subject. Please help by providing more context for the reader.(February 2020) (Learn how and when to remove this template message)
(Learn how and when to remove this template message)
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.
![{\displaystyle {\begin{aligned}F_{t+1}(n)&=\sum _{k=0}^{N-1}f_{k+t+1}e^{-j2\pi kn/N}\\&=\sum _{m=1}^{N}f_{k+t}e^{-j2\pi (k-1)n/N}\\&=e^{j2\pi n/N}\left[\sum _{k=0}^{N-1}f_{k+t}e^{-j2\pi km/N}-f_{t}+f_{t+N}\right]\\&=e^{j2\pi n/N}\left[F_{t}(n)-f_{t}+f_{t+N}\right].\end{aligned}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/13b0f645eb5bea742f08fc2c2b7528dad0c0591a)
