52 search results - page 7 / 11 » Fast parallel circuits for the quantum Fourier transform |
FSE
2008
Springer
13 years 9 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
JISE
2006
13 years 7 months ago
2006
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms. We first express a computational problem ...
DATE
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents a new application field for the Goertzel algorithm. The test of mixed-signal circuits involves the generation and analysis of signals. A standard method for th...
PC
1998
13 years 7 months ago
1998
The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most one-dimensional FFT problems canbe entirely solvedentirely ...
SC
1991
ACM
13 years 11 months ago
1991
ACM
Two problems from the recently published “NAS Parallel Benchmarks” have been implemented on three advanced parallel computer systems. These two benchmarks are the following: (...