Description
Title: A MINIMALLY REDUNDANT RESIDUE NUMBER SYSTEM WITH EFFICIENT IMPLEMENTATION OF THE CHINESE REMAINDER THEOREM
Abstract: There are numerous contemporary computer applications that make use of the Chinese remainder theorem. The rank of a number, a primary positional characteristic used in the residue number system, is calculated effectively in this paper. Comparing the proposed approach to a straightforward application of the Chinese remainder theorem algorithm, the latter does not involve large modulo addition operations. A number’s rank is determined by adding its approximate rank to a two-valued correction factor that can only take on the values 0 or 1. We suggest a residue number system with the least amount of redundancy possible, which reduces the computational difficulty of calculating rank. Analysis of the novel method’s effectiveness in comparison to a traditional, non-redundant residue number system. By including the additional residue modulo 2, the rank calculation’s complexity decreases from O(k2) to O(k) as a result of the residue code extension (where k equals the number of non-redundant residues).
Keywords: residue number system, Chinese remainder theorem, residue code, rank of a number, positional characteristics
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
Reviews
There are no reviews yet.