Systolic VLSI Arrays for Polynomial GCD Computation

DOI10.1109/TC.1984.5009358MaRDI QIDQ3331163zbMATH OpenWikidataFDO

Authors Richard P. Brent, H. T. Kung

Publication date 1984

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

Full work available at URL https://doi.org/10.1109/TC.1984.5009358

zbMATH Keywords

algorithmsdecoder implementationgreatest common divisorpolynomialsspecial-purpose hardwaresystolic arrays

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4135405
• scientific article; zbMATH DE number 15442
• Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
• A systolic algorithm for extended GCD computation
• Circuits for computing the GCD of two polynomials over an algebraic number field

Cited in

(12)

• Polymorphic arrays: A novel VLSI layout for systolic computers
• A systolic algorithm for extended GCD computation
• Two new decoding algorithms for Reed-Solomon codes
• An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
• RSA and elliptic curve least significant bit security
• scientific article; zbMATH DE number 4135405 (Why is no real title available?)
• Functional–Based Synthesis of a Systolic Array for GCD Computation
• HECC Goes Embedded: An Area-Efficient Implementation of HECC
• scientific article; zbMATH DE number 15442 (Why is no real title available?)
• Polynomial multiplication on systolic arrays
• A fast algorithm to compute irreducible and primitive polynomials in finite fields
• A Mixed-Mode Polynomial Cellular Array Processor Hardware Realization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3331163)