Fast Overflow Detection in Moduli Set {2 n - 1, 2 n , 2 n + 1}
Mehrin Rouhifar, Mehdi Hosseinzadeh, Saeid Bahanfar, Mohammad Teshnehlab · 2011
The Residue Number System (RNS) is a non weighted system. It supports parallel, high speed, low power and secure arithmetic. Detecting overflow in RNS systems is very important, because if overflow is not detected properly, an incorrect result may be considered as a correct answer. The previously proposed methods or algorithms for detecting overflow need to residue comparison or complete convert of numbers from RNS to binary. We propose a new and fast overflow detection approach for moduli set {2 n-1, 2 n, 2 n +1}, which it is different from previous methods. Our technique implements RNS overflow detection much faster applying a few more hardware than previous methods.