=ADD=
=reftype=
14
=number=
99-47
=url=
ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1999/99-47.ps.gz
=year=
1999
=month=
12
=author=
Matasaru; Bogdan
=title=
An Extension of the Binary GCD Algorithm for Systolic Parallelization
=abstract=
We present a new algorithm that extends the binary algorithm, and computes
the GCD (greatest common divisor) and also the normal form of a rational
number, without using division. We present
also a systolic variant of this algorithm that works in a
least-significant-first manner and without global broadcasting.
=keywords=
normalization of rational numbers, systolic