Abstract
The residue number system (RNS) has computational advantages for large integer arithmetic because of its parallel, carry free, and high-speed arithmetic nature. However, overflow detection, sign detection, relative-magnitude detection, and division are highly time-consuming operations in RNS. Among them, the most interesting one is division because it can apply to modular arithmetic. To speed up the operation, Hiasat and Abdel-Aty-Zohdy proposed a high-speed division algorithm for RNS in 1997. Hiasat and Abdel-Aty-Zohdy's algorithm computes a temporal quotient according to the highest power of 2 in the dividend and the divisor. Nevertheless, the temporal quotient is underestimated such that the algorithm has redundant execution rounds. In this article, we improve Hiasat and Abdel-Aty-Zohdy's division algorithm by using parity checking. Our improvement can reduce the number of execution rounds by 50%. cychen@isu.edu.tw E-mail: jenho@cs.ccu.edu.tw
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.
