Dorothea A. Klip
ABSTRACT
A new algorithm for integer Greatest Common Divisor calculations has recently been proposed. Although the algorithm can be applied to integers in any base b > 2, it is conjectured to be optimal for b=30, when embedded in a system for symbol manipulation. Representation of the digits in factored form further facilitates the GCD procedure. When choosing the set of residues mod 30 symmetrically with respect to 0, in only 8 out of 29 elements a factor occurs which is different from 2, 3 and 5, the prime divisors of 30. A multiplication and addition table built on the distinction of these two classes of digits will be the intermediary in finding the product in a small number of steps, each involving comparison of 1 or 2 bit quantities. Multiplication in this fashion requires 1/3 of the number of bit manipulations as compared with standard procedures on IBM System/360 and 370, if the latter would be applied to equivalent (i.e. 5-bit) entities. Future implementation of long-integer multiplication is suggested in analogy with an algorithm for multivariate polynomial multiplication. An outline for division on this new basis is included.
- 1.D. A. Klip, Some Aspects of a PORTable_ALGebra System, Proc. ACM, Southeast Region, April 1974, pp. 1-22.Google Scholar
- 2.G. W. Struble, Assembler Language Programming: the IBM System/360 and 370, Addison-Wesley Publishing Company, 2nd edition, 1975. Google ScholarDigital Library
- 3.D. A. Klip, Algorithms for Multivariate Polynomial Multiplication; Analysis by means of a stepwise approach, Proc. SYMSAC Symposium, Yorktown Heights, Aug. 1976 (submitted).Google Scholar
Recommendations
Finite Precision Rational Arithmetic: An Arithmetic Unit
The foundations of an arithmetic unit performing the add, subtract, multiply, and divide operations on rational operands are developed. The unit uses the classical Euclidean algorithm as one unified algorithm for all the arithmetic operations, including ...
A Discrete Logarithm Number System for Integer Arithmetic Modulo 2^{k}: Algorithms and Lookup Structures
We present a k-bit encoding of the k-bit binary integers based on a discrete logarithm representation. The representation supports a discrete logarithm number system (DLS) that allows integer multiplication to be reduced to addition and integer ...
Comments