Relating FFTW and split-radix

Oleg Kiselyov, Walid Taha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationEmbedded Software and Systems - First International Conference, ICESS 2004, Revised Selected Papers
PublisherSpringer Verlag
Pages488-493
Number of pages6
ISBN (Print)3540281282, 9783540281283
DOIs
Publication statusPublished - 2005 Jan 1
Externally publishedYes
EventFirst International Conference on Embedded Software and Systems, ICESS 2004 - Hangzhou, China
Duration: 2004 Dec 92004 Dec 10

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3605 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherFirst International Conference on Embedded Software and Systems, ICESS 2004
CountryChina
CityHangzhou
Period04/12/904/12/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Relating FFTW and split-radix'. Together they form a unique fingerprint.

Cite this