Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Bruuns_FFT_algorithm> ?p ?o }
Showing triples 1 to 33 of
33
with 100 triples per page.
- Bruuns_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.".
- Bruuns_FFT_algorithm wikiPageID "272020".
- Bruuns_FFT_algorithm wikiPageLength "11585".
- Bruuns_FFT_algorithm wikiPageOutDegree "14".
- Bruuns_FFT_algorithm wikiPageRevisionID "606118645".
- Bruuns_FFT_algorithm wikiPageWikiLink Algebraically_closed_field.
- Bruuns_FFT_algorithm wikiPageWikiLink Category:FFT_algorithms.
- Bruuns_FFT_algorithm wikiPageWikiLink Chinese_remainder_theorem.
- Bruuns_FFT_algorithm wikiPageWikiLink Cooley–Tukey_FFT_algorithm.
- Bruuns_FFT_algorithm wikiPageWikiLink Degree_of_a_polynomial.
- Bruuns_FFT_algorithm wikiPageWikiLink Discrete_Fourier_transform.
- Bruuns_FFT_algorithm wikiPageWikiLink Discrete_cosine_transform.
- Bruuns_FFT_algorithm wikiPageWikiLink Fast_Fourier_transform.
- Bruuns_FFT_algorithm wikiPageWikiLink Institute_of_Electrical_and_Electronics_Engineers.
- Bruuns_FFT_algorithm wikiPageWikiLink International_Conference_on_Acoustics,_Speech,_and_Signal_Processing.
- Bruuns_FFT_algorithm wikiPageWikiLink Polynomial.
- Bruuns_FFT_algorithm wikiPageWikiLink Polynomial_remainder_theorem.
- Bruuns_FFT_algorithm wikiPageWikiLink Power_of_two.
- Bruuns_FFT_algorithm wikiPageWikiLink Root_of_unity.
- Bruuns_FFT_algorithm wikiPageWikiLinkText "Bruun's FFT algorithm".
- Bruuns_FFT_algorithm wikiPageWikiLinkText "Bruun's algorithm".
- Bruuns_FFT_algorithm wikiPageWikiLinkText "Bruun's".
- Bruuns_FFT_algorithm wikiPageUsesTemplate Template:Sic.
- Bruuns_FFT_algorithm subject Category:FFT_algorithms.
- Bruuns_FFT_algorithm type Algorithm.
- Bruuns_FFT_algorithm type Transform.
- Bruuns_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.".
- Bruuns_FFT_algorithm label "Bruun's FFT algorithm".
- Bruuns_FFT_algorithm sameAs Q4979897.
- Bruuns_FFT_algorithm sameAs m.01nygj.
- Bruuns_FFT_algorithm sameAs Q4979897.
- Bruuns_FFT_algorithm wasDerivedFrom Bruuns_FFT_algorithm?oldid=606118645.
- Bruuns_FFT_algorithm isPrimaryTopicOf Bruuns_FFT_algorithm.