Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Cooley%E2%80%93Tukey_FFT_algorithm> ?p ?o }
Showing triples 1 to 27 of
27
with 100 triples per page.
- Cooley%E2%80%93Tukey_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.The algorithm, along with its recursive application, was invented by Carl Friedrich Gauss. Cooley and Tukey independently rediscovered and popularized it 160 years later.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%E2%80%93Tukey_FFT_algorithm thumbnail DIT-FFT-butterfly.png?width=300.
- Cooley%E2%80%93Tukey_FFT_algorithm wikiPageExternalLink kissfft.
- Cooley%E2%80%93Tukey_FFT_algorithm wikiPageExternalLink article-10.
- Cooley%E2%80%93Tukey_FFT_algorithm wikiPageID "352702".
- Cooley%E2%80%93Tukey_FFT_algorithm wikiPageRevisionID "642562371".
- Cooley%E2%80%93Tukey_FFT_algorithm hasPhotoCollection Cooley–Tukey_FFT_algorithm.
- Cooley%E2%80%93Tukey_FFT_algorithm subject Category:Articles_with_example_pseudocode.
- Cooley%E2%80%93Tukey_FFT_algorithm subject Category:FFT_algorithms.
- Cooley%E2%80%93Tukey_FFT_algorithm type Abstraction100002137.
- Cooley%E2%80%93Tukey_FFT_algorithm type Act100030358.
- Cooley%E2%80%93Tukey_FFT_algorithm type Activity100407535.
- Cooley%E2%80%93Tukey_FFT_algorithm type Algorithm105847438.
- Cooley%E2%80%93Tukey_FFT_algorithm type Event100029378.
- Cooley%E2%80%93Tukey_FFT_algorithm type FFTAlgorithms.
- Cooley%E2%80%93Tukey_FFT_algorithm type Procedure101023820.
- Cooley%E2%80%93Tukey_FFT_algorithm type PsychologicalFeature100023100.
- Cooley%E2%80%93Tukey_FFT_algorithm type Rule105846932.
- Cooley%E2%80%93Tukey_FFT_algorithm type YagoPermanentlyLocatedEntity.
- Cooley%E2%80%93Tukey_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%E2%80%93Tukey_FFT_algorithm label "Algorytm Cooleya-Tukeya".
- Cooley%E2%80%93Tukey_FFT_algorithm label "Cooley–Tukey FFT algorithm".
- Cooley%E2%80%93Tukey_FFT_algorithm sameAs m.01zh37.
- Cooley%E2%80%93Tukey_FFT_algorithm sameAs Cooley–Tukey_FFT_algorithm.
- Cooley%E2%80%93Tukey_FFT_algorithm wasDerivedFrom Cooley–Tukey_FFT_algorithm?oldid=642562371.
- Cooley%E2%80%93Tukey_FFT_algorithm depiction DIT-FFT-butterfly.png.
- Cooley%E2%80%93Tukey_FFT_algorithm isPrimaryTopicOf Cooley–Tukey_FFT_algorithm.
