International Journal of Advances in Engineering & Technology, Apr., 2015. ©IJAET ISSN: 22311963 185 Vol. 8, Issue 2, pp. 185-193 PROFICIENT REALIZATION OF ENHANCED BOOTH MULTIPLIER FOR SIGNED AND UNSIGNED BITS Jani Basha Shaik*, Susrutha Babu Sukhavasi # , Suparshya Babu Sukhavasi # , Sai Nikhil.M.V.S * , M.Aravind * # Faculty, Department of ECE, K L University, Guntur, AP, India. *B.Tech Students, Department of ECE, K L University, Guntur, AP, India. ABSTRACT Multipliers play vital role in most of the high performance systems. Performance of a system depends mostly on the performance of multiplier thus multipliers should be fast and consume less area and hardware. This paper introduces the configuration and execution of Enhanced Modified Booth multiplier for both signed and unsigned numbers augmentation. Generally the booth encoding method is used to generate the partial products for implementation of large parallel multiplier for all unsigned and some signed bits only, on by adopting the parallel encoding scheme. The necessity of the current circuit framework is a devoted and high speed exceptional multiplier unit for signed and unsigned numbers. The proposed efficiency enhanced booth multiplier can perform parallel encoding scheme for both signed and unsigned bits completely. The proposed one was simulated using Xilinx ISE design suite 14.2 tool and implemented on degilent nexus 2 kit, FPGA. KEYWORDS: Multiplier, Booth multiplier, parallel encoding, signed bits, unsigned bits. I. INTRODUCTION 1.1 Multiplication Multiplication is the basic process involved in many of the electronic circuits[1]. It is mostly used in microprocessors, graphics drivers, and digital signal processors. The multiplication process consists of formation of the product of the two unsigned or positive binary numbers. This is done through a very normal procedure of simplified to base 2. As an example, the multiplication of two positive 5 bit binary numbers 21 and 25 (in decimal) proceeds as shown below. Example 21:- 1 0 1 0 1 - multiplicand 25:- 1 1 0 0 1 - multiplier X ----------------------------------------------------------------- 1 0 1 0 1 0 0 0 0 0 partial 0 0 0 0 0 products 1 0 1 0 1 1 0 1 0 1 ----------------------------------------------------------------- 1 0 0 0 0 0 1 1 0 1:- 525 - product -----------------------------------------------------------------