242 search results - page 8 / 49 » Fast computation of general Fourier Transforms on GPUS |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We exhibit a canonical basis of eigenvectors for the discrete Fourier transform (DFT). The transition matrix from the standard basis to defines a novel transform which we call ...
VMV
2004
14 years 7 days ago
2004
The Fourier volume rendering technique operates in the frequency domain and creates line integral projections of a 3D scalar field. These projections can be efficiently generated ...
PACT
2009
Springer
14 years 5 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
COMPUTING
2008
13 years 11 months ago
2008
In this work, we use conformal mapping to transform harmonic Dirichlet problems that are defined in simply
HIPC
2007
Springer
14 years 5 months ago
2007
Springer
The Fast Fourier Transform (FFT) is of primary importance and a fundamental kernel in many computationally intensive scientific applications. In this paper we investigate its perf...