International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 185 - Issue 11 |
Published: May 2023 |
Authors: Mohammed I. Daabo |
![]() |
Mohammed I. Daabo . Residue-To-Decimal Conversion with Overflow Detection for a Moduli Set of the Form. International Journal of Computer Applications. 185, 11 (May 2023), 18-23. DOI=10.5120/ijca2023922782
@article{ 10.5120/ijca2023922782, author = { Mohammed I. Daabo }, title = { Residue-To-Decimal Conversion with Overflow Detection for a Moduli Set of the Form }, journal = { International Journal of Computer Applications }, year = { 2023 }, volume = { 185 }, number = { 11 }, pages = { 18-23 }, doi = { 10.5120/ijca2023922782 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2023 %A Mohammed I. Daabo %T Residue-To-Decimal Conversion with Overflow Detection for a Moduli Set of the Form%T %J International Journal of Computer Applications %V 185 %N 11 %P 18-23 %R 10.5120/ijca2023922782 %I Foundation of Computer Science (FCS), NY, USA
Reverse Conversion and Overflow Detection are some of the limiting factors that affect the full implementation of RNS-Based processors in general purpose computing. In this paper, a novel Reverse Converter with overflow detection scheme has been proposed. The Algorithm utilizes the Remainder Theorem and has the property that for any given moduli set { m_(1 ) 〖,m〗_(2 ) 〖,m〗_3 } , the residue number ( x_1 〖,x〗_2 〖,x〗_3 ) can be converted into their decimal equivalent X using m_1 α+x_1, |m_1 α+x_1 |_(m_2 )= x_2 and |m_1 α+x_1 |_(m_3 )= x_3 for α = 0, 1, 2, 3, …. The Algorithm detects overflow in RNS operations if m_1 α+x_1≥M. The Algorithm was fully implemented on both moduli sets with common factors and moduli sets with non-coprime factors. Theoretical analysis and simulated results showed that the architecture is built with lesser hardware and has low delay.