Residue number systems (RNSs) and arithmetic are useful for several reasons. First, a great
deal of computing now takes place in embedded processors, such as those found in mobile …

In this paper, we introduce two new 4-moduli sets {2 n-1, 2 n, 2 n+ 1, 2 2n+ 1-1} and {2 n-1, 2
n+ 1, 2 2n, 2 2n+ 1} for developing efficient large dynamic range (DR) residue number …

This paper presents two new design methodologies for modulo 2/sup n/+ 1 addition in the
diminished-one number system. The first design methodology leads to carry look-ahead …

The residue number system (RNS) has been an important research field in computer
arithmetic for many decades, mainly because of its carry-free nature, which can provide high …

Modulo 2/sup n/+ 1 adders find great applicability in several applications including RNS
implementations and cryptography. In this paper, we present two novel architectures for …

Two architectures for modulo 2 n+ 1 adders are introduced in this paper. The first one is built
around a sparse carry computation unit that computes only some of the carries of the modulo …

Modulo multiplier has been attracting considerable attention as one of the essential
components of residue number system (RNS)-based computational circuits. This paper …

The Chinese remainder theorem (CRT) and mixed-radix conversion (MRC) are two classic
theorems used to convert a residue number to its binary correspondence for a given moduli …

The Residue Number System (RNS) is a representation system which provides fast and
parallel arithmetic. It has a wide application in digital signal processing and provides …

Novel modulo 2 n-1 addition algorithms for residue number system (RNS) applications are
presented. The proposed algorithms depart from the traditional approach of modulo 2 n-1 …