Sliding DFT
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.Definition
Starting with a DFT at time n,
The DFT for time n + 1 can be computed as
and recursively thereafter as
with
