27 search results - page 1 / 6 » Fast Parallel Computation of the Polynomial Shift |
IPPS
1997
IEEE
13 years 8 months ago
1997
IEEE
Given an n-degree polynomial f x over an arbitrary ring, the shift of f x by c is the operation which computes coefficients of the polynomial f x + c . In this paper we conside...
ASAP
2005
IEEE
13 years 10 months ago
2005
IEEE
ACMSE
2006
ACM
13 years 8 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
IPPS
1999
IEEE
13 years 8 months ago
1999
IEEE
We propose an efficient reconfigurable parallel prefix counting network based on the recently-proposed technique of shift switching with domino logic, where the charge/discharge s...
FOCS
2000
IEEE
13 years 8 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...