Sciweavers

266 search results - page 3 / 54
» New algorithms for computing directional discrete Fourier tr...
Sort
View
IPPS
2003
IEEE
13 years 10 months ago
Short Vector Code Generation for the Discrete Fourier Transform
In this paper we use a mathematical approach to automatically generate high performance short vector code for the discrete Fourier transform (DFT). We represent the well-known Coo...
Franz Franchetti, Markus Püschel
CCGRID
2011
IEEE
12 years 9 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
CORR
2000
Springer
81views Education» more  CORR 2000»
13 years 5 months ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman
APPML
2010
112views more  APPML 2010»
13 years 5 months ago
Computing Fourier transforms and convolutions of Sn-1-invariant signals on Sn in time linear in n
Let Sn denote the symmetric group on {1, . . . , n} and Sn-1 the stabilizer subgroup of n. We derive algorithms for computing Fourier transforms of left and right Sn-1-invariant s...
Michael Clausen, Ramakrishna Kakarala
MUE
2008
IEEE
177views Multimedia» more  MUE 2008»
13 years 11 months ago
Abnormal Gait Detection Using Discrete Fourier Transform
Detection of gait characteristics has found considerable interest in field of biomechanics and rehabilitation sciences. In this paper an approach for abnormal gait detection emplo...
Ahmed Mostayed, Mohammad Mynuddin Gani Mazumder, S...