Systematic design approach of Mastrovito multipliers over GF(2m)

Tong Zhang, Keshab K. Parhi

Research output: Contribution to journalConference articlepeer-review

5 Scopus citations

Abstract

This paper considers the design of low-complexity bit-parallel dedicated finite field multiplier. A systematic design approach of Mastrovito multiplier is proposed, which is applicable to GF(2m) generated by an arbitrary irreducible polynomial. This approach extensively exploits the spatial correlation of matrix elements in Mastrovito multiplication to reduce the complexity. The developed general Mastrovito multiplier is highly modular, which is desirable for VLSI hardware implementation. Meanwhile, the presented approach can be used to develop efficient Mastrovito multipliers for several special irreducible polynomials, such as trinomial and equally-spaced-polynomial, and further find some other special irreducible polynomials which can also lead to low-complexity multipliers.

Original languageEnglish (US)
Pages (from-to)507-516
Number of pages10
JournalIEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation
StatePublished - 2000
Event2000 IEEE Workshop on Signal Processing Systems (SIPS 2000) - Lafayette, LA, USA
Duration: Oct 11 2000Oct 13 2000

Fingerprint

Dive into the research topics of 'Systematic design approach of Mastrovito multipliers over GF(2<sup>m</sup>)'. Together they form a unique fingerprint.

Cite this