Cart (Loading....) | Create Account
Close category search window
 

New low-complexity bit-parallel finite field multipliers using weakly dual bases

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
$31 $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

3 Author(s)
Huapeng Wu ; Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada ; Hasan, M.A. ; Blake, I.F.

New structures of bit-parallel weakly dual basis (WDB) multipliers over the binary ground field are proposed. An upper bound on the size complexity of bit-parallel multiplier using an arbitrary generating polynomial is given. When the generating polynomial is an irreducible trinomial xm+xk+1, 1⩽k⩽[m/2], the structure of the proposed bit-parallel multiplier requires only m2 two-input AND gates and at most m2-1 XOR gates. The time delay is no greater than TA+([log2 m]+2)Tx, where TA and TX are the time delays of an AND gate and an XOR gate, respectively

Published in:

Computers, IEEE Transactions on  (Volume:47 ,  Issue: 11 )

Date of Publication:

Nov 1998

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.