Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding
IEEE Transactions on Computers
Computer arithmetic systems: algorithms, architecture and implementation
Computer arithmetic systems: algorithms, architecture and implementation
Fast base extension and precise scaling in RNS for look-up tableimplementations
IEEE Transactions on Signal Processing
Residue number system to binary converter for the moduli set (2n-1, 2n - 1, 2n + 1)
Journal of Systems Architecture: the EUROMICRO Journal
An arithmetic residue to binary conversion technique
Integration, the VLSI Journal
VLSI Implementation of new arithmetic residue to binary decoders
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
The Factor-2 Sign Detection Algorithm using a core function for RNS numbers
Computers & Mathematics with Applications
Core function of an RNS number with no ambiguity
Computers & Mathematics with Applications
| Hi-index | 14.98 |
This paper presents a new fast RNS converter for the 3 moduli set of the form $\{2^n-1,2^n,2^n+1\}$. A new property of the CRT is also presented and this property is used to developa fast converter for this $3$ moduli set. The resulting implementation is based on carry-save adders and one carry-propagate adder stage, without the need for any look-up tables. The new design is faster and smaller than existing designs.