Sciweavers

225 search results - page 5 / 45
» The Future Fast Fourier Transform
Sort
View
FOCS
2000
IEEE
14 years 25 days ago
Fast parallel circuits for the quantum Fourier transform
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...
Richard Cleve, John Watrous
DAGM
2010
Springer
13 years 9 months ago
3D Object Detection Using a Fast Voxel-Wise Local Spherical Fourier Tensor Transformation
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...
Henrik Skibbe, Marco Reisert, Thorsten Schmidt, Kl...
ICMCS
2008
IEEE
208views Multimedia» more  ICMCS 2008»
14 years 2 months ago
Fast computation of general Fourier Transforms on GPUS
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...
Brandon Lloyd, Chas Boyd, Naga K. Govindaraju
SPAA
2000
ACM
14 years 23 days ago
Multithreaded algorithms for the fast Fourier transform
Parimala Thulasiraman, Kevin B. Theobald, Ashfaq A...