Systolic VLSI Arrays for Polynomial GCD Computation
Copyright policy )Systolic VLSI Arrays for Polynomial GCD Computation
Summary: 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 efficient VLSI solutions to both the GCD problem and the extended GCD problem.
- Australian National University Australia
- Carnegie Mellon University United States
greatest common divisor, polynomials, Decoding, systolic arrays, special-purpose hardware, Symbolic computation and algebraic computation, algorithms, Circuits, networks, Algorithms in computer science, decoder implementation, Polynomials over finite fields
greatest common divisor, polynomials, Decoding, systolic arrays, special-purpose hardware, Symbolic computation and algebraic computation, algorithms, Circuits, networks, Algorithms in computer science, decoder implementation, Polynomials over finite fields
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).72 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!