The week's pick
Random Articles
Reseach Article
RNS Overflow Detection by Operands Examination
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 85 - Number 18 |
| Year of Publication: 2014 |
| Authors: H. Siewobr, K. A. Gbolagade |
10.5120/14938-2906
|
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
Abstract
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.
References
- Szabo and R. Tanaka, (1967), "Residue Arithmetic Technology",New York: McGraw Hill.
- H. Siewobr, K. A. Gbolagade (2011), "An Efficient RNS Overflow Detection Algorithm", Far East Journal of Electronics and Communications, Vol. (6/2) pp. 83-91.
- K. A. Gbolagade and S. D. Cotofana, "Generalized matrix method for efficient residue to decimal conversion," in Proceeding of the 10th IEEE Asia-Pacific Conference on Circuits and Systems (APCCAS '08), pp. 1414–1417, Macao, China, December 2008.
- K. A. Gbolagade and S. D. Cotofana, "An O(n) Residue Number System to Mixed Radix Technique", IEEE International Symposium on Circuits and Systems (ISCAS 2009), pp. 521-524, Taipei, Taiwan, China, May, 2009.
- M. Rouhifar, M. Hosseinzadeh and M. Teshnehlab,( 2011), "A new approach to Overflow detection in moduli set (2n, 2n-1, 2n-1-1)", International Journal of Computational Intelligence and Information Security, Vol. 2, No. 3, pp. 35-43.
- M. Rouhifar, M. Hosseinzadeh, S. Bahanfar and M. Teshnehlab (2011), "Fast Overflow Detection in Moduli Set ?{2?^n-1,? 2?^n,? 2?^n+1}", International Journal of Computer Science Issues, Vol. (8/3), pp. 407-414.
- Theodore L. Houk, "Residue Addition Overflow Detection Processor", Boing Company, Seatle, Wash. Appl. No. :414276, Sep. 29, 1989.
- Theodore L. Houk, "Method and Apparatus for Pipelined detection of overflow inResidue Arithmetic Multiplication", Boing Company, Seatle, Wash. Appl. No. :472,237, Jan. 30, 1990.
- M. Askarzadeh, M. Hosseinzadeh and K. Navi (2009),"A New Approach to Overflow Detection in Moduli Set ?{2?^n-3,2^n-1,2^n+1,2^n+3}", Second International Conference on Computer and Electrical Engineering, Vol. 1, pp. 439-442.
- K. A. Gbolagade and S. D. Cotofana, "Residue Number System Operands to Decimal Conversion for 3-moduli sets", 51st Midwest Symposium on Circuits and Systems, Knoxville, USA, pp. 791-794, August, 2008.
- K. Ibrahim and S. Saloum, "An efficient residue to binary converter design", IEEE Trans. on Circuits and Systems, Vol. 35, pp 1156-1158, Sep. , 1988.
Index Terms
Keywords