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

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 { ,}. 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