Sciweavers

Share
ICMCS
2008
IEEE

Fast computation of general Fourier Transforms on GPUS

9 years 4 months ago
Fast computation of general Fourier Transforms on GPUS
We present an implementation of general FFTs for graphics processing units (GPUs). Unlike most existing GPU FFT implementations, we handle both complex and real data of any size that can fit in a texture. The basic building block for our algorithms is a radix-2 Stockham formulation of the FFT for power-of-two data sizes that avoids expensive bit reversals and exploits the high GPU memory bandwidth efficiently. We implemented our algorithms using the DirectX 9 API, which enables our routines to be used on many of the existing GPUs today. We have performed comparisons against optimized CPU-based and GPU-based FFT libraries (Intel Math Kernel Library and NVIDIA CUFFT, respectively). Our results on an NVIDIA GeForce 8800 GTX GPU indicate a significant performance improvement over the existing libraries for many input cases.
Brandon Lloyd, Chas Boyd, Naga K. Govindaraju
Added 30 May 2010
Updated 30 May 2010
Type Conference
Year 2008
Where ICMCS
Authors Brandon Lloyd, Chas Boyd, Naga K. Govindaraju
Comments (0)
books