133 search results - page 6 / 27 » Multithreaded algorithms for the fast Fourier transform |
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We exhibit a canonical basis of eigenvectors for the discrete Fourier transform (DFT). The transition matrix from the standard basis to defines a novel transform which we call ...
STOC
2012
ACM
11 years 9 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
APPML
2010
13 years 7 months ago
2010
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...