Abstract: A new parallelization of the extended Euclidean GCD algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O/sub eps/(n/log n) using ...

Finds 2 numbers a and b such that it satisfies the equation am + bn = gcd(m, n) (a.k.a Bezout's Identity) ...

This project implements both the Euclidean Algorithm to compute the Greatest Common Divisor (GCD) of two integers and the Extended Euclidean Algorithm, which finds integer coefficients for Bézout's ...

Abstract: A novel method to obtain a basis for all possible solutions for decoding Reed-Solomon (RS) codes is given, using an intermediate result of decoding obtained by the Extended Euclidean ...