Systolic VLSI Arrays for Polynomial GCD Computation
From MaRDI portal
Publication:3331163
DOI10.1109/TC.1984.5009358zbMath0542.94043WikidataQ56939199 ScholiaQ56939199MaRDI QIDQ3331163
Publication date: 1984
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
algorithms; systolic arrays; greatest common divisor; polynomials; decoder implementation; special-purpose hardware
68W30: Symbolic computation and algebraic computation
94C99: Circuits, networks
11T06: Polynomials over finite fields
94B35: Decoding
68W99: Algorithms in computer science
Related Items
A fast algorithm to compute irreducible and primitive polynomials in finite fields, 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, HECC Goes Embedded: An Area-Efficient Implementation of HECC