Relating FFTW and Split-Radix

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 floatingpoint operations than the well-known FFTW codelets and split-radix algorithm. er 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.

• Type: Conference
• Year: 2004
• Where: ICESS
• Authors: Oleg Kiselyov, Walid Taha
• Keywords: Abstract Interpretation, Fast Fourier Transform, ICESS 2004, Well-known Fftw Codelets