Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Cooley–Tukey_FFT_algorithm> ?p ?o }
- Cooley–Tukey_FFT_algorithm wikiPageWikiLinkText "FFT-like algorithm".
- Cooley–Tukey_FFT_algorithm wikiPageWikiLinkText "data reordering".
- Cooley–Tukey_FFT_algorithm wikiPageWikiLinkText "fast Fourier transform".
- Cooley–Tukey_FFT_algorithm wikiPageWikiLinkText "more general version of FFT".
- Cooley–Tukey_FFT_algorithm hasPhotoCollection Cooley–Tukey_FFT_algorithm.
- Cooley–Tukey_FFT_algorithm wikiPageUsesTemplate Template:Reflist.
- Cooley–Tukey_FFT_algorithm subject Category:Articles_with_example_pseudocode.
- Cooley–Tukey_FFT_algorithm subject Category:FFT_algorithms.
- Cooley–Tukey_FFT_algorithm comment "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 = N1N2 in terms of smaller DFTs of sizes N1 and N2, recursively, to reduce the computation time to O(N log N) for highly composite N (smooth numbers).".
- Cooley–Tukey_FFT_algorithm label "Cooley–Tukey FFT algorithm".
- Cooley–Tukey_FFT_algorithm sameAs Algorytm_Cooleya-Tukeya.
- Cooley–Tukey_FFT_algorithm sameAs m.01zh37.
- Cooley–Tukey_FFT_algorithm sameAs Q5167446.
- Cooley–Tukey_FFT_algorithm sameAs Q5167446.
- Cooley–Tukey_FFT_algorithm sameAs 库利－图基快速傅里叶变换算法.
- Cooley–Tukey_FFT_algorithm wasDerivedFrom Cooley–Tukey_FFT_algorithm?oldid=673260184.
- Cooley–Tukey_FFT_algorithm depiction DIT-FFT-butterfly.png.
- Cooley–Tukey_FFT_algorithm isPrimaryTopicOf Cooley–Tukey_FFT_algorithm.
