The Discrete Fourier Transform: From Math to FFT
Working through the DFT from its definition to the Fast Fourier Transform — why the naïve O(n²) algorithm collapses to O(n log n), and what that means in practice.
Jorge Lamarca's Study Journal
Working through the DFT from its definition to the Fast Fourier Transform — why the naïve O(n²) algorithm collapses to O(n log n), and what that means in practice.