Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Split-radix_FFT_algorithm> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Split-radix_FFT_algorithm abstract "The split-radix FFT is a fast Fourier transform (FFT) algorithm for computing the discrete Fourier transform (DFT), and was first described in an initially little-appreciated paper by R. Yavne (1968) and subsequently rediscovered simultaneously by various authors in 1984. (The name "split radix" was coined by two of these reinventors, P. Duhamel and H. Hollmann.) In particular, split radix is a variant of the Cooley-Tukey FFT algorithm that uses a blend of radices 2 and 4: it recursively expresses a DFT of length N in terms of one smaller DFT of length N/2 and two smaller DFTs of length N/4.The split-radix FFT, along with its variations, long had the distinction of achieving the lowest published arithmetic operation count (total exact number of required real additions and multiplications) to compute a DFT of power-of-two sizes N. The arithmetic count of the original split-radix algorithm was improved upon in 2004 (with the initial gains made in unpublished work by J. Van Buskirk via hand optimization for N=64 [1] [2]), but it turns out that one can still achieve the new lowest count by a modification of split radix (Johnson and Frigo, 2007). Although the number of arithmetic operations is not the sole factor (or even necessarily the dominant factor) in determining the time required to compute a DFT on a computer, the question of the minimum possible count is of longstanding theoretical interest. (No tight lower bound on the operation count has currently been proven.)The split-radix algorithm can only be applied when N is a multiple of 4, but since it breaks a DFT into smaller DFTs it can be combined with any other FFT algorithm as desired.".
- Split-radix_FFT_algorithm wikiPageExternalLink cnx.org.
- Split-radix_FFT_algorithm wikiPageExternalLink latest.
- Split-radix_FFT_algorithm wikiPageExternalLink 9e002292accb8a8b.
- Split-radix_FFT_algorithm wikiPageExternalLink ~kmbtib.
- Split-radix_FFT_algorithm wikiPageExternalLink newsplit.pdf.
- Split-radix_FFT_algorithm wikiPageID "5283890".
- Split-radix_FFT_algorithm wikiPageRevisionID "557009374".
- Split-radix_FFT_algorithm hasPhotoCollection Split-radix_FFT_algorithm.
- Split-radix_FFT_algorithm subject Category:FFT_algorithms.
- Split-radix_FFT_algorithm type Abstraction100002137.
- Split-radix_FFT_algorithm type Act100030358.
- Split-radix_FFT_algorithm type Activity100407535.
- Split-radix_FFT_algorithm type Algorithm105847438.
- Split-radix_FFT_algorithm type Event100029378.
- Split-radix_FFT_algorithm type FFTAlgorithms.
- Split-radix_FFT_algorithm type Procedure101023820.
- Split-radix_FFT_algorithm type PsychologicalFeature100023100.
- Split-radix_FFT_algorithm type Rule105846932.
- Split-radix_FFT_algorithm type YagoPermanentlyLocatedEntity.
- Split-radix_FFT_algorithm comment "The split-radix FFT is a fast Fourier transform (FFT) algorithm for computing the discrete Fourier transform (DFT), and was first described in an initially little-appreciated paper by R. Yavne (1968) and subsequently rediscovered simultaneously by various authors in 1984. (The name "split radix" was coined by two of these reinventors, P. Duhamel and H.".
- Split-radix_FFT_algorithm label "Split-radix FFT algorithm".
- Split-radix_FFT_algorithm sameAs m.0dcj3f.
- Split-radix_FFT_algorithm sameAs Q17103599.
- Split-radix_FFT_algorithm sameAs Q17103599.
- Split-radix_FFT_algorithm sameAs Split-radix_FFT_algorithm.
- Split-radix_FFT_algorithm wasDerivedFrom Split-radix_FFT_algorithm?oldid=557009374.
- Split-radix_FFT_algorithm isPrimaryTopicOf Split-radix_FFT_algorithm.