The Community for Technology Leaders
RSS Icon
Issue No.08 - August (1984 vol.33)
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.
Richard P. Brent, H. T. Kung, "Systolic VLSI Arrays for Polynomial GCD Computation", IEEE Transactions on Computers, vol.33, no. 8, pp. 731-736, August 1984, doi:10.1109/TC.1984.5009358
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool