245 search results - page 10 / 49 » A Fast Fourier Transform Compiler |
BILDMED
2008
13 years 8 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 ...
ICIP
2010
IEEE
13 years 4 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...
COMPUTING
2008
13 years 7 months ago
2008
In this work, we use conformal mapping to transform harmonic Dirichlet problems that are defined in simply
IPPS
2003
IEEE
14 years 20 days 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...
IPPS
2002
IEEE
14 years 9 days 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....