شماره ركورد كنفرانس :
3926
عنوان مقاله :
A New Comparison Algorithm for General 4-Moduli Set RNS
پديدآورندگان :
Ejlali Tara taraejlali@gmail.com Faculty of Electrical Engineering, Shahid Beheshti University Tehran,Iran , Eshghi Mohammad m-eshghi@sbu.ac.ir Faculty of Electrical Engineering, Shahid Beheshti University Tehran,Iran
تعداد صفحه :
4
كليدواژه :
Chinese reminder theorem (CRT) , comparison , modulo decomposition , residue number system (RNS)
سال انتشار :
1395
عنوان كنفرانس :
بيست و چهارمين كنفرانس مهندسي برق ايران
زبان مدرك :
انگليسي
چكيده فارسي :
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. Th is algorithm neither assumes special conditions on the moduli set nor needs redundant modulus.
كشور :
ايران
لينک به اين مدرک :
بازگشت