Authors:
José G. Marichal-Hernández
;
Fernando Rosa
and
José M. Rodríguez-Ramos
Affiliation:
Universidad de La Laguna, Spain
Keyword(s):
FFT, Graphics processing units, Stream computing, Signal processing, Image processing.
Related
Ontology
Subjects/Areas/Topics:
Computer Vision, Visualization and Computer Graphics
;
Image Filtering
;
Image Formation and Preprocessing
;
Implementation of Image and Video Processing Systems
Abstract:
In this article, the different variants of the fast Fourier transform algorithm are revisited and analysed in terms of the cost of implementing them on graphics processing units. We describe the key factors in the selection of an efficient algorithm that takes advantage of this hardware and, with the stream model language BrookGPU, we implement efficient versions of unidimensional and bidimensional FFT. These implementations allow the computation of unidimensional transform sequences of 262k complex numbers under 13 ms and bidimensional transforms on sequences of size 1024x1024 under 59 ms on a G70 GPU, that is almost 3.4 times faster than FFTW on a high-end CPU.