Fast sign-detection algorithm for residue number system moduli set {2(n)-1, 2(n), 2(n+1)-1}

作者：Niras Cheeckottu Vayalil^*; Kong Yinan

来源：IET Computers and Digital Techniques, 2016, 10(2): 54-58.

DOI：10.1049/iet-cdt.2015.0050

• residue number systems
• adders
• fast sign-detection algorithm
• residue number system moduli set {2(n)-1, 2(n), 2(n+1)-1}
• computer hardware designs
• New Chinese Remainder Theorem II
• n-bit carry-save adder
• 2n-bit parallel prefix carry-generation unit
• Synoposys synthesis
• area-delay product
• size 90 nm

Sign detection is an essential part of many computer hardware designs, and is not a trivial task in residue number systems because it is a function of all the residues. This study proposes an algorithm for the residue number system with a three-moduli set {2(n) - 1, 2(n), 2(n+1) - 1} using New Chinese Remainder Theorem II. The unit is built with one n-bit carry-save adder and a 2n-bit parallel prefix carry-generation unit. In the best case the Synoposys 90 nm synthesis result shows a 24% reduction in the area-delay product than existing algorithms for the same moduli set.

• 出版日期2016-3