Research Paper on SIGN DETECTION AND SIGNED INTEGER COMPARISON FOR THE THREE-MODULI SET {2n ±1, 2n+k}

Description

Title: SIGN DETECTION AND SIGNED INTEGER COMPARISON FOR THE THREE-MODULI SET {2n ±1, 2n+k}

Abstract: In a residue number system, comparison, division, and sign detection are regarded as difficult operations (RNS). Converting RNS numbers to binary formats and then carrying out complex operations using standard binary operators is an easy solution. The application of RNS can be expanded to cases involving these operations if effective circuits are provided for comparison, division, and sign detection. In the three-moduli set τ = {2n−1, 2n+k, 2n+1}, (0 ≤ k ≤ n), we have only found one hardware realization for RNS comparison. This paper proposes an efficient RNS comparator for moduli set that uses a sign-detection method and performs better than its competitors. Dynamic range partitioning (DRP), which was just recently presented for unsigned RNS comparison, is used by the proposed sign detector and comparator. The proposed comparator’s delay and cost are less than those of the earlier works, making it suitable for RNS applications with minimal delay and expense.

Keywords: computer arithmetic, residue number system, signed integer comparison, dynamic range partitioning

Paper Quality: SCOPUS / Web of Science Level Research Paper

Paper type: Analysis Based Research Paper

Subject: Computer Science

Writer Experience: 20+ Years

Plagiarism Report: Turnitin Plagiarism Report will be less than 10%

Restriction: Only one author may purchase a single paper. The paper will then indicate that it is out of stock.

What will I get after the purchase?

A turnitin plagiarism report of less than 10% in a pdf file and a full research paper in a word document.

In case you have any questions related to this research paper, please feel free to call/ WhatsApp on +919726999915