| Acronym |
Full form |
|
|
Acronym: DFT
|
discrete Fourier transform
|
to last version by Luckas-bot</comment> <text xml:space="preserve"> A '''fast Fourier transform''' ('''FFT''') is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group theory and number theory; this |
|
|
Acronym: FFT
|
fast Fourier transform
|
</contributor> <minor /> <comment>/* A polynomial approach to the DFT */</comment> <text xml:space="preserve">'''Bruun's algorithm''' is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial-factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996. |
|
|
Acronym: FFT
|
fast Fourier transform
|
*/</comment> <text xml:space="preserve">The '''Cooley–Tukey algorithm''', named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re-expresses the discrete Fourier transform (DFT) of an arbitrary composite size ''N'' = ''N'' 1 ''N'' 2 in terms of smaller DFTs of sizes ''N'' 1 and ''N'' |
|