i-manager Publications

Design and Optimization of MSI-Enabled Multi-Precision Binary Multiplier Architecture

Rajkumar K.*

Department of Electrical Engineering, Shri Shankaracharya Group of Institution, Junwani, Chhattisgarh, India.

Periodicity:July - December'2023
DOI : https://doi.org/10.26634/jcir.11.2.20397

Abstract

Arithmetic Logic Units (ALUs) are key elements within processors, executing a variety of operations including multiplication, division, addition, and subtraction. Among these, multiplication stands out as the most frequently utilized function within ALUs. This study presents an innovative MSI-interfaced multiplier architecture designed for integration into a multi-precision floating-point multiplier framework. This novel architecture offers configurations for 24-bit, 53-bit, 113- bit, and 237-bit binary operations, corresponding to single, double, quadruple, and octuple precision modes of floating-point computation. Notably, it enhances throughput by accommodating the multiplication of multiple batches of inputs with each operation initiation, surpassing existing binary multiplication systems. A unique Mantissa Similarity Investigation (MSI) implementation is developed and integrated into the binary multiplier architecture. Comparative analysis of the path delay in 24-bit mode against existing 24-bit multipliers demonstrates that the novel MSI-interfaced binary multiplier architecture, with and without MSI, exhibits reduced path delay compared to all existing systems, as anticipated.

Keywords

Arithmetic Logic Unit, Binary Multiplier, MSI-Interfaced Multiplier System, Multiplier Architecture, FPGAs in Arithmetic.

How to Cite this Article?

Rajkumar, K. (2023). Design and Optimization of MSI-Enabled Multi-Precision Binary Multiplier Architecture. i-manager’s Journal on Circuits and Systems, 11(2), 27-35. https://doi.org/10.26634/jcir.11.2.20397

References

[1]. Abraham, S., Kaur, S., & Singh, S. (2015, January). Study of various high speed multipliers. In 2015 International Conference on Computer Communication and Informatics (ICCCI) (pp. 1-5). IEEE.

[2]. Anane, N., Bessalah, H., Issad, M., Messaoudi, K., & Anane, M. (2009, April). Hardware implementation of variable precision multiplication on FPGA. In 2009 4th International Conference on Design & Technology of Integrated Systems in Nanoscal Era (pp. 77-81). IEEE.

[3]. Anitha, P., & Ramanathan, P. (2014, February). A new hybrid multiplieusing Dadda and Wallace method. In 2014 International Conference on Electronics and Communication Systems (ICECS) (pp. 1-4). IEEE.

[4]. Arish, S., & Sharma, R. K. (2015a, February). Run-time reconfigurable multi-precision floating point multiplier design for high speed, low-power applications. In 2015 2nd International Conference on Signal Processing and Integrated Networks (SPIN) (pp. 902-907). IEEE.

[5]. Arish, S., & Sharma, R. K. (2015b, April). An efficient binary multiplier design for high-speed applications using Karatsuba algorithm and Urdhva-Tiryagbhyam algorithm. In 2015 Global Conference on Communication Technologies (GCCT) (pp. 192-196). IEEE.

[6]. Bathija, R. K., Meena, R. S., Sarkar, S., & Sahu, R. (2012). Low power high speed 16x16 bit multiplier using vedic mathematics. International Journal of Computer Applications, 59(6), 41-44.

[7]. Benini, L., & De Micheli, G. (1996). Automatic synthesis of low-power gated-clock finite-state machines. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 15(6), 630-643.

[8]. Bisoyi, A., Baral, M., & Senapati, M. K. (2014, May). Comparison of a 32-bit vedic multiplier with a conventional binary multiplier. In 2014 IEEE International Conference on Advanced Communications, Control and Computing Technologies (pp. 1757-1760). IEEE.

[9]. Cheng, F. C., Unger, S. H., Theobald, M., & Cho, W. C. (1997, January). Delay-insensitive carry-lookahead adders. In Proceedings Tenth International Conference on VLSI Design (pp. 322-328). IEEE.

