Skip to main content

A Novel Methodology for Multiplication of Three n-Bit Binary Numbers

  • Conference paper
  • First Online:
Soft Computing and Signal Processing

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 900))

  • 801 Accesses

Abstract

Multipliers play an important role in any processor or computing machine. The performance of arithmetic circuits is evaluated from the performance of multipliers of those circuits. The conventional multiplier circuits process only two binary data at a time for multiplication. This paper proposes a methodology to multiply three binary numbers at once. This methodology reduces the complexity of the circuit for multiplying three binary numbers as compared to the existing methods of multiplying. When implemented in a circuit, this has turned out to increase the performance of the multiplier based on proposed methodology in terms of power, gates and delay as compared to existing multipliers. Based on simulation results for design of circuit for multiplying three 4-bit binary numbers, the proposed methodology shows a reduction of 37.56, 62.90 and 41.35% in propagation delay, power consumption and gate counts, respectively, as compared to existing techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. S. Kuang, J. Wang, C. Guo, Modified booth multipliers with a regular partial product array. IEEE Trans. Circ. Syst. II Express Briefs 56(5), 404–408 (2009)

    Google Scholar 

  2. F. Lamberti et al., Reducing the computation time in (short bit-width) twos complement multipliers. IEEE Trans. Comput. 60(2), 148–156 (2011)

    Article  MathSciNet  Google Scholar 

  3. N. Petra et al., Design of fixed-width multipliers with linear compensation function. IEEE Trans. Circ. Syst. I Regul. Pap. 58(5), 947–960 (2011)

    Article  MathSciNet  Google Scholar 

  4. K. RaniTsoumanis et al., An optimized modified booth recoder for efficient design of the add-multiply operator. IEEE Trans. Circ. Syst. I Regul. Pap. 61(4), 1133–1143 (2014)

    Article  Google Scholar 

  5. A. Cilardo et al., High speed speculative multipliers based on speculative carry-save tree. IEEE Trans. Circ. Syst. I Regul. Pap. 61(12), 3426–3435 (2014)

    Article  Google Scholar 

  6. T. Rakshith, R. Saligram, Design of high speed low power multiplier using reversible logic: a vedic mathematical approach, in Proceedings of IEEE International Conference on Circuits, Power and Computing Technologies (2013), pp. 775–781

    Google Scholar 

  7. R. Nalina, S. Ashwini, M. Kurian, Implementation of unsigned multiplier using area-delay-power efficient adder. Int. J. Res. Appl. Sci. Eng. Technol. 3(7), 429–432 (2015)

    Google Scholar 

  8. K. Dharshini, S. Kumar, S. Saravanan, Design and implementation of efficient multiplier architectures. Int. J. Res. Eng. Appl. Technol. 4(3), 28–38 (2015)

    Google Scholar 

  9. S. Deshmukh, D. Bhombe, Performance comparison of different multipliers using Booth algorithm. Int. J. Eng. Res. Technol. 3(2), 1957–1961 (2014)

    Google Scholar 

  10. B. Singh, R. Kumar, Design & implementation 8-bit Wallace tree multiplier. Int. J. Adv. Res. Electr. Electron. Instrum. Eng. 5(4), 2307–2312 (2016)

    Google Scholar 

  11. P. Avinash, S. Deepika, Implementation of VLSI architecture for signed-unsigned high speed booth multiplier. Int. J. VLSI Syst. Des. Commun. Syst. 2(1), 8–17 (2014)

    Google Scholar 

  12. E. Jaya, K. Rao, Power, area and delay comparision of different multipliers. Int. J. Sci. Eng. Technol. Res. 5(6), 2093–2100 (2016)

    Google Scholar 

  13. S. Hudda, M. Kalpana, S. Mohan, Novel high speed vedic mathematics multiplier using compressors, in Proceedings of IEEE International Mutli-Conference on Automation, Computing, Communication, Control and Compressed Sensing (2013), pp. 465–469

    Google Scholar 

  14. M. Ali, A. Sahani, Study, implementation and comparison of different multipliers based on Array, KCM and Vedic Mathematics using EDA tools. Int. J. Sci. Res. Publ. 3(6), 1–8 (2013)

    Google Scholar 

  15. S. Garg, V. Sachdeva, Comparative analysis of 8 × 8 Bit Vedic and Booth Multiplier, in Proceedings of IEEE International Conference on Advances in Computing, Communications and Informatics, (2014) pp. 2607–2610

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vinay Kumar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mukherjee, A., Hore, N., Kumar, V. (2019). A Novel Methodology for Multiplication of Three n-Bit Binary Numbers. In: Wang, J., Reddy, G., Prasad, V., Reddy, V. (eds) Soft Computing and Signal Processing . Advances in Intelligent Systems and Computing, vol 900. Springer, Singapore. https://doi.org/10.1007/978-981-13-3600-3_72

Download citation

Publish with us

Policies and ethics