Skip to search formSkip to main contentSkip to account menu

Binary GCD algorithm

Known as: Binary gcd, Stein's Algorithm, Knuth's algorithm B 
The binary GCD algorithm, also known as Stein's algorithm, is an algorithm that computes the greatest common divisor of two nonnegative integers… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Arbitrary-precision arithmeticArithmetic shiftComputational complexity of mathematical operationsEuclidean algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Multi-cache resizing via greedy coordinate descent
To reduce power consumption in CPUs, researchers have studied dynamic cache resizing. However, existing techniques only resize a… 
2005
2005
Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding
The binary GCD algorithm, discovered by Stein, is an alternative to the Euclidean algorithm for computing the greatest common… 
2004
2004
Binary GCD Like Algorithms for Some Complex Quadratic Rings
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of… 
2004
2004
Notes on the Binary GCD Algorithm
  • S. Cui
  • 2004
  • Corpus ID: 124614000
Luo et al wrote in a recent paper [A Fast Algorithm for Computing gcd Based on Binary Multi Precision,this journal,2002,Vol.32,No… 
2003
2003
An Analysis of the Generalized Binary GCD Algorithm
In this paper we analyze a slight modification of Jebelean’s version of the k-ary GCD algorithm. Jebelean had shown that on n-bit… 
2002
2002
An area-efficient systolic division circuit over GF(2/sup m/) for secure communication
We present a novel area-efficient parallel-in parallel-out systolic division circuit (v = a/b) over GF(2/sup m/) based on the… 
2002
2002
An Integrated Array Dependence Test Method Based on Banerjee-GCD and Banerjee-Bound Method
Dependence test is the most important part in a parallelizing compiler. There are many results on it: some are precise but slow… 
2001
2001
Systolic VLSI realization of a novel iterative division algorithm over GF(2/sup m/): a high-speed, low-complexity design
We present a parallel-in parallel-out systolic division circuit over GF(2/sup m/) based on the novel extended Stein's algorithm… 
2001
2001
An Algorithm for Division on Finite Fields Based on Stein's Algorithm
2000
2000
FPGA Implementation of an Extended Binary GCD Algorithm for Systolic Reduction of Rational Numbers
We present the FPGA implementation of an extension of the binary plus-minus systolic algorithm which computes the GCD (greatest… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)