By Topic

Low-complexity modified Mastrovito multipliers over finite fields GF(2M)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Leilei Song ; Dept. of Electr. & Comput. Eng., Minnesota Univ., Minneapolis, MN, USA ; K. K. Parhi

This paper considers the design of low-complexity dedicated finite field multipliers. A modified Mastrovito multiplication scheme is proposed in this paper, which has a complexity proportional to (m-1-pwt), where pwt is the Hamming weight of the underlying irreducible polynomial. With this modified multiplier and the original Mastrovito multiplier, low-complexity parallel multipliers for finite fields GF(2 M) can be designed with complexity proportional to min{pwt, m-1-pwt}, hence are good for irreducible polynomials of both low and high Hamming weights. This completes the design space and offers more freedom on polynomial selection. It is shown that this generalized Mastrovito multiplier generally has the lowest complexity, smallest latency and consumes the least power, compared with other standard-basis and dual-basis multipliers

Published in:

Circuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE International Symposium on  (Volume:1 )

Date of Conference:

Jul 1999