Category:Fast Fourier transforms

Wikimedia Commons has media related to FFT.

This category is for fast Fourier transform (FFT) algorithms, i.e. algorithms to compute the discrete Fourier transform (DFT) in O(N log N) time (or better, for approximate algorithms), where ${\displaystyle N}$ is the number of discrete points.