A systolic algorithm for integer GCD computationR. P. Brent, H. T. Rung1985 IEEE 7th Symposium on Computer Arithmeticâ€¦1985It is shown that the greatest common divisor of two n-bit integers (given in the usual binary representation) can be computed in time O(n) on a linear systolic array of O(n) identical cells.