Sciweavers

225 search results - page 12 / 45
» The Future Fast Fourier Transform
Sort
View
QCQC
1998
Springer
173views Communications» more  QCQC 1998»
14 years 20 days ago
Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits
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...
Amir Fijany, Colin P. Williams
ICCAD
1996
IEEE
95views Hardware» more  ICCAD 1996»
14 years 18 days ago
Semi-analytical techniques for substrate characterization in the design of mixed-signal ICs
A number of methods are presentedfor highly efficient calculation of substratecurrenttransport. A three-dimensionalGreen'sFunction based substrate representation, in combinat...
Edoardo Charbon, Ranjit Gharpurey, Alberto L. Sang...
ASAP
2009
IEEE
98views Hardware» more  ASAP 2009»
13 years 6 months ago
A Power-Scalable Switch-Based Multi-processor FFT
This paper examines the architecture, algorithm and implementation of a switch-based multi-processor realization of the fast Fourier transform (FFT). The architecture employs M pr...
Bassam Jamil Mohd, Earl E. Swartzlander Jr.
ICIP
2003
IEEE
14 years 10 months ago
Radon transform inversion via Wiener filtering over the Euclidean motion group
Inthispaper we formulatethe Radon transform asa wnvolution integral over the Euclidean motion group (SE(2)) and provideaminimummeansquare error(MMSE) stochastic deconvolution meth...
Can Evren Yarman, Birsen Yazici
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 8 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts