An RNS Comparator via Dynamic Range Partitioning: The Case of {2n-1, 2n, 2 n+1-1}

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Torabi Zeinab; Belghadr Armin

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING Year:2019 | Volume:16 | Issue:2 Page(s): 38-43

Download Full-Text

View:

135

Download:

140

Cites:

Information Journal Paper

Title

An RNS Comparator via Dynamic Range Partitioning: The Case of {2n-1, 2n, 2 n+1-1}

Author(s)

Torabi Zeinab | Belghadr Armin | Issue Writer Certificate

Keywords

Computer Arithmetic

Residue Number System

Difficult Operations

Dynamic Range Partitioning

Comparison

Abstract

It is common to speed-up addition, subtraction and multiplication via Residue Number Systems (RNS). The key advantage of the RNS is its limited carry propagation scheme, which is due to breaking down the long-word operations into a number of independent small-word parallel operations. Applications with repeated use of addition and multiplication have mostly benefited from RNS, while lack of efficient realizations for other operations does not allow for wider range of applications. Comparison, as a basic building block for other difficult RNS operations such as division, has been subject of numerous studies. Comparison via Dynamic Range Partitioning has been shown to be the most successful implementation for the 3-moduli set {2𝑛 , 2𝑛 ± 1}. In this paper, we proposed an efficient RNS comparator for the moduli set {2𝑛 − 1, 2𝑛 , 2𝑛 +1− 1} via Dynamic Range Partitioning technique. Synthesis results reveal 27. 5% delay, 64% area, 59. 7% power dissipation and 71% energy consumption reduction for the proposed design against straightforward comparator (i. e. reverse conversion followed by binary comparator).

Cites

No record.

References

No record.

Cite

APA: Copy

Torabi, Zeinab, & Belghadr, Armin. (2019). An RNS Comparator via Dynamic Range Partitioning: The Case of {2n-1, 2n, 2 n+1-1}. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, 16(2), 38-43. SID. https://sid.ir/paper/775828/en

Vancouver: Copy

Torabi Zeinab, Belghadr Armin. An RNS Comparator via Dynamic Range Partitioning: The Case of {2n-1, 2n, 2 n+1-1}. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING[Internet]. 2019;16(2):38-43. Available from: https://sid.ir/paper/775828/en

IEEE: Copy

Zeinab Torabi, and Armin Belghadr, “An RNS Comparator via Dynamic Range Partitioning: The Case of {2n-1, 2n, 2 n+1-1},” THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, vol. 16, no. 2, pp. 38–43, 2019, [Online]. Available: https://sid.ir/paper/775828/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops