International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 65 - Number 7 |
Year of Publication: 2013 |
Authors: Darshana Upadhyay, Harshit Patel |
10.5120/10937-5888 |
Darshana Upadhyay, Harshit Patel . Hardware Implementation of Greatest Common Divisor using subtractor in Euclid Algorithm. International Journal of Computer Applications. 65, 7 ( March 2013), 24-28. DOI=10.5120/10937-5888
This paper proposed an efficient implementation of digital circuit based on the Euclidean Algorithm with modular arithmetic to find Greatest Common Divisor (GCD) of two Binary Numbers given as input to the circuit. Output of the circuit is the GCD of the given inputs. In this paper subtraction-based narrative defined by Euclid is described, the remainder calculation replaced by repeated subtraction. The selection of the Division Method using subtractor is due to ease of implementation and less complexity in connection with reduced hardware. The circuit is built using basic digital electronic components like Multiplexers & comparator (A