481 search results - page 12 / 97 » A Fast Program Generator of Fast Fourier Transforms |
CORR
2007
Springer
14 years 9 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...
COMPUTING
2008
14 years 9 months ago
2008
In this work, we use conformal mapping to transform harmonic Dirichlet problems that are defined in simply
HIPC
2007
Springer
15 years 3 months ago
2007
Springer
The Fast Fourier Transform (FFT) is of primary importance and a fundamental kernel in many computationally intensive scientific applications. In this paper we investigate its perf...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
APPML
2010
14 years 9 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...