More efficient systolic arrays for multiplication in GF\((2^m)\) using LSB first algorithm with irreducible polynomials and trinomials (Q1013353)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: More efficient systolic arrays for multiplication in GF\((2^m)\) using LSB first algorithm with irreducible polynomials and trinomials |
scientific article; zbMATH DE number 5544717
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | More efficient systolic arrays for multiplication in GF\((2^m)\) using LSB first algorithm with irreducible polynomials and trinomials |
scientific article; zbMATH DE number 5544717 |
Statements
More efficient systolic arrays for multiplication in GF\((2^m)\) using LSB first algorithm with irreducible polynomials and trinomials (English)
0 references
17 April 2009
0 references
systolic array
0 references
LSB first algorithm
0 references
finite field arithmetic
0 references
VLSI
0 references
trinomial
0 references
0.92347664
0 references
0.9048279
0 references
0 references
0.8758645
0 references
0.86138755
0 references
0 references
0.85577476
0 references
