By Topic

New efficient structure for a modular multiplier for RNS

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

1 Author(s)
Hiasat, A.A. ; Electr. Eng. Dept., Princess Sumaya Univ., Amman, Jordan

Modular multiplication is a very important arithmetic operation in residue-based real-time computing systems. In realizing these multipliers, ROM-based structures are more efficient for small moduli. Due to the exponential growth of ROM sizes, implementations with arithmetic components are more suitable for medium and large moduli. This paper presents a new modular multiplier that can deal efficiently with medium and large size moduli. The design of this modular multiplier that multiplies two n bit residue digits consists, basically, of a (n×n) binary multiplier, a ((n-1-k)×k) binary multiplier (k<n), three n-bit adders, and a small-size combinational circuit. When compared with the most competitive published work, the new multiplier reduces, significantly, both time delay and hardware requirements. The design is very suitable for VLSI realization

Published in:

Computers, IEEE Transactions on  (Volume:49 ,  Issue: 2 )