481 search results - page 6 / 97 » A Fast Program Generator of Fast Fourier Transforms |
193
Voted
Book
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...
76
Voted
PEPM
1994
ACM
15 years 1 months ago
1994
ACM
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...
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...
ERSHOV
2003
Springer
15 years 2 months ago
2003
Springer
We provide a polymorphic framework for radix-n Fast Fourier Transforms (FFTs) where all known kinds of monomoporhic radix-n algorithms can be obtained by specialization. The framew...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...