Journal
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
Volume E92D, Issue 9, Pages 1628-1638Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
DOI: 10.1587/transinf.E92.D.1628
Keywords
residue to binary converter; mixed-radix conversion (MRC); residue number system (RNS); computer arithmetic
Ask authors/readers for more resources
In this paper, the new residue number system (RNS) moduli sets {2(2n), 2(n) - 1, 2(n+1) - 1} and {2(2n), 2(n) - 1, 2(n-1) - 1} are introduced. These moduli sets have 4n-bit dynamic range and well-formed moduli which can result in high-performance residue to binary converters as well as efficient RNS arithmetic unit. Next, efficient residue to binary converters for the proposed moduli sets based on mixed-radix conversion (MRC) algorithm are presented. The converters are ROM-free and they are realized using carry-save adders and modulo adders. Comparison with the other residue to binary converters for 4n-bit dynamic range moduli sets shown that the presented designs based on new moduli sets {2(2n), 2(n) - 1, 2(n+1) - 1} and {2(2n), 2(n) - 1, 2(n-1) - 1} are improved the conversion delay and result in hardware savings. Also, the proposed moduli sets can lead to efficient binary to residue converters, and they can speed-up internal RNS arithmetic processing, compared with the other 4n-bit dynamic range moduli sets.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available