Abstract
Residue Number System (RNS) has many applications in computer arithmetic because of its properties such as parallelism and modularity. Comparison is one of difficult operations in RNS and improving its algorithms has an important role in the use of this system for general purpose applications. In this paper a new algorithm for comparing two residue numbers in a general 4-moduli set is proposed. First, the CRT-II reverse conversion algorithm is improved using modulo decomposition and a weighted representation is obtained. Based on this approach, there is a unique weighted set to represent each number. With these weighted sets comparison is carried out similar to other weighted number systems. Comparing with previous algorithms the proposed design needs smaller modulo operations that reduce the delay. This algorithm neither assumes special conditions on the moduli set nor needs redundant modulus.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
