225 search results - page 5 / 45 » The Future Fast Fourier Transform |
129
Voted
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
135
Voted
DAGM
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we present a novel approach for expanding spherical 3D-tensor fields of arbitrary order in terms of a tensor valued local Fourier basis. For an efficient implementati...
149
Voted
ICMCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We present an implementation of general FFTs for graphics processing units (GPUs). Unlike most existing GPU FFT implementations, we handle both complex and real data of any size t...
113
Voted
SPAA
2000
ACM
15 years 8 months ago
2000
ACM
101
Voted
PLDI
1999
ACM
15 years 8 months ago
1999
ACM
