International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 85 - Issue 18 |
Published: January 2014 |
Authors: H. Siewobr, K. A. Gbolagade |
![]() |
H. Siewobr, K. A. Gbolagade . RNS Overflow Detection by Operands Examination. International Journal of Computer Applications. 85, 18 (January 2014), 1-5. DOI=10.5120/14938-2906
@article{ 10.5120/14938-2906, author = { H. Siewobr,K. A. Gbolagade }, title = { RNS Overflow Detection by Operands Examination }, journal = { International Journal of Computer Applications }, year = { 2014 }, volume = { 85 }, number = { 18 }, pages = { 1-5 }, doi = { 10.5120/14938-2906 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2014 %A H. Siewobr %A K. A. Gbolagade %T RNS Overflow Detection by Operands Examination%T %J International Journal of Computer Applications %V 85 %N 18 %P 1-5 %R 10.5120/14938-2906 %I Foundation of Computer Science (FCS), NY, USA
In this paper, a novel scheme for detecting overflow in Residue Number System (RNS) is presented. A generalized scheme for RNS overflow detection is introduced, followed by a simplified Operands Examination Method for overflow detection for the moduli set ?{2?^n-1,2^n,2^n+1}. The proposed method detects overflow in RNS addition of two numbers without pre-computing their sum. Moreover, when compared with the best known similar state of the art designs, the proposed scheme requires lesser hardware, reduces the operation size and is faster.