Area-Delay-Efficeint FPGA Design of 32-bit Euclid's GCD based on Sum of Absolute Difference. (arXiv:2107.02762v2 [cs.AR] UPDATED)

Euclids algorithm is widely used in calculating of GCD (Greatest Common
Divisor) of two positive numbers. There are various fields where this division
is used such as channel coding, cryptography, and error correction codes. This
makes the GCD a fundamental algorithm in number theory, so a number of methods
have been discovered to efficiently compute it. The main contribution of this
paper is to investigate a method that computes the GCD of two 32-bit numbers
based on Euclidean algorithm which …

absolute design fpga