[10]. Chopade, S. S., & Mehta, R. (2015, September). Performance analysis of vedic multiplication technique using FPGA. In 2015 IEEE Bombay Section Symposium (IBSS) (pp. 1-6). IEEE.

[11]. George, M. L., & Tomar, G. S. (2015, April). Hardware design procedure: Principles and practices. In 2015 Fifth International Conference on Communication Systems and Network Technologies (pp. 834-838). IEEE.

[12]. Gokhale, G. R., & Bahirgonde, P. D. (2015, August). Design of Vedic-multiplier using area-efficient Carry Select Adder. In 2015 International Conference on Advances in Computing, Communications and Informatics (ICACCI) (pp. 576-581). IEEE.

[13]. Gupta, A., Mandavalli, S., Mooney, V. J., Ling, K. V., Basu, A., Johan, H., & Tandianus, B. (2011, July). Low power probabilistic floating-point multiplier design. In 2011 IEEE Computer Society Annual Symposium on VLSI (pp. 182-187). IEEE.

[14]. Hambley, A. R. (2001). Electrical Engineering: Principles and Applications. Prentice Hall, New Jersey.

[15]. Hennessy, J. L., & Patterson, D. A. (2003). Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers, San Francisco.

[16]. Jain, A., Dash, B., Panda, A. K., & Suresh, M. (2012, March). FPGA design of a fast 32-bit floating-point multiplier unit. In 2012 International Conference on Devices, Circuits and Systems (ICDCS) (pp. 545-547). IEEE.

[17]. Kattamuri, R. K., & Sahoo, S. K. (2010, December). Computation sharing multiplier using redundant binary arithmetic. In 2010 IEEE Asia Pacific Conference on Circuits and Systems (pp. 108-111). IEEE.

[18]. Kodali, R. K., Boppana, L., & Yenamachintala, S. S. (2015, February). FPGA implementation of vedic floatingpoint multiplier. In 2015 IEEE International Conference on Signal Processing, Informatics, Communication and Energy Systems (SPICES) (pp. 1-4). IEEE.

[19]. Mhaidat, K. M., & Hamzah, A. Y. (2014, December). A new efficient reduction scheme to implement tree multipliers on FPGAs. In 2014 9th International Design and Test Symposium (IDT) (pp. 180-184). IEEE.

[20]. Perry, D. L. (1998). VHDL: Programming by Example. McGraw-Hill Education.

[21]. Ram, G. C., Lakshmanna, Y. R., Rani, D. S., & Sindhuri, K. B. (2016, March). Area efficient modified vedic multiplier. In 2016 International Conference on Circuit, Power and Computing Technologies (ICCPCT) (pp. 1-5). IEEE.

[22]. Rao, M. J., & Dubey, S. (2012, December). A high speed and area efficient Booth recoded Wallace tree multiplier for fast arithmetic circuits. In 2012 Asia Pacific Conference on Postgraduate Research in Microelectronics and Electronics (pp. 220-223). IEEE.

[23]. Sharma, R., Kaur, M., & Singh, G. (2015, May). Design and FPGA implementation of optimized 32-bit Vedic multiplier and square architectures. In 2015 International Conference on Industrial Instrumentation and Control (ICIC) (pp. 960-964). IEEE.

[24]. Thapliyal, H., & Srinivas, M. B. (2005). A novel timearea-power efficient single precision floating-point multiplier. Proceeding of MAPLD, New York.

[25]. Vyas, K., Jain, G., Maurya, V. K., & Mehra, A. (2015, October). Analysis of an efficient partial product reduction technique. In 2015 International Conference on Green Computing and Internet of Things (ICGCIoT) (pp. 1-6). IEEE.

[26]. Zuras, D., Cowlishaw, M., Aiken, A., Applegate, M., Bailey, D., Bass, S., ... & Canon, S. (2008). IEEE standard for floating-point arithmetic. IEEE Standard, 754(2008), 1-70.

Design and Optimization of MSI-Enabled Multi-Precision Binary Multiplier Architecture

Abstract

Keywords

How to Cite this Article?

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Options for accessing this content:

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Pdf	35	35	200	20
Online	35	35	200	15
Pdf & Online	35	35	400	25