Browse wiki

From CERES
Jump to: navigation, search
Publications:Relating FFTW and Split-Radix
Abstract <p>Recent work showed that staging a<p>Recent work showed that staging and abstract interpretation can beused 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 floatingpoint operations than the well-known FFTW codelets and split-radix algorithm.This paper shows that staging and abstract interpretation can in fact be used toproduce circuits with the same number of floating-point operations as each ofsplit-radix and FFTW. In addition, choosing between two standard implementations of complex multiplication produces results that match each of the twoalgorithms. Thus, we provide a constructive method for deriving the two distinctalgorithms.</p>ving the two distinctalgorithms.</p>
Author Oleg Kiselyov + , Walid Taha +
Conference ICESS'04 International Conference on Embedded Software and Systems
Diva http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:588272
PublicationType Conference Paper  +
Title Relating FFTW and Split-Radix  +
Year 2004  +
Has queryThis property is a special property in this wiki. Publications:Relating FFTW and Split-Radix + , Publications:Relating FFTW and Split-Radix + , Publications:Relating FFTW and Split-Radix + , Publications:Relating FFTW and Split-Radix + , Publications:Relating FFTW and Split-Radix + , Publications:Relating FFTW and Split-Radix + , Publications:Relating FFTW and Split-Radix + , Publications:Relating FFTW and Split-Radix + , Publications:Relating FFTW and Split-Radix + , Publications:Relating FFTW and Split-Radix +
Categories Publication  +
Modification dateThis property is a special property in this wiki. 26 June 2014 03:44:55  +
hide properties that link here 
  No properties link to this page.
 

 

Enter the name of the page to start browsing from.