By Topic

Number Conversions between RNS and Mixed-Radix Number System Based on Modulo (2p - 1) Signed-Digit Arithmetic

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 Scicence, Gunma University, 1-5-1, Tenjin-cho, Kiryu, Gunma, Japan.

In this paper, new hardware algorithms converting the numbers of a residue number system (RNS) into and from the mixed-radix number system(MRNS) using a radix-two signed-digit (SD) arithmetic circuits are presented. In each residue digit of the RNS integers mi = (2 p i - 1) are used as the moduli and the modulo m i addition and multiplication can be performed by an end-around-carry SD adder and a binary modulo mi SD adder tree, respectively. Therefore, the modulo mi addition time is independent of the word length of operands, and the modulo mi multiplication can be performed in a time proportional to log2 pi. An efficient method for calculating a multiplicative inverse number of a modulus is also presented by using the SD arithmetic. By the use of the fast SD arithmetic circuits, number converters of RNS-to-MRNS and MRNS-to-RNS can be implemented with shorter delay time than that using a binary number system

Published in:

2005 18th Symposium on Integrated Circuits and Systems Design

Date of Conference:

4-7 Sept. 2005