Systolic VLSI Arrays for Polynomial GCD Computation

DOI10.1109/TC.1984.5009358zbMath0542.94043WikidataQ56939199 ScholiaQ56939199MaRDI QIDQ3331163

Richard P. Brent, H. T. Kung

Publication date: 1984

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

algorithmssystolic arraysgreatest common divisorpolynomialsdecoder implementationspecial-purpose hardware

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Circuits, networks (94C99) Polynomials over finite fields (11T06) Decoding (94B35) Algorithms in computer science (68W99)

Related Items (6)

A systolic algorithm for extended GCD computation ⋮ RSA and Elliptic Curve Least Significant Bit Security ⋮ An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form ⋮ A fast algorithm to compute irreducible and primitive polynomials in finite fields ⋮ HECC Goes Embedded: An Area-Efficient Implementation of HECC ⋮ Two new decoding algorithms for Reed-Solomon codes

This page was built for publication: Systolic VLSI Arrays for Polynomial GCD Computation