论文信息 - Systolic VLSI Arrays for Polynomial GCD Computation

Systolic VLSI Arrays for Polynomial GCD Computation

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 | Richard P. Brent | R. Brent

[1] H. T. Kung,et al. Architecture of the PSC-a programmable systolic chip , 1983, ISCA '83.

[2] Franklin T. Luk,et al. Some Linear-Time Algorithms for Systolic Arrays , 2010, IFIP Congress.

[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[4] H. T. Kung,et al. Systolic Arrays for (VLSI). , 1978 .

[5] H. T. Kung. Special-purpose devices for signal and image processing : an opportunity in VLSI , 1980 .

[6] Yasunori Dohi,et al. Design of the PSC: a programmable systolic chip , 1983 .

[7] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[8] H. T. Kung. Why systolic architectures? , 1982, Computer.

[9] H. T. Kung. Use of VLSI in algebraic computation: Some suggestions , 1981, SYMSAC '81.

[10] David Y. Y. Yun,et al. Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants , 1980, J. Algorithms.