題名: An Improvement of the High-Speed Division Algorithm for Residue Number System
作者: Jen-Ho Yang( 楊仁和 ) ;Chien-Yuan Chen( 陳建源 ) ;Chih-Hung Wang( 王智弘 ) 貢獻者: Department of Information Engineering, I-Shou University
關鍵詞: Residue Number System;Parallel and Carry-free Arithmetic;Division 日期: 2002-05-16
上傳時間: 2009-12-08T07:38:25Z 出版者: 亞洲大學
摘要: Residue Number System (RNS) has computational advantages for very large integer arithmetic because of its nature of parallel, carry free, and high-speed arithmetic. However, overflow detection, sign
detection,relative-magnitude detection, and division in RNS are very difficult problems. In 1995, Hiasat and Zohdy proposed a high-speed division algorithm for RNS. Their algorithm computes the temporal quotient according to the highest powers in dividend and divisor.
However, the temporal quotient is underestimated. In this paper, we improve Hiasat and Zohdy’s division algorithm in RNS by additionally dealing with the highest two bits of dividend and divisor. Our
improvement reduces the number of execution rounds by 25%.