| Popis: |
The residue numeral system (RNS) is one of the alternative number representation systems which has a strong potential for using it in computing systems. One of the known problems of the RNS is the complexity of the implementation of some basic arithmetic operations, including comparison and division operations. The paper considers the problem of implementing the comparator for the residue number system with one of the popular moduli set {2n-1, 2n, 2n+1}. Description of two existing methods and its properties are provided. After that, an experimental evaluation of the described methods using modern EDA tools and analysis of results are presented. |
