Overflow Detection in Residue Number System, Moduli Set {2n-1,2n,2n+1}

Authors

Abstract:

Residue Number System (RNS) is a non-weighted number system for integer number arithmetic, which is based on the residues of a number to a certain set of numbers called module set. The main characteristics and advantage of residue number system is reducing carry propagation in calculations. The elimination of carry propagation leads to the possibility of maximizing parallel processing and reducing the delay. Residue number system is mostly fitted for calculations involving addition and multiplication. But some calculations and operations such as division, comparison between numbers, sign determination and overflow detection is complicated. In this paper a method for overflow detection is proposed for the special moduli set {2n-1,2n,2n+1} . This moduli set is favorable because of the ease of calculations in forward and reverse conversions. The proposed method is based on grouping the dynamic range into groups by using the New Chinese Theorem and exploiting the properties of residue differences. Each operand of addition is mapped into a group, then the sum of these groups is compared with the indicator and the overflow is detected. The proposed method can detect overflow with less delay comparing to previous methods.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

overflow detection in residue number system, moduli set {2n-1,2n,2n+1}

residue number system (rns) is a non-weighted number system for integer number arithmetic, which is based on the residues of a number to a certain set of numbers called module set. the main characteristics and advantage of residue number system is reducing carry propagation in calculations. the elimination of carry propagation leads to the possibility of maximizing parallel processing and reduc...

full text

Residue-to-binary arithmetic converter for moduli set {2n -1, 2n, 2n+1, 2n+1 -1}

This paper presents a new reverse converter architecture for the moduli set { 2 -1, 2, 2 +1, 2-1}. It exploits the special properties of the numbers of the form 1 2 ± , and extends the dynamic range of the present triple moduli based systems. Here we use a combination of CRT and MRC for reverse conversion. With a pipelined system the throughput rate is that of a single 3n+1 bit binary adder delay.

full text

Low Complexity Converter for the Moduli Set {2^n+1,2^n-1,2^n} in Two-Part Residue Number System

Residue Number System is a kind of numerical systems that uses the remainder of division in several different moduli. Conversion of a number to smaller ones and carrying out parallel calculations on these numbers will increase the speed of the arithmetic operations in this system. However, the main factor that affects performance of system is hardware complexity of reverse converter. Reverse co...

full text

A Residue to Binary Converter for the {2n + 2, 2n + 1, 2n} Moduli Set

In this paper, we investigate Residue Number System (RNS) to decimal conversion for a three moduli set with a common factor. We propose a new RNS to binary converter for the moduli set {2n + 2, 2n + 1, 2n} for any even integer n > 0. First, we demonstrate that for such a moduli set, the computation of the multiplicative inverses can be eliminated. Secondly, we simplify the Chinese Remainder The...

full text

Fast Sign Detection Algorithm for the RNS Moduli Set 2n+1-1, 2n-1, 2n

This brief presents a fast sign detection algorithm for the residue number system moduli set {2n+1 − 1, 2n − 1, 2n}. First, a sign detection algorithm for the restricted moduli set is described. The new algorithm allows for parallel implementation and consists exclusively of modulo 2n additions. Then, a sign detection unit for the moduli set {2n+1 − 1, 2n − 1, 2n} is proposed based on the new s...

full text

An Efficient FPGA Design of Residue-to-Binary Converter for the Moduli Set 2n+1, 2n, 2n-1

In this paper, we propose a novel reverse converter for the moduli set {2n + 1, 2n, 2n − 1}. First, we simplify the Chinese Remainder Theorem in order to obtain a reverse converter that uses mod(2n−1) operations. Next, we present a low complexity implementation that does not require the explicit use of modulo operation in the conversion process and we prove that theoretically speaking it outper...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 2  issue 1

pages  9- 16

publication date 2016-02-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023