The Fourier (Blog) Series Part 1 – Introducing The DFT

The FFT is one of the backbones of signal processing, allowing us to quickly transform a signal from time-domain to frequency-domain (and vice-versa via the inverse FFT). This allows us to analyze or manipulate the signal such as filtering, noise reduction, pitch detection or correction, time-stretching or even removing elements from the signal. The FFT

Continue reading »

FFFT?

Last week I posted on twitter about an upcoming paper to be presented at SODA (Symposium on Discrete Algorithms). The new algorithm for the calculation of the Nearly Optimal Sparse Fourier Transform (Abstract). This new algorithm for certain specialized cases of the Discrete Fourier Transform, which allows processing of digital signals to create JPEG images,

Continue reading »