Novel radixmoduloarithmetic units for residue number system (RNS)-based architectures are introduced in this paper. The proposed circuits are shown to require several times less area than previously reported architectures for particular moduli of operation, while also being preferable in the area time complexity sense. The complexity reduction is achieved by extending the carry-ignore property ...

Moduli selection is one of the most important issues in the implementation of systems that make use of residue number systems. In this paper, we describe a software tool that assists system designers in moduli selection for the design of RNS-based FIR filters and filter banks. According to some filter specification parameters, the software tool constructs valid moduli sets and calculates their ...

In applications, such as high quality audio, that need more than 16 bits of precision, the processing of signals on a 16-bit DSP requires double precision computation and is hence time consuming. Since in Residue Number System (RNS), the high precision data is decomposed to lower precision for its processing, in this paper, we propose RNS for increasing the performance of such applications impl...

In this paper, we investigate Residue Number System (RNS) to decimal conversion which is an important issue concerning the utilization of RNS numbers in Digital Signal Processing (DSP) applications. We propose a reverse converter using the moduli set {2n+1, 2n, 2n−1}. First, we show that this converter does not require the computation of multiplicative inverses. Next, we simplify the Chinese Re...

In this brief, a read-only-memoryless structure for binaryto-residue number system (RNS) conversion modulo {2n±k} is proposed. This structure is based only on adders and constant multipliers. This brief is motivated by the existing {2n ± k} binary-to-RNS converters, which are particular inefficient for larger values of n. The experimental results obtained for 4n and 8n bits of dynamic range sug...

Residue Number Systems (RNS) are proven to be effective in speeding up computations involving additions and products. For these representations, there exists efficient modular reduction algorithms that can used the context of arithmetic over finite fields or modulo large numbers, especially when cryptographic engineering. Their independence allows random draws bases, which also makes it possibl...

Modular arithmetic operations l ike inversion, multiplication and exponentiation are used in several cryptography applications. A special modulo set of forms {21,2,2+1}are preferred over the generic modulo due to the ease of hardware implementation of modulo arithmetic functions as well as systemlevel intermodulo operations, such as RNS-to-binary conversion and sign detections. Key sizes in the...

A new high-speed residue-to-binary converter for five bit moduli based on the Chinese Remainder Theorem is presented. The orthogonal projections are computed by mapping using five-variable logic functions. The sum of projections is calculated using the Wallace tree. The output carry-save representation is partitioned into four segments in such a way that the sum of the numbers represented by th...