Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Cooley–Tukey_FFT_algorithm> ?p ?o. }
Showing items 1 to 16 of
16
with 100 items per page.
- Cooley–Tukey_FFT_algorithm abstract "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, in order 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.Because the Cooley-Tukey algorithm breaks the DFT into smaller DFTs, it can be combined arbitrarily with any other algorithm for the DFT. For example, Rader's or Bluestein's algorithm can be used to handle large prime factors that cannot be decomposed by Cooley–Tukey, or the prime-factor algorithm can be exploited for greater efficiency in separating out relatively prime factors.See also the fast Fourier transform for information on other FFT algorithms, specializations for real and/or symmetric data, and accuracy in the face of finite floating-point precision.".
- Cooley–Tukey_FFT_algorithm thumbnail DIT-FFT-butterfly.png?width=300.
- Cooley–Tukey_FFT_algorithm wikiPageID "352702".
- Cooley–Tukey_FFT_algorithm wikiPageRevisionID "596218853".
- 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, in order to reduce the computation time to O(N log N) for highly-composite N (smooth numbers).".
- Cooley–Tukey_FFT_algorithm label "Algorytm Cooleya-Tukeya".
- Cooley–Tukey_FFT_algorithm label "Cooley–Tukey FFT algorithm".
- Cooley–Tukey_FFT_algorithm label "库利－图基快速傅里叶变换算法".
- Cooley–Tukey_FFT_algorithm sameAs Cooley%E2%80%93Tukey_FFT_algorithm.
- Cooley–Tukey_FFT_algorithm sameAs Algorytm_Cooleya-Tukeya.
- Cooley–Tukey_FFT_algorithm sameAs Q5167446.
- Cooley–Tukey_FFT_algorithm sameAs Q5167446.
- Cooley–Tukey_FFT_algorithm wasDerivedFrom Cooley–Tukey_FFT_algorithm?oldid=596218853.
- Cooley–Tukey_FFT_algorithm depiction DIT-FFT-butterfly.png.
