Area-efficient and fast sign detection for four-moduli set RNS {2n −1,2n, 2n +1,22n +1}

Sign detection is a necessary but non-trivial operation in Residue Number System (RNS) for many digital signal processing applications. Efficient sign detector for the three-moduli set RNS {2n -1,2n, 2n +1} has been proposed, but the problem remains unsolved for its extended four moduli sets. This paper presents a new sign detection algorithm dedicated to {2n -1,2n, 2n +1,22n +1} RNS that has a wider dynamic range and higher parallelism. Our approach exploits the number theoretic and multiplicative inverse properties in two-residue Chinese Remainder Theorem (CRT) and the New CRT II to halve the bit width of the modulo additions required by a complete reverse conversion. Our synthesis results show greater than 60% area reduction and more than 40% speedup for n = 2 to 5 compared with using its most efficient reverse converter for sign detection.

[1]  Yuke Wang.  Residue-to-binary converters based on new Chinese remainder theorems , 2000 .

[2]  Chip-Hong Chang,et al.  Efficient VLSI Implementation of $2^{{n}}$ Scaling of Signed Integer in RNS ${\{2^{n}-1, 2^{n},2^{n}+1\}}$ , 2013, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[3]  Chip-Hong Chang,et al.  Radix-8 Booth Encoded Modulo $2 ^{n} -1$ Multipliers With Adaptive Delay for High Dynamic Range Residue Number System , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.

[4]  Gian Carlo Cardarilli,et al.  Low-power adaptive filter based on RNS components , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[5]  Omid Kavehei,et al.  Efficient Reverse Converter Designs for the New 4-Moduli Sets $\{2^{n} -1, 2^{n}, 2^{n} +1, 2^{2n + 1}-1\}$ and $\{2^{n} -1, 2^{n} +1, 2^{2n}, 2^{2n} +1\}$ Based on New CRTs , 2010, IEEE Transactions on Circuits and Systems I: Regular Papers.

[6]  Victor Y. Pan,et al.  Computing exact geometric predicates using modular arithmetic with single precision , 1997, SCG '97.

[7]  Tadeusz Tomczak,et al.  Fast Sign Detection for RNS $(2^{n}-1,2^{n},2^{n}+1)$ , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[8]  Yong Liu,et al.  Design and implementation of an RNS-based 2-D DWT processor , 2004, IEEE Transactions on Consumer Electronics.

[9]  Chip-Hong Chang,et al.  Simple, Fast, and Exact RNS Scaler for the Three-Moduli Set $\{2^{n} - 1, 2^{n}, 2^{n} + 1\}$ , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.

[10]  Thu V. Vu.  Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding , 1985, IEEE Trans. Computers.

[11]  Zenon D. Ulman,et al.  Sign Detection and Implicit-Explicit Conversion of Numbers in Residue Arithmetic , 1983, IEEE Transactions on Computers.

[12]  Chip-Hong Chang,et al.  An efficient reverse converter for the 4-moduli set {2/sup n/ - 1, 2/sup n/, 2/sup n/ + 1, 2/sup 2n/ + 1} based on the new Chinese remainder theorem , 2003 .

[13]  Giuseppe Alia,et al.  Sign detection in residue arithmetic units , 1998, J. Syst. Archit..