Source: wikibot/split-radix-fft-algorithm
= Split-radix FFT algorithm
{wiki=Split-radix_FFT_algorithm}
The Split-Radix FFT (Fast Fourier Transform) algorithm is a mathematical technique used to compute the discrete Fourier transform (DFT) and its inverse efficiently. It is an optimization of the FFT algorithm that reduces the number of arithmetic operations required, making it faster than the traditional Cooley-Tukey FFT algorithm in certain scenarios.