This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Systolic VLSI Arrays for Polynomial GCD Computation
August 1984 (vol. 33 no. 8)
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.
Citation:
Richard P. Brent, H. T. Kung, "Systolic VLSI Arrays for Polynomial GCD Computation," IEEE Transactions on Computers, vol. 33, no. 8, pp. 731-736, Aug. 1984, doi:10.1109/TC.1984.5009358
Usage of this product signifies your acceptance of the Terms of Use.