Menouer Diab, Alain Poli
Abstract
A bit-serial systolic architecture is presented for the product-sum computation P = AB + C in a finite field GF(2m) = GF(2)[x]/[F(x)], such that F(x) = xm + x + 1 is an irreducible trinomial over GF(2). It has a low complexity and does not require connections for the serial transfer of F(x).
OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A bit-serial systolic architecture is presented for the product-sum computation P = AB + C in a finite field GF(2m) = GF(2)[x]/[F(x)], such that F(x) = xm + x + 1 is an irreducible trinomial over GF(2). It has a low complexity and does not require connections for the serial transfer of F(x).
Key concepts: Trinomial, GF(2), Finite field, Mathematics, Multiplier (economics), Arithmetic, Computation, Discrete mathematics