Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Bruun's_FFT_algorithm> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- Bruun's_FFT_algorithm abstract "Bruun's algorithm is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial-factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996. Because its operations involve only real coefficients until the last computation stage, it was initially proposed as a way to efficiently compute the discrete Fourier transform (DFT) of real data. Bruun's algorithm has not seen widespread use, however, as approaches based on the ordinary Cooley–Tukey FFT algorithm have been successfully adapted to real data with at least as much efficiency. Furthermore, there is evidence that Bruun's algorithm may be intrinsically less accurate than Cooley–Tukey in the face of finite numerical precision (Storn, 1993).Nevertheless, Bruun's algorithm illustrates an alternative algorithmic framework that can express both itself and the Cooley–Tukey algorithm, and thus provides an interesting perspective on FFTs that permits mixtures of the two algorithms and other generalizations.".
- Bruun's_FFT_algorithm wikiPageID "272020".
- Bruun's_FFT_algorithm wikiPageRevisionID "606118645".
- Bruun's_FFT_algorithm hasPhotoCollection Bruun's_FFT_algorithm.
- Bruun's_FFT_algorithm subject Category:FFT_algorithms.
- Bruun's_FFT_algorithm type Abstraction100002137.
- Bruun's_FFT_algorithm type Act100030358.
- Bruun's_FFT_algorithm type Activity100407535.
- Bruun's_FFT_algorithm type Algorithm105847438.
- Bruun's_FFT_algorithm type Event100029378.
- Bruun's_FFT_algorithm type FFTAlgorithms.
- Bruun's_FFT_algorithm type Procedure101023820.
- Bruun's_FFT_algorithm type PsychologicalFeature100023100.
- Bruun's_FFT_algorithm type Rule105846932.
- Bruun's_FFT_algorithm type YagoPermanentlyLocatedEntity.
- Bruun's_FFT_algorithm comment "Bruun's algorithm is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial-factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996. Because its operations involve only real coefficients until the last computation stage, it was initially proposed as a way to efficiently compute the discrete Fourier transform (DFT) of real data.".
- Bruun's_FFT_algorithm label "Bruun's FFT algorithm".
- Bruun's_FFT_algorithm sameAs m.01nygj.
- Bruun's_FFT_algorithm sameAs Q4979897.
- Bruun's_FFT_algorithm sameAs Q4979897.
- Bruun's_FFT_algorithm sameAs Bruun's_FFT_algorithm.
- Bruun's_FFT_algorithm wasDerivedFrom Bruun's_FFT_algorithm?oldid=606118645.
- Bruun's_FFT_algorithm isPrimaryTopicOf Bruun's_FFT_algorithm.