Sign Detection and Number Comparison on RNS 3-Moduli Sets $\{2^n-1, 2^{n+x}, 2^n+1\}$ { 2 n - 1 , 2 n + x , 2 n + 1 }
- 18 June 2016
- journal article
- research article
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 36 (3) , 1224-1246
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- The CRNS framework and its application to programmable and reconfigurable cryptographyACM Transactions on Architecture and Code Optimization, 2013
- Fully parallel comparator for the moduli set {2n,2n-1,2n+1}IEICE Electronics Express, 2011
- A Low-Complexity High-Radix RNS MultiplierIEEE Transactions on Circuits and Systems I: Regular Papers, 2009
- The Mixed-Radix Chinese Remainder Theorem and Its Applications to Residue ComparisonIEEE Transactions on Computers, 2008
- Improving residue number system multiplication with more balanced moduli sets and enhanced modular arithmetic structuresIET Computers & Digital Techniques, 2007
- Low-power adaptive filter based on RNS components2007
- New Chinese remainder theorems2002
- Fast converter for 3 moduli RNS using new property of CRTIEEE Transactions on Computers, 1999
- A new technique for fast number comparison in the residue number systemIEEE Transactions on Computers, 1993
- An efficient residue to binary converter designIEEE Transactions on Circuits and Systems, 1988