Source: wikibot/twiddle-factor
= Twiddle factor
{wiki=Twiddle_factor}
The term "twiddle factor" typically appears in the context of the Fast Fourier Transform (FFT) algorithm, which is used for efficiently computing the discrete Fourier transform (DFT) and its inverse. In FFT implementations, especially the Cooley-Tukey algorithm, twiddle factors are complex exponential terms that are used to facilitate the mixing of the input data at different stages of the algorithm.