A redundant binary Euclidean GCD algorithm

An efficient implementation of the Euclidean GCD (greatest common divisor) algorithm employing the redundant binary number system is described. The time complexity is O(n), utilizing O(n)4-2 signed 1-b adders to determine the GCD of two n-b integers. The process is similar to that used in SRT divisi...

Full description

Saved in:
Bibliographic Details
Published in:Computer Arithmetic 1991 IEEE Symposium On pp. 220 - 225
Main Authors: Parikh, S.N., Matula, D.W.
Format: Conference Proceeding
Language:English
Published: IEEE Comput. Soc. Press 1991
Subjects:
Hardware
Monitoring
Sections
Table lookup
ISBN:0818691514, 9780818691515
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An efficient implementation of the Euclidean GCD (greatest common divisor) algorithm employing the redundant binary number system is described. The time complexity is O(n), utilizing O(n)4-2 signed 1-b adders to determine the GCD of two n-b integers. The process is similar to that used in SRT division. The efficiency of the algorithm is competitive, to within a small factor, with floating point division in terms of the number of shift and add/subtract operations. The novelty of the algorithm is based on properties derived from the proposed scheme of normalization of signed bit fractions. The implementation is well suited for systolic hardware design.< >
ISBN:0818691514
9780818691515
DOI:10.1109/ARITH.1991.145563