Measuring 3- and 4-Moduli Sets Delay Per Bit in Residue Number System: A Survey.

Saved in:
Bibliographic Details
Title: Measuring 3- and 4-Moduli Sets Delay Per Bit in Residue Number System: A Survey.
Authors: Torabi, Z.1 (AUTHOR) z.torabi@sru.ac.ir, Barzegaran, V.1 (AUTHOR) vidi@aut.ac.ir
Source: IETE Journal of Research. Apr2024, Vol. 70 Issue 4, p3795-3803. 9p.
Subjects: Computer arithmetic, Literature
Abstract: Given the efficiency of the residue number system in high-speed and low-power applications, a wide variety of moduli sets have been introduced in the literature. Selecting an appropriate moduli set is one of the most important issues of using a residue number system. Moduli sets can be evaluated by several factors such as dynamic range, balanced channels, fast and low-power modular operations, and efficient reverse converter. In this paper, 3- and 4-moduli sets are separately reviewed and compared from a different perspective. Furthermore, the most efficient 3- and 4-moduli sets are suggested. A new parameter for average delay comparison is introduced, which shows the delay of every bit in the dynamic range providing a fair comparison of moduli sets with different numbers of moduli. Our comparison showed that either balanced channels or the delay of computations are essential factors for designing an efficient new moduli set. [ABSTRACT FROM AUTHOR]
Copyright of IETE Journal of Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
Be the first to leave a comment!
You must be logged in first