Relating FFTW and Split-Radix

@inproceedings{Kiselyov2004RelatingFA,
  title={Relating FFTW and Split-Radix},
  author={Oleg Kiselyov and Walid Taha},
  booktitle={ICESS},
  year={2004}
}
Recent work showed that staging and abstract interpretatio n can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analysis of the Fast Fourier Transfor m (FFT) for sizes2n. While the quality of the generated code was promising, it use d more floatingpoint operations than the well-known FFTW codelets and spli t-radix algorithm. This paper shows that staging and abstract interpretation c an in fact be used to produce circuits with the… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
15 Citations
12 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Available from http://caml.inria.fr/ocaml

  • Xavier Leroy
  • Objective Caml,
  • 2000
2 Excerpts

Automatic generation of prim e length FFT programs

  • C. S. Burrus I.W. Selesnick
  • In IEEE Transactions on Signal Processing,
  • 1996
1 Excerpt

Moorby. The Verilog Hardware Description Language

  • Donald E. Thomas, R Philip
  • Kluwer Academic Publishers,
  • 1996
2 Excerpts

On the number of multiplica tions necessary to compute a length-2n DFT

  • M.T.Heideman, C.S.Burrus
  • IEEE Trans. ASSP,
  • 1986
1 Excerpt

Similar Papers

Loading similar papers…