Demo of Enhanced Sliding DFT (eSDFT) Algorithm

eSDFT is an algorithm that computes the sliding DFT based on the momentary matrix transformation. The algorithm offers both speed and accuracy when using in real time, especially a long run that may suffer from the error accumulation caused by recursive formula. The eSDFT can minimize the error with an update from the direct FFT, which can be run concurrently on another core. This program uses FFTW for computing the direct FFT on multithreading architecture.