242 search results - page 2 / 49 » Fast computation of general Fourier Transforms on GPUS |
130
click to vote
TSP
2008
15 years 1 months ago
2008
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...
101
click to vote
CPHYSICS
2010
15 years 1 months ago
2010
We propose a new method for the numerical evaluation of the spherical Bessel transform. A formula is derived for the transform by using an integral representation of the spherical...
158
click to vote
STOC
2012
ACM
13 years 3 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
142
click to vote
SIAMSC
2010
14 years 8 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
106
click to vote
APCCAS
2006
IEEE
15 years 3 months ago
2006
IEEE
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...