A New Fast and Area-Efficient Adder-Based Sign Detector for RNS { $2^{n}-1, 2^{n}, 2^{n}+1$ }

The moduli set {2n - 1, 2n, 2n + 1} has been widely used in residue number system (RNS)-based computations. Its sign extraction problem, albeit fundamentally important in magnitude comparison and other difficult algorithms in RNS, has received considerably less attention than its scaling and reverse conversion problems. This brief presents a new algorithm for the design of a fast adder-based sign detector. The circuit is greatly simplified by shrinking the dynamic range to eliminate large modulo operations with the help of the new Chinese remainder theorem. Our synthesis results with the 65-nm CMOS standard cell library show that the proposed design outperforms all the existing adder-based sign detectors reported for this moduli set in area and speed for n ranges from 5 to 25 in the step of 5.

[1]  Pepe Siy,et al.  Optimum RNS sign detection algorithm using MRC-II with special moduli set , 2008, J. Syst. Archit..

[2]  Richard Conway,et al.  Improved RNS FIR filter architectures , 2004, IEEE Transactions on Circuits and Systems II: Express Briefs.

[3]  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.

[4]  Chip-Hong Chang,et al.  Erratum to "Efficient VLSI Implementation of 2n Scaling of Signed Integer in RNS {2n-1, 2n, 2n+1}" , 2016, IEEE Trans. Very Large Scale Integr. Syst..

[5]  Yinan Kong,et al.  Fast sign-detection algorithm for residue number system moduli set {2 n - 1, 2 n , 2 n+1 - 1} , 2016, IET Comput. Digit. Tech..

[6]  G. Jullien,et al.  An improved residue-to-binary converter , 2000 .

[7]  Chip-Hong Chang,et al.  Simple, Fast, and Exact RNS Scaler for the Three-Moduli Set , 2011 .

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

[9]  Akhilesh Tyagi,et al.  A Reduced-Area Scheme for Carry-Select Adders , 1993, IEEE Trans. Computers.

[10]  Fei Luo,et al.  Low-Complexity Sign Detection Algorithm for RNS {2n-1, 2n, 2n+1} , 2012, IEICE Trans. Electron..

[11]  Luc Jaulmes,et al.  Fast modulo 2n−1 and 2n;1 adder using carry-chain on FPGA , 2013, 2013 Asilomar Conference on Signals, Systems and Computers.

[12]  Haridimos T. Vergos.  A Family of Area-Time Efficient Modulo 2n+1 Adders , 2010, 2010 IEEE Computer Society Annual Symposium on VLSI.

[13]  Paulo Martins,et al.  Efficient sign identification engines for integers represented in RNS extended 3-moduli set {2 n − 1, 2 n + k , 2 n + 1} , 2014 .

[14]  Yuke Wang.  New Chinese remainder theorems , 1998, Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284).

[15]  Richard I. Tanaka,et al.  Residue arithmetic and its applications to computer technology , 1967 .

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

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

[18]  Ping Yang,et al.  A Monte Carlo approach for power estimation , 1993, IEEE Trans. Very Large Scale Integr. Syst..

[19]  Haridimos T. Vergos,et al.  RNS assisted image filtering and edge detection , 2013, 2013 18th International Conference on Digital Signal Processing (DSP).

[20]  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.

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

[22]  Chip-Hong Chang,et al.  Area-efficient and fast sign detection for four-moduli set RNS {2n −1,2n, 2n +1,22n +1} , 2014, 2014 IEEE International Symposium on Circuits and Systems (ISCAS).

[23]  Chip-Hong Chang,et al.  Area-Power Efficient Modulo 2n-1 and Modulo 2n+1 Multipliers for {2n-1, 2n, 2n+1} Based RNS , 2012, IEEE Trans. Circuits Syst. I Regul. Pap..

[24]  Giorgos Dimitrakopoulos,et al.  On Modulo 2^n+1 Adder Design , 2012, IEEE Transactions on Computers.

[25]  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.

[26]  Ruohe Yao,et al.  Fast Sign Detection Algorithm for the RNS Moduli Set $\{2^{n+1}-1, 2^{n}-1, 2^{n}\}$ , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[27]  Thibault Hilaire,et al.  ρ-Direct Form transposed and Residue Number Systems for Filter implementations , 2011, 2011 IEEE 54th International Midwest Symposium on Circuits and Systems (MWSCAS).