14 search results - page 1 / 3 » Memory Saving Discrete Fourier Transform on GPUs |
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 ...
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 ...
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...
IPPS
1999
IEEE
13 years 8 months ago
1999
IEEE
This paper proposes a new memory system called shuffle memory. The shuffle memory is a generalization of transposition memory that has been widely used in 2-D Discrete Cosine Tran...
IEEEPACT
2009
IEEE
13 years 11 months ago
2009
IEEE
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...