242 search results - page 9 / 49 » Fast computation of general Fourier Transforms on GPUS |
IPPS
2002
IEEE
14 years 3 months ago
2002
IEEE
This paper presents a self-adapting parallel package for computing the Walsh-Hadamard transform (WHT), a prototypical fast signal transform, similar to the fast Fourier transform....
IPPS
2003
IEEE
14 years 4 months ago
2003
IEEE
In this paper we use a mathematical approach to automatically generate high performance short vector code for the discrete Fourier transform (DFT). We represent the well-known Coo...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
SODA
2003
ACM
14 years 7 days ago
2003
ACM
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodi...
IEEEPACT
2009
IEEE
14 years 5 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...