Sökning: onr:"swepub:oai:DiVA.org:hh-20974" >
Relating FFTW and S...
Relating FFTW and Split-Radix
-
- Kiselyov, Oleg (författare)
- Monterey, CA, USA
-
- Taha, Walid, 1971- (författare)
- Rice University, Houston, TX, USA
-
(creator_code:org_t)
- Berlin : Springer Berlin/Heidelberg, 2004
- 2004
- Engelska.
-
Ingår i: Embedded Software and Systems. - Berlin : Springer Berlin/Heidelberg. - 9783540281283 - 9783540318231 ; , s. 488-493
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Recent work showed that staging and abstract interpretation can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analysis of the Fast Fourier Transform (FFT) for sizes 2n. While the quality of the generated code was promising, it used more floating-point operations than the well-known FFTW codelets and split-radix algorithm. This paper shows that staging and abstract interpretation can in fact be used to produce circuits with the same number of floating-point operations as each of split-radix and FFTW. In addition, choosing between two standard implementations of complex multiplication produces results that match each of the two algorithms. Thus, we provide a constructive method for deriving the two distinct algorithms. © Springer-Verlag Berlin Heidelberg 2005.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Datorsystem (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Computer Systems (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas