One small step for a man
One Giant leap for the mankind

There is no wealth like Knowledge
                            No Poverty like Ignorance
Journal of Emerging Trends in Computing and Information Sciences Logo

Journal of Emerging Trends in Computing and Information Sciences >> Call for Papers Vol. 8 No. 3, March 2017

Journal of Emerging Trends in Computing and Information Sciences

An Over Flow Detection Scheme with a Reverse Converter for the Moduliset {(2n -1, 2n), 2n +1}

Full Text Pdf Pdf
Author M.I. Daabo, K.A. Gbolagade
ISSN 2079-8407
On Pages 931-935
Volume No. 5
Issue No. 12
Issue Date January 1, 2015
Publishing Date January 1, 2015
Keywords Residue Number System, Reverse Converter, Remainder Theorem, Overflow Detection, Group Number


The quest to make Residue Number System (RNS) based processors a reality, has made researchers to continue seeking solutions to some of the limiting factors of RNS based processor realization. Overflow detection and Reverse Conversion are some of the limiting factors in RNS implementation. In this paper, we propose an overflow detection scheme with a residue to binary converter for the moduli set {(2n -1, 2n), 2n +1}. Our proposal detects overflow for the sum of operands by distributing the numbers in the system dynamic range into groups. In the conversion segment, the proposal utilizes the Remainder Theorem (RT) in order to convert any RNS number into its decimal equivalent. Our scheme performs dual function, i.e., it detects overflow and does reverse conversion. Theoretical analysis shows that the proposed scheme performs reverse conversion and detects overflow faster than previously proposed schemes and requires lesser hardware resources.

    Journal of Computing | Call for Papers (CFP) | Journal Blog | Journal of Systems and Software | ARPN Journal of Science and Technology | International Journal of Health and Medical Sciences | International Journal of Economics, Finance and Management     
© 2015 Journal of Computing