Efficient Realization of Vinculum Vedic BCD Multipliers for High Speed Applications
- 1 Geethanjali College of Engineering and Technology, Hyderabad, India
- 2 Muffakamjah College of Engineering and Technology, Hyderabad, India
- 3 Sridevi Women’s Engineering College, Hyderabad, India
Abstract
Decimal multipliers play an important role in our day to day life for commercial, financial and tax applications. Every processor multiplier acts as the basic building block which decides the performance of processor. Time and again research is going on to design high-performance, low-latency BCD multiplier architectures. This paper proposes a new approach to BCD multiplication using vinculum number system. The key feature of the proposed architecture uses entirely a new one digit ROM based BCD multiplier that uses vinculum numbers as operands. Using this one digit BCD multiplier, an N digit BCD multiplier is built by using the vedic vertical cross wire method (Urdhav Triyagbhyam). We have also used our proposed multi operand VBCD Adder (Vinculum BCD Adder) [my paper 26] to add the partial products. In this paper, we show that this approach is a promising alternative to conventional BCD multiplication or other decimal multiplication methods that use alternative decimal representations like 5211, 4221, Xs3 etc.
- Cowlishaw, M.F. (2003) Decimal Floating-Point: Algorism for Computers. Proceedings 2003 16th IEEE Symposium on Computer Arithmetic, Santiago de Compostela, 15-18 June 2003, 104-111. https://doi.org/10.1109/ARITH.2003.1207666
- IEEE Std 754(TM)-2008 (2008) IEEE Standard for Floating-Point Arithmetic. IEEE Computer Society, Washington, DC.
- Aswal, M., Perumal, G. and Prasanna, G.N.S. (2012) On Basic Financial Decimal Operations on Binary Machines. IEEE Transactions on Computers, 61, 1084-1096. https://doi.org/10.1109/TC.2012.89
- Dadda, L. (2007) Multioperand Parallel Decimal Adder: A Mixed Binary and BCD Approach. IEEE Transactions on Computers, 56, 1320-1328. https://doi.org/10.1109/TC.2007.1067
- Erle, M.A. and Schulte, M.J. (2003) Decimal Multiplication via Carry-Save Addition. Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors ASAP 2003, The Hague, 24-26 June 2003, 348-358. https://doi.org/10.1109/ASAP.2003.1212858
- Erle, M.A., Schwarz, E.M. and Schulte, M.J. (2005) Decimal Multiplication with Efficient Partial Product Generation. Proceedings of 17th IEEE Symposium on Computer Arithmetic, Cape Cod, MA, 27-29 June 2005, 21-28. https://doi.org/10.1109/ARITH.2005.15
- Vazquez, E.A. and Bruguera, J. (2014) Fast Radix-10 Multiplication Using Redundant BCD Codes. IEEE Transactions on Computers, 63, 1902-1914. https://doi.org/10.1109/TC.2014.2315626
- Lang, T. and Nannarelli, A. (2006) A Radix-10 Combinational Multiplier. 2006 Fortieth Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, 29 October-1 November 2006, 313-317. https://doi.org/10.1109/ACSSC.2006.354758
- Dadda, L. and Nannarelli, A. (2008) A Variant of a Radix-10 Combinational Multiplier. 2008 IEEE International Symposium on Circuits and Systems, Seattle, WA, 18-21 May 2008, 3370-3373.
- Gorgin, S. and Jaberipur, G. (2009) A Fully Redundant Decimal Adder and Its Application in Parallel Decimal Multipliers. Microelectronics Journal, 40, 1471-1481. https://doi.org/10.1016/j.mejo.2009.07.002
- Jaberipur, G. and Kaivani, A. (2009) Improving the Speed of Parallel Decimal Multiplication. IEEE Transactions on Computers, 58, 1539-1552. https://doi.org/10.1109/TC.2009.110
- Vazquez, E.A. and Montuschi, P. (2010) Improved Design of High-Performance Parallel Decimal Multipliers. IEEE Transactions on Computers, 59, 679-693. https://doi.org/10.1109/TC.2009.167