133 search results - page 7 / 27 » Multithreaded algorithms for the fast Fourier transform |
107
click to vote
PACT
2009
Springer
15 years 6 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...
BILDMED
2008
15 years 1 months ago
2008
We propose a method, which treats metal artifact reduction in CT by sinogram restoration as a problem of scattered data interpolation. Corrupted sinogram entries are discarded and ...
135
click to vote
QCQC
1998
Springer
15 years 3 months ago
1998
Springer
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
119
click to vote
ICIP
2010
IEEE
14 years 9 months ago
2010
IEEE
The Fast Fourier Transform (FFT) allows the Discrete Time Fourier Transform (DTFT) to be efficiently sampled on a uniform grid in frequency. In many applications, including Magnet...
83
Voted
IPPS
2003
IEEE
15 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...