Design of Reverse Converters for the New RNS Moduli Set {2(n)+1, 2(n)-1, 2(n), 2(n-1)+1} (n odd)

作者：Patronik Piotr^*; Piestrak Stanislaw J

来源：IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2014, 61(12): 3436-3449.

DOI：10.1109/TCSI.2014.2337237

• Application-specific integrated circuit (ASIC)
• Chinese remainder theorem (CRT)
• computer arithmetic
• digital signal processing (DSP)
• residue arithmetic
• residue number system (RNS)
• residue-to-binary converter
• reverse converter

This paper considers a new balanced residue number system (RNS) composed of four low-cost moduli {2(n) + 1, 2(n) - 1, 2(n), 2(n-1) + 1} for odd. It is complementary to similar already known balanced 4-moduli set {2(n) + 1, 2(n) - 1, 2(n), 2(n+1) + 1} (odd), because it fills the gap in the sparse 8-bit resolution of dynamic ranges available for this class of 4-moduli RNSs. The first ever design methods of residue-to-binary (reverse) converters for this new RNS are proposed. Three versions of the converter, differing in the composition of calculations and hence resulting in different critical delays and energy consumption, are considered. Synthesis results obtained for the 65 nm technology for the dynamic ranges from 11 to 83 bits suggest that delay, power consumption, and area of the new converters are significantly improved w.r.t. the state-of-the-art converters for the above mentioned 4-moduli set and are comparable to those offered by the converters for two other balanced 4-moduli sets {2(n) + 1, 2(n) - 1, 2(n), 2(n +/- 1) + 1} (even).

• 出版日期2014-12