In this paper, a new class of Hierarchical Residue Number Systems (HRNSs) is proposed, where the numbers are represented as a set of residues modulo factors of 2k š 1 and modulo 2k. The converters between the proposed HRNS and the positional binary number system can be built as 2-level structures using efficient circuits designed for the RNS (2k - 1, 2k, 2k +1). This approach allows using many small moduli in arithmetic channels without large conversion overhead. The advantages resulting from the use of the proposed HRNS depend on the possibility of factorisation of moduli [...]
A fast and accurate magnitude scaling technique in the residue number system (RNS) is proposed. This...
International audienceWe propose an hybrid representation of large integers , or prime field element...
This paper presents an investigation into using a combination of two alternative digital number repr...
This paper presents a new class of monotone functions that can be computed from the Residue Number S...
The residue number system (RNS), due to its properties, is used in applications in which high perfor...
In the residue number system, a set of moduli which are independent of each other is given. An integ...
Recent analyses demonstrate that operations in some bases of Residue Number System (RNS) exhibit hig...
International audienceA generalization of a new generic 4-modulus base for residue number systems (R...
This paper proposes an efficient scalable Residue Number System (RNS) architecture supporting moduli...
This paper presents fast hardware algorithms for channel operations in the Residue Number System (RN...
Although multiplication and addition can be very efficiently implemented in a Residue Number System ...
Residue Number System (RNS), which originates from the Chinese Remainder Theorem, offers a promising...
AbstractA multiplier-free residue to binary converter architecture based on the Chinese remainder th...
A scaling technique of numbers in residue arithmetic with the flexible selection of the scaling fact...
AbstractArithmetic units based on a Residue Number System (RNS) are fast and simple, and therefore a...
A fast and accurate magnitude scaling technique in the residue number system (RNS) is proposed. This...
International audienceWe propose an hybrid representation of large integers , or prime field element...
This paper presents an investigation into using a combination of two alternative digital number repr...
This paper presents a new class of monotone functions that can be computed from the Residue Number S...
The residue number system (RNS), due to its properties, is used in applications in which high perfor...
In the residue number system, a set of moduli which are independent of each other is given. An integ...
Recent analyses demonstrate that operations in some bases of Residue Number System (RNS) exhibit hig...
International audienceA generalization of a new generic 4-modulus base for residue number systems (R...
This paper proposes an efficient scalable Residue Number System (RNS) architecture supporting moduli...
This paper presents fast hardware algorithms for channel operations in the Residue Number System (RN...
Although multiplication and addition can be very efficiently implemented in a Residue Number System ...
Residue Number System (RNS), which originates from the Chinese Remainder Theorem, offers a promising...
AbstractA multiplier-free residue to binary converter architecture based on the Chinese remainder th...
A scaling technique of numbers in residue arithmetic with the flexible selection of the scaling fact...
AbstractArithmetic units based on a Residue Number System (RNS) are fast and simple, and therefore a...
A fast and accurate magnitude scaling technique in the residue number system (RNS) is proposed. This...
International audienceWe propose an hybrid representation of large integers , or prime field element...
This paper presents an investigation into using a combination of two alternative digital number repr...