A 2GHz 64x64-bit Low-Latency Pipelined Booth Multiplier

  • Habib Ghasemizadeh Microelectronics Research Laboratory of Urmia University, Urmia, Iran.
  • Amir Fathi Microelectronics Research Laboratory of Urmia University, Urmia, Iran.
Keywords: Multiplier, Pipeline, Modified Booth, Carry-select Adder (CSA), Carry-lookahead Adder (CLA), Block Carry Generator, Sign- Extension, Extra Row Elimination

Abstract

Today's parallel multipliers generally comprise three main parts: First is Partial Products Generator, which the most common method for this is to use Modified Booth Encoder (MBE) since it reduces the number of rows of an n bit multiplier to n/2+1 as well as executing signed multiplications. The second part is circuits that add Partial Products of equal value vertically to reduce the number of rows created in the first part into two rows. This part is generally done by Compressor or Counter. Finally, the third part is the final adder, which adds up the remaining two rows of the second part and produces the final multiplication outputs. Improvement in each of these 3 main parts can enhance the overall capacity of the multiplier. This paper presents a new high-speed 64x64-bit CMOS 8 stage pipelined Booth multiplier using fast booth encoder/decoder circuits, a new extra row elimination technique and a modified adder aiming to improve the speed of pipelined multiplier. In the proposed design, generation of first 31 bit rows and 32th row have the latency as low as 380 and 420 ps respectively due to optimizations in Booth Encoder/Decoder and first stage circuits. By applying these new architectures, the final adder performs 108-bit addition in only three cycles with high speed (2 GHz). With a 31% increase in the number of transistors and a 41% increase in latency, the multiplying sampling rate is 571% higher than the similar non-pipeline case. Power consumption @ 2GHz and 1.8 power supply is 924 mW. This multiplier is implemented in TSMC 0.18 µ CMOS technology and the results prove the effectiveness of the proposed method.

References

[1] P. C. H. Meier, "Analysis and Design of Low Power Digital Multipliers", Ph.D. Thesis, Carnegie Mellon University, Dept. of Electrical and Computer Engineering, Pittsburgh,Pennsylvania,1999.
[2] B. Parhami, Computer Arithmetic Algorithms and Hardware Design, Oxford University Press, 2000.
[3] J. B. Kuo and J. H. Lou, Low Voltage CMOS VLSI Circuits, John Wiley & Sons, 1999.
[4] N.Ohkubo,et. al.,“A4.4nsCMOS54*54-b multiplier using pass-transistor multiplexer,” IEEE J. Solid-State Circuits, vol.30, pp.251-257,March 1995.
[5] A. Inoue, R. Ohe, S. Kashiwakura, S. Mitari, T. Tsuru, T. Izawa, G. Goto, "A 4.1nS Compact 54X54b Multiplier Utilizing Sign Select Booth Encoders", 1997 IEEE International Solid State Circuits Conference, Digest of Papers, San Francisco, 1997. p.416.
[6] S. Kim and K. Cho, “Design of High-speed Modified Booth Multipliers Operating at GHz Ranges,” World Academy of Science, Engineering and Technology, vol. 61, pp. 1-4, Jan. 2010.
[7] H. Ghasemizadeh, E. Azadi, Kh. Hadidi and A. Khoei, “High Speed 16×16-bit Low-Latency Pipelined Booth Multiplier,” 19th Iranian Conference on Electrical Engineering (ICEE), pp. 1-6, May. 2011.
[8] F.S. Anderson, et. al., “The IBM system 360/91 floating point execution unit,” IBM J. Res. Develop., vol.11, pp.34-53, Jan. 1967.
[9] M. Suzuki et al, "A 1.5nS 32b CMOS ALU in Double Pass-Transistor Logic", Digest of Technical Papers, 1993 IEEE Solid-State Circuits Conference, San Francisco, February 24-26, 1993.
[10] H.C. Chow and I.C. Wey, “A 3.3V 1GHz high speed pipelined Booth multiplier,” Proc. of IEEE ISCAS, vol. 1, pp. 457-460, May. 2002.
[11] H.C. Chow and I.C. Wey, “A 3.3 V 1 GHz low-latency pipelined Booth multiplier with new Manchester carry-pass adder,” Proc. of IEEE ISCAS, vol. 5, pp. 121-124, May. 2003.
[12] M.A. Hernandez and M.L. Aranda, “Energy-efficient high-speed CMOS pipelined multiplier,” Proc. of IEEE CCE, pp. 460-464, Nov. 2008.
[13] J. Y. Kang and J. L. Gaudiot, “A Simple High-Speed Multiplier Design,” IEEE Trans. Computers, vol. 55, p.p. 1253-1257, 2006.
[14] L.R. Wang, S.J. Jou and C.L. Lee, “A well-structured modified Booth multiplier design,” Proc. of IEEE VLSI-DAT, pp. 85-88, April. 2008.
[15] M.D. Ercegovac, C.A. Fabian, and T. Lang, “On reducing transition counts in sign detection circuits,” in Proc. 30th Asilomar Conf. Signals, Systems and Computers, pp.596-599, Nov. 1996.
[16] X. Wu, C. Huang, J. Lai, and C. Sun, “A 64x64-bit Modified Booth Multiplier Utilizing Multiplexer-Select Booth Encoder,” ASICON. 6th Int. Conf, vol. 1, pp. 57-60, Oct. 2005.
[17] A.Chandrakasan, W. J. Bowhill and F. Fox, Design of High Performance Microprocessor Circuits, IEEE Press, 2001.
[18] H. Ghasemizadeh Tamar, A. Ghasemizadeh Tamar, Kh. Hadidi, A. Khoei and Pourya Hoseini, “High Speed Area Reduced 64-bit Static Hybrid Carry-Lookahead/Carry-Select Adder,” 18th IEEE International Conference on Electronics, Circuits, and Systems, pp. 11-14 Dec. 2011.
[19] T. Y. Chang and M. J. Hsiao, “Carry-select adder using single ripple-carry adder,” Electron. Lett., vol. 34, no. 22, pp. 2101–2103, Oct. 1998
[20] G.A. Ruiz, M. Granda, “An area-efficient static CMOS carryselect adder based on a compact carry look-ahead unit,” Microelectronics Journal, vol. 35, no. 12, pp. 939-944, 2004.
[21] Y. Wang, C. Pai, and X. Song, “The design of hybrid arrylookahead/carry-select adders,” IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 49, no. 1, pp. 16–24, Jan. 2002.
Published
2021-06-01
How to Cite
Ghasemizadeh, H., & Fathi, A. (2021). A 2GHz 64x64-bit Low-Latency Pipelined Booth Multiplier. Majlesi Journal of Mechatronic Systems, 10(2), 7-15. Retrieved from https://ms.majlesi.info/index.php/ms/article/view/483
Section
Articles