Implementation of 18-Bit High-Speed Binary Multipliers

  • S. SreelakshmiEmail author
  • T. Vandana Raj
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 394)


Multiplication is an extensively used arithmetic operation that has immense usage in signal processing and scientific applications. Multiplication is hardware intensive, and the main criteria of interests are less VLSI area, higher speed, and lower cost. Multiplication involves basically two operations, first is generating the partial products and then their accumulation, where the partial product is shifted by one bit to the right and adding with the previous partial product. The speed of multiplication can be enhanced by reducing the number of partial products or by enhancing the speed of the accumulation. Hence, in this paper, the novel study of the different fast multipliers like radix-2 or Booth algorithm, radix-4 or modified Booth algorithm is done, and implementation of 18-bit multiplier is done in Verilog (Modelsim) and compared the results in MATLAB. The SNR analysis of the multiplier of finite precision product, truncation, and rounding is done. Algorithms for reducing the hardware complexity in partial product sign extension are implemented for both radix-2 Booth multiplication and radix-4 modified Booth multiplication. The Wallace tree adder is implemented for increasing the speed of the accumulation of the partial products.


Radix-2 Booth algorithm Radix-4 modified Booth algorithm Wallace tree Biased rounding Unbiased rounding 



The authors would like to thank Amrita Viswa Vidyapeedom for providing effective tools for the work and the support of the faculty throughout the completion of the work.


  1. 1.
    Cho KJ, Lee KC, Chung JG, Parhi KK. Design of Low- error fixed-width modified Booth multiplier. IEEE Trans Very Large Scale Integr VLSI Syst. 2004;12(5):522–31.CrossRefGoogle Scholar
  2. 2.
    Yeh WC, Jen CW. High speed booth encoded parallel multiplier design. IEEE Trans Comput. July 2000;49(7):692–701.Google Scholar
  3. 3.
    Booth AD. A signed binary multiplication technique. Quart J Mech Appl Marh. 1951;4:236–240. (Reprinted in [8, pp. 100-104]).Google Scholar
  4. 4.
    Song MA, Van LD, Kuo SY. Adaptive low-error fixed-width Booth multipliers. IEICE Trans Fundam. June 2007;E90-A(6):11180–1187.Google Scholar
  5. 5.
    Madrid PE, Millar B, Swartzlander EE. Modified booth algorithm for high radix fixed point multiplication. IEEE Trans. 1993.Google Scholar
  6. 6.
    Fadavi-Ardekani J, “M X N Booth encoded multiplier generator using optimized Wallace trees. IEEE Trans Very Large Scale Integr VLSI Syst. June 1993;1(2):120–125.Google Scholar
  7. 7.
    Koren I. Computer arithmatics algorithms. A.K. Peters Ltd. ISBN 1568811608. Google Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.Electronics and Communication DepartmentAmrita Viswa Vidyapeedom Amrita School of EngineeringKollamIndia

Personalised recommendations