Source: wikibot/fft-algorithms
= FFT algorithms
{wiki=Category:FFT_algorithms}
FFT stands for Fast Fourier Transform, which is an efficient algorithm used to compute the Discrete Fourier Transform (DFT) and its inverse. The Fourier Transform is a mathematical technique that transforms a function of time (or space) into a function of frequency. The DFT converts a sequence of complex numbers into another sequence of complex numbers, providing insight into the frequency components of the original sequence.