242 search results - page 6 / 49 » Fast computation of general Fourier Transforms on GPUS |
IPPS
1998
IEEE
14 years 3 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...
FOCS
2000
IEEE
14 years 3 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...
TSP
2010
13 years 5 months ago
2010
Constant modulus transforms like discrete Fourier transform (DFT), Walsh transform, and Gold codes have been successfully used over several decades in several engineering applicati...
ICIP
2002
IEEE
15 years 14 days ago
2002
IEEE
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
ACMSE
2006
ACM
14 years 2 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...