Sciweavers

65 search results - page 2 / 13
» An adaptive software library for fast Fourier transforms
Sort
View
CORR
2010
Springer
66views Education» more  CORR 2010»
14 years 9 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts
DSL
2009
14 years 7 months ago
Operator Language: A Program Generation Framework for Fast Kernels
Abstract. We present the Operator Language (OL), a framework to automatically generate fast numerical kernels. OL provides the structure to extend the program generation system Spi...
Franz Franchetti, Frédéric de Mesmay...
98
Voted
IPPS
2002
IEEE
15 years 2 months 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
72
Voted
IPPS
2003
IEEE
15 years 2 months ago
Short Vector Code Generation for the Discrete Fourier Transform
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...
Franz Franchetti, Markus Püschel
76
Voted
PEPM
1994
ACM
15 years 1 months ago
Partial Evaluation of Numerical Programs in Fortran
our results using the Fast Fourier Transformation, the N-body attraction problem, and the cubic splines interpolation as examples.We investigate the application of partial evaluati...
Romana Baier, Robert Glück, Robert Zöchl...