期刊名称:International Journal of Computer Science Issues
印刷版ISSN:1694-0784
电子版ISSN:1694-0814
出版年度:2011
卷号:8
期号:3
出版社:IJCSI Press
摘要: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 {2n-1, 2n, 2n+1}, which it is different from previous methods. Our technique implements RNS overflow detection much faster applying a few more hardware than previous methods.
关键词:Residue number system; overflow detection; moduli set {2n;1; 2n; 2n+1}; group number