Generating high performance pruned FFT implementations

@article{Franchetti2009GeneratingHP,
  title={Generating high performance pruned FFT implementations},
  author={Franz Franchetti and Markus P{\"u}schel},
  journal={2009 IEEE International Conference on Acoustics, Speech and Signal Processing},
  year={2009},
  pages={549-552}
}
We derive a recursive general-radix pruned Cooley-Tukey fast Fourier transform (FFT) algorithm in Kronecker product notation. The algorithm is compatible with vectorization and parallelization required on state-of-the-art multicore CPUs. We include the pruned FFT algorithm into the program generation system Spiral, and automatically generate optimized implementations of the pruned FFT for the Intel Core2Duo multicore processor. Experimental results show that using the pruned FFT can indeed… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS