The Community for Technology Leaders
Green Image
Issue No. 08 - August (1984 vol. 33)
ISSN: 0018-9340
pp: 731-736
Richard P. Brent , Centre for Mathematical Analysis, The Australian National University, Canberra, Australia.
H. T. Kung , Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA 15213.
The problem of finding a greatest common divisor (GCD) of any two nonzero polynomials is fundamental to algebraic and symbolic computations, as well as to the decoder implementation for a variety of error-correcting codes. This paper describes new systolic arrays that can lead to efricient VLSI solutions to both the GCD problem and the extended GCD problem.

H. T. Kung and R. P. Brent, "Systolic VLSI Arrays for Polynomial GCD Computation," in IEEE Transactions on Computers, vol. 33, no. , pp. 731-736, 1984.
91 ms
(Ver 3.3 (11022016))