
The NVIDIA CUDA Fast Fourier Transform library (cuFFT) provides a simple interface for computing FFTs up to 10x faster. By using hundreds of processor cores inside NVIDIA GPUs, cuFFT delivers the floating‐point performance of a GPU without having to develop your own custom GPU FFT implementation.
Widely used in applications ranging from computational physics to image processing and general signal processing, the Fast Fourier Transform is an efficient algorithm for computing discrete Fourier transforms of complex or real‐valued data sets. cuFFT uses algorithms based on the well-known Cooley-Tukey and Bluestein algorithms, so you can be confident that you’re getting accurate results faster than ever.
Key Features
|
Performance
FFTs Up To 10x Faster Than MKL
1D used in audio processing and as a foundation for 2D&3D FFTs

CUDA 4.1 Optimizes 3D Transforms
Source Code Example
3D Complex-to-Complex Transforms
|
#define NX 64 cufftHandle plan; /* Transform the first signal in place. */ /* Transform the second signal using the same plan. */ /* Destroy the cuFFT plan. */ |
Availability
The cuFFT library is freely available as part of the CUDA Toolkit at www.nvidia.com/getcuda.
| For more information on cuFFT and other CUDA math libraries: | |





Registered Developers Website
NVDeveloper (old site)