GitHub

A-Digital-Circuit-to-determine-GCD-of-two-numbers-using-Euclid-s-Algorithm

In this project, I have designed a Digital Circuit which calculates the Greatest Common Divisor (GCD) of two given numbers using Euclid's Algorithm. I have implemented the circuit using custom ...
GitHub

GCD_HW_SW_SystemC

Hardware/Software co-design of the Greatest Common Divisor (GCD) algorithm using SystemC. This project was developed as part of the Digital Systems Verification course (Universidad Nacional de ...
IEEE

Power, Performance, and Area Analysis of Hardware Design Techniques for GF(2 k) Greatest Common Divisor computation

Abstract: Computation of the greatest common divisor (GCD) for two non-zero polynomials plays a vital role in several applications including cryptography, error-correcting codes, linear systems, and ...
IEEE

A comparative study up to 1024 bit Euclid's GCD algorithm FPGA implementation and synthesizing

Abstract: In this paper, we are targeting Altera Cyclone IV FPGA family to design an efficient GCD (Greatest Common Divisor) coprocessor based on Euclid's method with variable datapath sizes. The ...