Sciweavers

Share
242 search results - page 1 / 49
» Fast computation of general Fourier Transforms on GPUS
Sort
View
ICMCS
2008
IEEE
208views Multimedia» more  ICMCS 2008»
10 years 11 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 t...
Brandon Lloyd, Chas Boyd, Naga K. Govindaraju
IEEECIT
2010
IEEE
10 years 2 months ago
Memory Saving Discrete Fourier Transform on GPUs
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 ...
Daniel Kauker, Harald Sanftmann, Steffen Frey, Tho...
IPPS
2008
IEEE
10 years 10 months ago
Parallel option pricing with Fourier Space Time-stepping method on Graphics Processing Units
With the evolution of Graphics Processing Units (GPUs) into powerful and cost-efficient computing architectures, their range of application has expanded tremendously, especially i...
Vladimir Surkov
CCGRID
2011
IEEE
9 years 8 months ago
Small Discrete Fourier Transforms on GPUs
– 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 ...
S. Mitra, A. Srinivasan
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
10 years 9 months ago
The truncated fourier transform and applications
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...
Joris van der Hoeven
books