A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
A redundant binary Euclidean GCD algorithm
[1991] Proceedings 10th IEEE Symposium on Computer Arithmetic
Preserved Fulltext
A n efficient implementation of the Euclidean gcd algorithm employing the redundant binary number system is described. The time complexity is O(n) utilizing O(n) 4-2 signed 1-bit adders to determine the gcd of two n-bit integers. The process is similar to that employed in SRT division. The efficiency of the algorithm is competitive, t o within a small factor, with floating point division an terms of the number of shifi and add/subtract operations. The novelty of our algorithm is based on
doi:10.1109/arith.1991.145563
dblp:conf/arith/ParikhM91
fatcat:7ghogf3zqnh4hjmzof3wudjvgq