Files in this item



application/pdfAlexander_Yee.pdf (938kB)
(no description provided)PDF


Title:A faster FFT in the Mid-West
Author(s):Yee, Alexander
Advisor(s):Snir, Marc
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):High Performance Computing (HPC)
Fast Fourier Transform (FFT)
Abstract: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.
Issue Date:2013-05-24
Rights Information:Copyright 2013 Alexander Yee
Date Available in IDEALS:2013-05-24
Date Deposited:2013-05

This item appears in the following Collection(s)

Item Statistics