Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials

IEEE Transactions on Computers

Volumn 50, Issue 7, 2001, Pages 734-749

  Zhang, Tong ^a,b   Parhi, Keshab K ^a,b  

^a IEEE   (United States)

^b University of Minnesota   (United States)

Author keywords

Complexity; Finite (or Galois) field; Irreducible polynomials; Multiplication; Standard basis; Toeplitz matrix; VLSI architecture

Indexed keywords

FIELD MULTIPLIERS; IRREDUCIBLE POLYNOMIALS;

COMPUTATIONAL COMPLEXITY; CORRELATION METHODS; MATRIX ALGEBRA; POLYNOMIALS; VLSI CIRCUITS;

MULTIPLYING CIRCUITS;

EID: 0035392553     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.936239     Document Type: Article

References (17)

1. m)
2. Mastrovito multiplier for All trinomials
3. m)
4. m)
5. Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
6. Low-complexity bit-parallel multipliers for a class of finite fields
7. Mastrovito multiplier for general irreducible polynomials
8. Mastrovito multiplier for general irreducible polynomials
9. m)
10. m)