Sciweavers

245 search results - page 2 / 49
» A Fast Fourier Transform Compiler
Sort
View
CPHYSICS
2010
195views more  CPHYSICS 2010»
13 years 7 months ago
Fast spherical Bessel transform via fast Fourier transform and recurrence formula
We propose a new method for the numerical evaluation of the spherical Bessel transform. A formula is derived for the transform by using an integral representation of the spherical...
Masayuki Toyoda, Taisuke Ozaki
IPPS
2002
IEEE
14 years 9 days ago
A SIMD Vectorizing Compiler for Digital Signal Processing Algorithms
Short vector SIMD instructions on recent microprocessors, such as SSE on Pentium III and 4, speed up code but are a major challenge to software developers. We present a compiler t...
Franz Franchetti, Markus Püschel
TSP
2008
178views more  TSP 2008»
13 years 7 months ago
Digital Computation of Linear Canonical Transforms
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...
A. Koc, Haldun M. Özaktas, Cagatay Candan, M....
JOT
2010
186views more  JOT 2010»
13 years 5 months ago
The Discrete Fourier Transform, Part 6: Cross-Correlation
This paper is part 6 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT). The focus of this paper is on correlation....
Douglas Lyon
SIAMNUM
2010
134views more  SIAMNUM 2010»
13 years 2 months ago
Nonequispaced Hyperbolic Cross Fast Fourier Transform
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
Michael Döhler, Stefan Kunis, Daniel Potts