
New Algorithm for Reverse Conversion in Residue Number System
Author(s) -
Daniel K. Asiedu,
Salifu Abdul-Mumin
Publication year - 2021
Publication title -
asian journal of computer science and technology
Language(s) - English
Resource type - Journals
eISSN - 2583-7907
pISSN - 2249-0701
DOI - 10.51983/ajcst-2021.10.1.2693
Subject(s) - residue number system , chinese remainder theorem , algorithm , multiplicative inverse , multiplicative function , computer science , moduli , inverse , overhead (engineering) , mathematics , parallel computing , physics , mathematical analysis , geometry , quantum mechanics , operating system
Reverse conversion is an important exercise in achieving the properties of Residue Number System (RNS). Current algorithms available for reverse conversion exhibits greater computational overhead in terms of speed and area. In this paper, we have developed a new algorithm for reverse conversion for two-moduli set and three-moduli set that are very simple and with fewer multiplicative inverse operations than there are in the traditional algorithms like the Chinese Remainder Theorem (CRT) and Mixed Radix Conversion (MRC).