Sliding DFT: Difference between revisions
(Added page) |
No edit summary |
||
| Line 1: | Line 1: | ||
A '''sliding [[DFT]]''' is a recursive FIR filter bank that calculates | A '''sliding [[DFT]]''' is a recursive complex FIR filter bank that calculates short-time Fourier transform sample-by-sample. Unlike [[FFT]], the sDFT calculation for each bin is independent of each other, making it ideal for single-bin STFT and even [[constant-Q transform]]. | ||
[[Category:Technical]] | [[Category:Technical]] | ||
[[Category:Signal Processing]] | [[Category:Signal Processing]] | ||
Revision as of 11:55, 4 April 2022
A sliding DFT is a recursive complex FIR filter bank that calculates short-time Fourier transform sample-by-sample. Unlike FFT, the sDFT calculation for each bin is independent of each other, making it ideal for single-bin STFT and even constant-Q transform.