Sliding DFT: Difference between revisions
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
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]]. | {{Stub}} | ||
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]] but this technique are limited by having only integer K otherwise, the sDFT goes out of phase but this is not in case on some sDFT implementations that allows non-integer K. | |||
The sliding DFT can also have asymmetric windowing function by replacing ring buffers with an IIR exponential decay and it can be cascaded to further increase rolloff. | |||
[[Category:Technical]] | [[Category:Technical]] | ||
[[Category:Signal Processing]] | [[Category:Signal Processing]] | ||
Revision as of 04:55, 7 June 2022
This article is a stub. You can help the Hydrogenaudio Knowledgebase by expanding it.
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 but this technique are limited by having only integer K otherwise, the sDFT goes out of phase but this is not in case on some sDFT implementations that allows non-integer K.
The sliding DFT can also have asymmetric windowing function by replacing ring buffers with an IIR exponential decay and it can be cascaded to further increase rolloff.