Difference between revisions of "Sliding DFT"

Revision as of 04:28, 18 May 2023

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.

Implementation in foobar2000

The sliding DFT, unlike FFT requires contiguous stream of data, which means implementing that requires tricks involved with delta variable (time difference between current and previous calculations). However, the offset part of audio capture part of visualization (especially with get_chunk_absolute(data, offset, size)) is kinda complicated; the time of the resulting captured signal is requested_length/2 samples ahead of actual playback (as long as the requested length is lower than buffer size in samples), which means the offset should be adjusted to something like time - delta/2.

External links

• Sliding DFT on Wikipedia
• A video explaining how sliding DFT works and how to properly capture audio samples for sliding DFT calculation in a foobar2000 visualization component