UHFFT : A High Performance DFT Framework

@inproceedings{Ali2007UHFFTA,
  title={UHFFT : A High Performance DFT Framework},
  author={Ayaz Ali and L. Johnsson},
  year={2007}
}
We present a framework for algorithm selection, code generation and optimization for the Fast Fourier Transform. The framework consists of two main parts – the DFT Code Generator (FftGen) and the Execution Scheduler (FftPlanner). The library generator outputs a highly optimized set of small to modest size DFT codelets written in ‘C’. The FftPlanner searches an exponential space of possible algorithms, factors and schedules to select the best computation plan at run time. UHFFT is a high… CONTINUE READING

Citations

Publications citing this paper.

The Fastest Fourier Transform in the South

IEEE Transactions on Signal Processing • 2013
View 5 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Discrete fourier transforms when the number of data samples is prime

C. M. Rader
Proceedings of the IEEE, • 1968
View 5 Excerpts
Highly Influenced

An algorithm for the machine computation of complex fourier series

J. C. Cooley, J. W. Tukey
Math.Comp., • 1965
View 5 Excerpts
Highly Influenced

Guest Editors Introduction to the top 10 algorithms

Computing in Science and Engineering • 2000
View 1 Excerpt

A Note on Prime Factor FFT Algorithms

C. Temperton
Journal of Computational Physics, • 1983
View 2 Excerpts

Similar Papers

Loading similar papers…