61 search results - page 1 / 13 » A Grouped Fast Fourier Transform Algorithm Design For Select... |
APCCAS
2006
IEEE
13 years 7 months ago
2006
IEEE
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...
APPML
2010
13 years 5 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...
ICIP
2003
IEEE
14 years 6 months ago
2003
IEEE
Inthispaper we formulatethe Radon transform asa wnvolution integral over the Euclidean motion group (SE(2)) and provideaminimummeansquare error(MMSE) stochastic deconvolution meth...
FP
1989
13 years 9 months ago
1989
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
QCQC
1998
Springer
13 years 9 months ago
1998
Springer
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...