242 search results - page 1 / 49 » Fast computation of general Fourier Transforms on GPUS |
ICMCS
2008
IEEE
13 years 11 months ago
2008
IEEE
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 t...
IEEECIT
2010
IEEE
13 years 2 months ago
2010
IEEE
This paper will show an alternative method to compute the two-dimensional Discrete Fourier Transform. While current GPU Fourier transform libraries need a large buffer for storing ...
IPPS
2008
IEEE
13 years 11 months ago
2008
IEEE
With the evolution of Graphics Processing Units (GPUs) into powerful and cost-efficient computing architectures, their range of application has expanded tremendously, especially i...
CCGRID
2011
IEEE
12 years 8 months ago
2011
IEEE
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...