IJEEE, Vol. 1, Issue 4 (August, 2014)
e-ISSN: 1694-2310 | p-ISSN: 1694-2426
DESIGN & ANALYSIS OF MODIFIED SHANNON BASED LOW POWER CONSUMPTION FULL ADDER CELL 1
Rupali Gupta, 2Rajesh Mehra
1,2
Department of ECE, National Inst. Of Technical Teachers’ Training & Research, Chandigarh, India 1
rupaligupta2005@gmail.com, 2rajeshmehra@yahoo.co.in
Abstract—The basic building block of any computational circuit is adder which affects the performance of the system so there is a need for an adder with low power dissipation and small area. In this paper a high performance, low power dissipation full adder cell is designed using Shannon theorem. The hardware includes a four bit 2`s compliment adder/subtractor using proposed full adder. The adder is optimized using transistor sizing technique. Simulations were performed using Microwind3.1 VLSI CAD tool and schematic is generated by using DSCH3.1 CAD tool. After optimization for parameter analysis BSIM4 analyzer is used at 90nm deep submicron technology. Simulation results show a large improvement in power consumption and more than 50% improvement in transistor count than other existing full adder circuits. Index Terms- Adder cell, power dissipation, Shannon theorem, transistor count, VLSI. I. INTRODUCTION With the explosive growth of the use of portable and multimedia devices, laptops and mobiles and with the shrinkage of the size of electronic devices the demand of low power very large scale integration (VLSI) system has become very high. Since the increase in chip density increases the power consumption also. The power has become the major concern for research in the area of VLSI design. In recent trends a large no of portable devices needs small area, low power and high speed circuits. Addition is the fundamental arithmetic operation which is used in most of the data path circuits for different arithmetic operations like multiplication, division and ALU operations etc. Hence the adder design should be efficient enough to give the better results with respect to the quality design constrains like low power, small area and fast speed. In past decades full adder cell has been designed using many logic styles like PTL.MUX based, transmission gated logic style and CPL etc. Each logic style has its own merits and demerits in terms of delay and power. Among many logic styles pass transistor logic has several merits. In this style gate and source both propagates the signal with great functionality. PTL can be designed using nMOS or p-MOS only with reduced transistor count and area [1]. PTL have low interconnect capacitance so high speed can be achieved. In this paper full adder has been designed using PTL logic style and compared with the existing circuits. www.ijeee-apm.com
II. FULL ADDER ARCHITECTURE The basic cell component of any data path circuit is full adder. It is a digital circuit which performs the addition of two numbers i.e. one of the four basic arithmetic functions. According the application the number of the inputs may vary. So according to the no. of inputs there are two types of adders as Full adder and Half adder. The addition of two bits can generate a carry so a Full adder has three inputs as A, B and Ci and two outputs as Sum and Carry. Here Ci is the previous carry which may be generated from the addition of the previous two bits. It performs the addition of three inputs as Sum= A xor B xor C (1) Carry=AB+BC+CA (2) Figure 1 shows the gate level circuit of a full adder. The truth table of a full adder can be obtained from the binary arithmetic operations. A full adder can be implemented using CPL which uses n- MOS network for implementing the logic function. This logic style has least power consumption per gate during logic transition. The CPL has many drawbacks due to source follower action and body effect, limited fan out and high leakage power when not cross coupled.
Figure 1. Full Adder using half adder
The MCIT technique is developed by using Karnaugh map from the Boolean Expression for sum and carry signals from the standard truth table for the full adder circuit [2]. The Boolean expressions are given by equation (1) and (2).The full adder pass transistor are shown in figure 2 with A ,A`,B and B` as the pass transistor inputs and these are multiplexing control inputs. International Journal of Electrical & Electronics Engineering
13