By Topic

A Multiplicative Inverse Algorithm Based on Modulo (2p - 1) Signed-Digit Arithmetic for Residue to Weighted Number Conversion

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

1 Author(s)
Shugang Wei ; Department of Computer Science, Gunma University, 1-5-1, Tenjin-cho, Kiryu Gunma 376-8515, Japan, Email: wei@cs.gunma-u.ac.jp

The multiplicative inverse numbers are needed for converting the numbers in a residue number system (RNS) into a weighted number. In this paper, a new hardware algorithm is presented by use of a radix-two signed-digit (SD) arithmetic for the multiplicative inverse calculation modulo mi = (2p-1), where mi is a modulus in the RNS. The calculation of an multiplicative inverse number can be implemented only by carry-free SD additions. An efficient serial residue-to-weighted number converter with the number inversion circuit is also proposed. By circuit design and simulation, the proposed converter using SD arithmetic has high speed performance compared to that based on binary arithmetic.

Published in:

2007 International Symposium on Integrated Circuits

Date of Conference:

26-28 Sept. 2007