Fast and Power Efficient Signed/Unsigned RNS Comparator & Sign Detector
سال انتشار: 1402
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 216
فایل این مقاله در 10 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JECEI-11-1_004
تاریخ نمایه سازی: 7 آبان 1401
چکیده مقاله:
kground and Objectives: Residue number system (RNS) is considered as a prominent candidate for high-speed arithmetic applications due to its limited carry propagation, fault tolerance, and parallelism in “Addition”, “Subtraction”, and “Multiplication” operations. Whereas, “Comparison”, “Division”, “Scaling”, “Overflow Detection” and “Sign Detection” are considered as complicated operations in residue number systems, which have also received a surge of attention in a multitude of publications. Efficient realization of Comparators facilitates other hard-to-implement operations and extends the spectrum of RNS applications. Such comparators can substitute the straightforward method (i.e. converting the comparison operands to binary and comparing them with wide word binary comparators) to compare RNS numbers. Methods: Dynamic Range Partitioning (DRP) method has shown advantages for comparing unsigned RNS numbers in the ۳-moduli sets {۲^n,۲^n±۱} and {۲^n,۲^n-〖۱,۲〗^(n+۱)-۱}, in comparison with other methods. In this paper, we employed DRP components and designed a unified unit that detects the sign of operands and also compares numbers, for the ۵-moduli set γ={۲^۲n,۲^n±۱,۲^n±۳}. This unit can be used for comparison of signed and also unsigned RNS numbers in the moduli set γ.Results: Synthesized comparison results reveal ۴۷% (۵۴%) speed-up, ۳۵% (۳۲%) less area consumption, ۲۵% (۲۴%) lower power dissipation, and ۶۰% (۶۵%) less energy for n=۸ (۱۶) in comparison to the straightforward signed comparator. Conclusion: According to the results of this study, DRP method for sign detection and comparison operations outperforms other methods in different moduli sets including ۵-moduli set γ={۲^۲n,۲^n±۱,۲^n±۳}.
کلیدواژه ها:
نویسندگان
Z. Torabi
Department of Computer Systems Architecture, Faculty of Computer Engineering, Shahid Rajaee Teacher Training University, Tehran, Iran.
Armin Belghadr
Department of Computer Science and Engineering, Shahid Beheshti University, Tehran, Iran.
مراجع و منابع این مقاله:
لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :