Cooley–Tukey FFT algorithm
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 in terms of N1 smaller DFTs of sizes N2, recursively, to reduce the computation time to O(N log N) for highly composite N (smooth numbers). Because of the algorithm's importance, specific variants and implementation styles have become known by their own names, as described below.
known for
1965 in scienceBit-reversal permutationBrown_UniversityBruun's FFT algorithmButterfly diagramCache-oblivious algorithmCarl_Friedrich_GaussChirp Z-transformComputer engineering compendiumCooley-Tukey FFTCooley-Tukey FFT algorithmCooley Tukey AlgorithmCooley Tukey algorithmCooley–Tukey FFTCornelius LanczosDanielson-Lanczos lemmaDanielson–Lanczos lemmaDiscrete Fourier transformDiscrete Hartley transformDiscrete cosine transformDivide-and-conquer algorithmFFTWFast Fourier transformFourier analysisG. C. DanielsonHPC Challenge BenchmarkJames CooleyJohn TukeyKronecker productList of Brown University peopleList of algorithmsList of examples of Stigler's lawList of harmonic analysis topicsList of lemmasList of numerical analysis topicsList of pioneers in computer scienceMathematical diagramMixed radixNuclear magnetic resonanceParallel computing
Link from a Wikipage to another Wikipage
known for
primaryTopic
Cooley–Tukey FFT algorithm
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 in terms of N1 smaller DFTs of sizes N2, recursively, to reduce the computation time to O(N log N) for highly composite N (smooth numbers). Because of the algorithm's importance, specific variants and implementation styles have become known by their own names, as described below.
has abstract
Algorytm Cooleya-Tukeya – algo ...... zględnie pierwszych czynników.
@pl
L'algorisme de Cooley–Tukey és ...... ps computacional a O(n log n).
@ca
The Cooley–Tukey algorithm, na ...... opularized it 160 years later.
@en
Алгоритм Ку́ли — Тью́ки — наиб ...... в честь Дж. Кули и Дж. Тьюки.
@ru
Алгоритм Кулі-Тьюкі — найбільш ...... а програмній обробці сигналів.
@uk
库利－图基快速傅里叶变换算法（Cooley-Tukey算法） ...... 度的多個DFT，因此它可以同任一種其他的DFT算法聯合使用。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,018,873,371
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
Algorytm Cooleya-Tukeya – algo ...... m J.W. Cooleya i Johna Tukeya.
@pl
L'algorisme de Cooley–Tukey és ...... ps computacional a O(n log n).
@ca
The Cooley–Tukey algorithm, na ...... own names, as described below.
@en
Алгоритм Ку́ли — Тью́ки — наиб ...... в честь Дж. Кули и Дж. Тьюки.
@ru
Алгоритм Кулі-Тьюкі — найбільш ...... а програмній обробці сигналів.
@uk
库利－图基快速傅里叶变换算法（Cooley-Tukey算法） ...... 度的多個DFT，因此它可以同任一種其他的DFT算法聯合使用。
@zh
label
Algorisme de Cooley–Tukey
@ca
Algorytm Cooleya-Tukeya
@pl
Cooley–Tukey FFT algorithm
@en
Алгоритм Кули — Тьюки
@ru
Алгоритм Кулі-Тьюкі
@uk
库利－图基快速傅里叶变换算法
@zh