๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An improved parallel algorithm for integer GCD

โœ Scribed by Benny Chor; Oded Goldreich

Publisher
Springer
Year
1990
Tongue
English
Weight
544 KB
Volume
5
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Improvements on the accelerated integer
Improvements on the accelerated integer GCD algorithm
โœ Mohamed S. Sedjelmaci; Christian Lavault ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 493 KB

The present paper analyses and presents several improvements to the algorithm for finding the (a, b)-pairs used in the k-ary reduction of the right-shift k-ary integer GCD algorithm. While the worst-case complexity of the "Accelerated integer GCD algorithm" is 0( (log,( k))'), we show that the worst

An efficient algorithm for parallel inte
An efficient algorithm for parallel integer multiplication
โœ Benjamin Singer; George Saon ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 67 KB

In this paper we propose an efficient algorithm to implement parallel integer multiplication by a combination of parallel additions, shifts and reads from a memoryresident lookup table dedicated to squares. Such an operator called PIM (parallel integer multiplication) is in fact microprogrammed at t