We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery’s method adapted to residue arithmetic. By choosing the moduli of the RNS system reasonably large, an effect corresponding to a redundant high-radix implementation is achieved, due to the carry-free nature of residue arithmetic. The actual computation in the multiplication takes place in co...

The residue number system (RNS) is a carry-free number system which can support high-speed and parallel arithmetic. One of the major issues in efficient design of RNS systems is the residue to weighted conversion. In this paper, we present an efficient design of residue to weighted converter for the newly introduced moduli set {3–2, 3–1, 3}, based on mixed-radix conversion (MRC) algorithm. The ...

Residue Number System (RNS) is a modular representation and is proved to be an instrumental tool in many digital signal processing (DSP) applications which require high-speed computations. RNS is an integer and non weighted number system; it can support parallel, carry-free, high-speed and low power arithmetic. A very interesting correspondence exists between the concepts of Multiple Valued Log...

Residue Number System (RNS) is a modular representation and is proved to be an instrumental tool in many digital signal processing (DSP) applications which require high-speed computations. RNS is an integer and non weighted number system; it can support parallel, carry-free, high-speed and low power arithmetic. A very interesting correspondence exists between the concepts of Multiple Valued Log...

A b s t r a c t This letter discusses simple techniques for the implementation of fault detection in Residue Number System (RNS) arithmetic modules used in systolic arrays. The technique centres around a recently introduced linear systolic structure[1], and does not require a redundant residue system[2] for the detection process. It is shown that this structure can be used as the detection proc...

We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery's method adapted to residue arithmetic. By choosing the moduli of the RNS system reasonably large, an eeect corresponding to a redundant high-radix implementation is achieved, due to the carry-free nature of residue arithmetic. The actual computation in the multiplication takes place in con...

The residue number system (RNS) is popular in high performance computation applications because of its carry-free nature. The challenges of RNS systems design lie in the moduli set selection and in the reverse conversion from residue representation to weighted representation. In this paper, we proposed a fully parallel reverse conversion algorithm for the moduli set {r – 2, r – 1, r}, based on ...

In this paper, a novel scheme for detecting overflow in Residue Number System (RNS) is presented. A generalized scheme for RNS overflow detection is introduced, followed by a simplified Operands Examination Method for overflow detection for the moduli set . The proposed method detects overflow in RNS addition of two numbers without pre-computing their sum .Moreover, when compared with the best ...

Novel very large-scale integration architectures and a design methodology for adder-based residue number system (RNS) processors are presented in this paper. The new architectures compute residues for more than one modulus either serially or in parallel, while their use can increase the resource utilization in a processor. Complexity is reduced by sharing common intermediate results among the v...

Modular multiplication is the most important part of public key cryptography algorithm like RSA and elliptic curve cryptography. Residue Number System is an efficient way to speed up these applications because of its carry free nature. Efficiency of modular multiplication in RNS is depending on effective selection of RNS bases. In this work efficient design of RNS bases are reported where compa...