Low-Complexity Sign Detection Algorithm for RNS {2n-1, 2n, 2n+1}
Authors:
- 1 January 2012
- journal article
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Electronics
- Vol. E95.C (9) , 1552-1556
Abstract
Based on a reverse converter algorithm derived from the New Chinese Remainder Theorem I, an algorithm for sign detection of RNS {2n-1, 2n, 2n+1} is presented in this paper. The hardware of proposed algorithm can be implemented using two n-bit additions and one (n+1)-bit comparator. Comparing with the previous paper, the proposed algorithm has reduced the number of additions used in the circuit. The experimental results show that the proposed circuit achieves 17.3% savings in area for small moduli and 10.5% savings in area for large moduli on an average, with almost the same speed. The power dissipations obtain 12.6% savings in average.Keywords
This publication has 5 references indexed in Scilit:
- Design methodologies of comparators based on parallel hardware algorithms2010
- Fast Sign Detection for RNS $(2^{n}-1,2^{n},2^{n}+1)$IEEE Transactions on Circuits and Systems I: Regular Papers, 2008
- Efficient VLSI implementation of modulo (2/sup n/±1) addition and multiplication2003
- Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue DecodingIEEE Transactions on Computers, 1985
- The Residue Number SystemIEEE Transactions on Electronic Computers, 1959