Analysis and comparison of fast multiplier circuits based on different parameters

  • Authors

    • Mr Aaron D’costa Student
    • Dr Abdul Razak Assistant professor
    • Dr Shazia Hasan Assistant professor
    2018-06-26
    https://doi.org/10.14419/ijet.v7i3.12945
  • Tree Multiplication, Array Multiplication, Booth’s Algorithm, Wallace Tree Algorithm, Vedic Multiplier, Adder Circuits, Area, Delay
  • Digital multiplier circuits are used in computers. A multiplier is an electronic circuit used in digital electronics to multiply two binary numbers. Multiplier circuits are used in ALU for binary multiplication of signed and unsigned numbers. The delay, area and power consumption are the 3 most important design specifications a chip designer has to consider. Delay of the circuit is directly proportional to the delay of a multiplier. Increased delay in the multiplier leads to higher delay in the circuit. Therefore research is carried out as to how to reduce the delay of the multiplier block so as to reduce the delay of whole circuit. The main purpose is to deal with high speed and lower power consumption even after decreasing the silicon area. This makes them well-suited for numerous complex and convenient VLSI circuit implementations. The fact however, remains that area and speed are two contradictory performance restrictions. Hence, increase in speed always results in the use of more and complex hardware. Different arithmetic techniques can be used to implement different multiplier circuits. The focus of this paper is to implement various multiplier circuit and compare them. The timing signals can be observed using software such as Modelsim and Xilinx.

     

     

  • References

    1. [1] K. D. P. S. a. B. R. Pichhode, "FPGA implementation of vedic multiplier," in Internation conference on Information Processing(ICIP), 2015.

      [2] S. V. R. Raju, "Design and implementation of low power and high performance vedic multiplier," in 2016 International Conference on Communication and Signal Processing (ICCSP), 2016. https://doi.org/10.1109/ICCSP.2016.7754210.

      [3] Booth, "A signed binary multiplication technique," Modern Electronics Techniques, vol. 4, no. E98-C, 1951.

      [4] L. S. J. W. J. X. Chendong Liang, "An innovative Booth algorithm," in 2016 IEEE Advanced information Management, Communicates, Electronic and Automation Control Conference (IMCEC), 2016.

      [5] C. Wallace, "A suggestion for a fast multiplier," IEEE Transaction on Electronic Computers, vol. 4, no. 13, pp. 14-17.

      [6] B. V. V. P. K. a. M. K. Dinesh, "Comparison of regular and tree based multiplier architectures with odified booth encoding for 4 bits on layout level using 45 nm technology," in 2014 International Conference on Green Computing Communication and Electrical Engineering(ICGCCEE), 2014.

      [7] Sumita Vaidya and Deepak Dandekar, “Delay-Power Performance comparison of Multipliers in VLSI Circuit Designâ€, International Journal of Computer Networks & Communications (IJCNC), Vol.2, No.4, pp. 47-56, July 2010.

      [8] Mohammed Hasmat Ali, Anil Kumar Sahani “Study, Implementation and Comparison of Different Multipliers based on Array, KCM and Vedic Mathematics Using EDA Tools†, International Journal of Scientific and Research Publications, Volume 3 , Issue 6 , June 2013.

      [9] D. W. Neil Harris, CMOS VLSI DESIGN: A Circuits and Systems Perspective 4th edition, McGraw-Hill.

  • Downloads

  • How to Cite

    Aaron D’costa, M., Abdul Razak, D., & Shazia Hasan, D. (2018). Analysis and comparison of fast multiplier circuits based on different parameters. International Journal of Engineering & Technology, 7(3), 1189-1192. https://doi.org/10.14419/ijet.v7i3.12945