A Novel Redundant Binary Number to Natural Binary Number Converter
Redundant binary number appears to be appropriate for high-speed arithmetic operation, but the delay and hardware cost associated with the conversion from redundant binary (RB) to natural binary (NB) number is still a challenging task. In the present investigation a simple approach has been adopted to achieve high speed with lesser hardware and power saving. A circuit level approach has been adopted to implement the equivalent bit conversion algorithm (EBCA) (Kim et al. IEEE Journal of Solid State Circuits 36:1538-1544, 2001, 38:159-160, 2003) for RB to NB conversion. The circuit is designed based on exploration of predictable carry out feature of EBCA algorithm. This implementation concludes a significant delay power product and component complexity advantage for a 64-bit RB to NB conversion using novel carry-look-ahead equivalent bit converter.
KeywordsRedundant binary number Equivalent bit conversion algorithm Redundant binary to natural binary converter Carry-look-ahead adder
- 1.Takagi, N., Yasuura, H., & Yajima, S. (1984). A VLSI-Oriented High-Speed Multiplier Using Redundant Binary Adder Tree. IECE Japan, J66.d, 683–690.Google Scholar
- 6.Bewick, G. (1994). “Fast multiplication: algorithms and implementations,” Technical report CSL-TR-94-617, Stanford Univ., Apr.Google Scholar
- 7.Choo, I., & Deshmukh, R. G. (2001). “A novel conversion scheme from a redundant binary to two’s complement binary number for parallel architectures,” in Southeastcon 2001 Proceedings of IEEE, 2001, Clemson, pp. 196–201, March 30–April 1.Google Scholar
- 10.Lee, S.-H., Bae, S.-J., & Park, H.-J. (2002). A compact radix-64 54x54 CMOS redundant binary parallel multiplier. IEICE Transactions on Electronics, E85-C(6), 1342–1350.Google Scholar
- 17.Hennesy, J. L., & Patterson, D. A. (2000). Computer architecture a quantitative approach. Morgan Kaufmann Publication. San Francisco, Inc.Google Scholar