2026-09-21T11:10:09Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/44116 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Snir, Marc Yee, Alexander 2013-05-24T21:51:10Z 2013-05-24T21:51:10Z 2013-05 2013-05-24T21:51:10Z 2013-05 FFT implementations today generally fall into two categories: Library generators (such as FFTW and Spiral) and specialized FFTs (such as prime95). Specialized FFTs have the obvious limitation of being specialized. However they are hand-tuned and generally offer superior performance. Library generators are generic and easier to port. But their performance is generally suboptimal. We describe in this paper an FFT library that was built while paying special attention to locality. The library achieves significantly better performance than FFTW, for long vectors. Unlike FFTW or Spiral, the recursive decomposition of the FFT is not created by a library generator; it is created by macro expansion that has a few selectable parameters. This provides an interface that can be more easily modified by users. Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-04-24T19:30:15Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Yee_Alexander.pdf: 951677 bytes, checksum: 206eb86400149b08d2ae40c5ea5db7ad (MD5) Made available in DSpace on 2013-05-24T21:51:10Z (GMT). No. of bitstreams: 2 Alexander_Yee.pdf: 938096 bytes, checksum: 3a94b263ad02a41be511e18d1471ef1a (MD5) license.txt: 4060 bytes, checksum: 2e803365be76ce53b2bea07aa1b71dfb (MD5) http://hdl.handle.net/2142/44116 en Copyright 2013 Alexander Yee High Performance Computing (HPC) Fast Fourier Transform (FFT) Libraries A faster FFT in the Mid-West text Computer Science 1434 Computer Science 0112 University of Illinois at Urbana-Champaign Thesis M.S. MS:Computer Science -UIUC 10KS0112MS