Sciweavers

52 search results - page 3 / 11
» Fast parallel circuits for the quantum Fourier transform
Sort
View
CCGRID
2011
IEEE
12 years 11 months ago
Small Discrete Fourier Transforms on GPUs
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
S. Mitra, A. Srinivasan
FP
1989
124views Formal Methods» more  FP 1989»
13 years 11 months ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones
PPSC
1997
13 years 9 months ago
The Future Fast Fourier Transform?
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...
Alan Edelman, Peter McCorquodale, Sivan Toledo
ICS
2009
Tsinghua U.
14 years 2 months ago
Computer generation of fast fourier transforms for the cell broadband engine
The Cell BE is a multicore processor with eight vector accelerators (called SPEs) that implement explicit cache management through direct memory access engines. While the Cell has...
Srinivas Chellappa, Franz Franchetti, Markus P&uum...
IPPS
2002
IEEE
14 years 19 days ago
A Prototypical Self-Optimizing Package for Parallel Implementation of Fast Signal Transforms
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....
Kang Chen, Jeremy R. Johnson