Fast Parallel Computation of the Polynomial Shift

9 years 10 months ago
Fast Parallel Computation of the Polynomial Shift
Given an n-degree polynomial fx over an arbitrary ring, the shift of fx by c is the operation which computes coefficients of the polynomial fx + c. In this paper we consider the case when the shift by given constant c has to be performed several times (repeatedly). We propose a parallel algorithm suited for SIMD architecture to perform the shift in O1 time if we have On2  Processor Elements available. Proposed algorithm is easy to generalize to multivariate polynomials shift. The possibility of applying this algorithm to polynomials with coefficients from non-commutative rings is discussed as well as the bit-wise complexity of the algorithm.
Eugene V. Zima
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1997
Where IPPS
Authors Eugene V. Zima
Comments (0)