Research Article
Notes on “A Novel Conversion Scheme from a Redundant Binary Number to Two's Complement Binary Number for Parallel Architectures” proposed by Choo et.al.
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 103 - Issue 5 |
| Published: October 2014 |
| Authors: M S Chakraborty, T Ghosh, A C Mondal |
10.5120/18068-9009
|
M S Chakraborty, T Ghosh, A C Mondal . Notes on “A Novel Conversion Scheme from a Redundant Binary Number to Two's Complement Binary Number for Parallel Architectures” proposed by Choo et.al.. International Journal of Computer Applications. 103, 5 (October 2014), 5-7. DOI=10.5120/18068-9009
@article{ 10.5120/18068-9009,
author = { M S Chakraborty,T Ghosh,A C Mondal },
title = { Notes on “A Novel Conversion Scheme from a Redundant Binary Number to Two's Complement Binary Number for Parallel Architectures” proposed by Choo et.al. },
journal = { International Journal of Computer Applications },
year = { 2014 },
volume = { 103 },
number = { 5 },
pages = { 5-7 },
doi = { 10.5120/18068-9009 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2014
%A M S Chakraborty
%A T Ghosh
%A A C Mondal
%T Notes on “A Novel Conversion Scheme from a Redundant Binary Number to Two's Complement Binary Number for Parallel Architectures” proposed by Choo et.al.%T
%J International Journal of Computer Applications
%V 103
%N 5
%P 5-7
%R 10.5120/18068-9009
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In this article, it is shown that although the reverse conversion scheme for binary signed-digit number system proposed by Choo et. al. can not support full parallelism; the rules on which it is based are correct. In this connection, a mathematical induction technique is used to validate the decomposition rules. Accordingly, it can be inferred that the reverse conversion scheme for binary signed-digit number system proposed by Veeramachaneni et. al. works correctly and performs reverse conversion in ? (log n) time, where, n is the input size. As a consequence, the scheme by Veeramachaneni et. al. need to be considered as a potential contender of the more recent schemes for the same.
References
- Avizienis, A. 1961. Signed - digit number representation for fast parallel arithmetic, IRE Trans on Electro Compu; 10(3): 389 – 400.
- Parhami, B. 2009. Computer Arithmetic: Algorithms and Hardware Design. 1st ed. USA: Oxford Univ Press.
- Chakraborty, M. S. and Sao, S. K. 2014. Comments on area-time efficient sign detection technique for binary signed-digit number system proposed by Srikanthan et. al. IJCA, USA. 88(15): 38-40.
- Ruiz, G. A. and Granda, M. 2011. Efficient Canonic Signed Digit Recording. Microelect J. 42: 1090 – 1097.
- He, Y. and Chang, C-H. 2008. A Power - Delay Efficient Hybrid Carry - Lookahead/ Carry - Select Based Redundant Binary to Two's Complement Converter. IEEE Trans Circuits Syst I Regul Pap; 55(1): 336 – 346.
- Sahoo, S. K. , Gupta, A. , Asati, A. R. and Shekhar, C. 2010. A Novel Redundant Binary Number to Natural Binary Number Converter. J Signal Process Syst. 59: 297-307.
- Choo, I. , Deshmukh, R. G. 2001. A novel conversion scheme from a redundant binary number to two's compliment binary number for parallel architectures. Proc IEEE SoutheastCon, Clemson, USA: 196 – 207.
- Wang, G. and Tull, M . P. 2004. A new Redundant Binary Number to two's complement Number Converter. Proc IEEE Region 5 Conf: ATLW, Norman, USA: 141-143.
- Blair, G. M. 1998. The Equivalence of Two's-Complement Addition and the Conversion of Redundant Binary to Two's-Complement Numbers. IEEE Trans Circuits Syst I Fundam Theory Appl; 45(6): 669-671.
- Veeramachaneni, S. , Krishna, M. K. , Avinash, L. , Reddy, S. and Srinivas, M. B. 2007. High - Speed Redundant Binary to Binary Converter using Prefix Networks. Proc IEEE Intl Symp Circuits and Sys, Hyderabad, AP, India: 3271-3274
Index Terms
Keywords