Sliding DFT
A sliding DFT is a recursive FIR filter bank that calculates discrete Fourier transform of any sort. Unlike FFT, the sDFT calculation for each bin is independent, making it ideal for single-bin DTFT and even constant-Q transform.
A sliding DFT is a recursive FIR filter bank that calculates discrete Fourier transform of any sort. Unlike FFT, the sDFT calculation for each bin is independent, making it ideal for single-bin DTFT and even constant-Q transform.