Systolic VLSI Arrays for Polynomial GCD Computation
Richard P. Brent, H. T. Kung · IEEE Transactions on Computers · 1984
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.