25 search results - page 1 / 5 » The Centered Discrete Fourier Transform and a parallel imple... |
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
This paper describes a novel method for the computation of the Discrete Fourier Transform (DFT). The development of a truly centered DFT is coupled with a method for computing the...
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...
PACT
2009
Springer
13 years 11 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...
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 ...
NIPS
2003
13 years 6 months ago
2003
Discrete Fourier transforms and other related Fourier methods have been practically implementable due to the fast Fourier transform (FFT). However there are many situations where ...