DESIGN OF 16-BIT CARRY-LOOKAHEAD ADDER AND 8-BIT KOGGE-STONE ADDER USING GDI LOGIC

Similar documents
NEW adder cells are useful for designing larger circuits despite increase in transistor count by four per cell.

Design of Low Power One-Bit Hybrid-CMOS Full Adder Cells

Gates, Circuits, and Boolean Algebra

International Journal of Electronics and Computer Science Engineering 1482

HIGH SPEED AREA EFFICIENT 1-BIT HYBRID FULL ADDER

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

CMOS Binary Full Adder

Sequential 4-bit Adder Design Report

A Novel Low Power, High Speed 14 Transistor CMOS Full Adder Cell with 50% Improvement in Threshold Loss Problem

LOW POWER MULTIPLEXER BASED FULL ADDER USING PASS TRANSISTOR LOGIC

High Speed Gate Level Synchronous Full Adder Designs

Module 4 : Propagation Delays in MOS Lecture 22 : Logical Effort Calculation of few Basic Logic Circuits

CSE140 Homework #7 - Solution

Optimization and Comparison of 4-Stage Inverter, 2-i/p NAND Gate, 2-i/p NOR Gate Driving Standard Load By Using Logical Effort

Let s put together a Manual Processor

Floating Point Fused Add-Subtract and Fused Dot-Product Units

A New Low Power Dynamic Full Adder Cell Based on Majority Function

Efficient Interconnect Design with Novel Repeater Insertion for Low Power Applications

Chapter 2 Logic Gates and Introduction to Computer Architecture

ECE410 Design Project Spring 2008 Design and Characterization of a CMOS 8-bit Microprocessor Data Path

Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng

Design of Energy Efficient Low Power Full Adder using Supply Voltage Gating

A New Reversible TSG Gate and Its Application For Designing Efficient Adder Circuits

LFSR BASED COUNTERS AVINASH AJANE, B.E. A technical report submitted to the Graduate School. in partial fulfillment of the requirements

what operations can it perform? how does it perform them? on what kind of data? where are instructions and data stored?

Lecture 5: Gate Logic Logic Optimization

Chapter 4 Register Transfer and Microoperations. Section 4.1 Register Transfer Language

Implementation of Modified Booth Algorithm (Radix 4) and its Comparison with Booth Algorithm (Radix-2)

A high Speed 8 Transistor Full Adder Design using Novel 3 Transistor XOR Gates

A Novel Low Power Fault Tolerant Full Adder for Deep Submicron Technology

AN IMPROVED DESIGN OF REVERSIBLE BINARY TO BINARY CODED DECIMAL CONVERTER FOR BINARY CODED DECIMAL MULTIPLICATION

Design Verification and Test of Digital VLSI Circuits NPTEL Video Course. Module-VII Lecture-I Introduction to Digital VLSI Testing

10 BIT s Current Mode Pipelined ADC

CHAPTER 3 Boolean Algebra and Digital Logic

Sistemas Digitais I LESI - 2º ano

e.g. τ = 12 ps in 180nm, 40 ps in 0.6 µm Delay has two components where, f = Effort Delay (stage effort)= gh p =Parasitic Delay

ELEC EXPERIMENT 1 Basic Digital Logic Circuits

Introduction to Digital System Design

exclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576

Digital Electronics Detailed Outline

RAM & ROM Based Digital Design. ECE 152A Winter 2012

Gates & Boolean Algebra. Boolean Operators. Combinational Logic. Introduction

數 位 積 體 電 路 Digital Integrated Circuits

Analog & Digital Electronics Course No: PH-218

Pass Gate Logic An alternative to implementing complex logic is to realize it using a logic network of pass transistors (switches).

Performance Comparison of an Algorithmic Current- Mode ADC Implemented using Different Current Comparators

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad

Chapter 10 Advanced CMOS Circuits

NAME AND SURNAME. TIME: 1 hour 30 minutes 1/6

Gate Delay Model. Estimating Delays. Effort Delay. Gate Delay. Computing Logical Effort. Logical Effort

Digital Integrated Circuit (IC) Layout and Design

Understanding Logic Design

Module 7 : I/O PADs Lecture 33 : I/O PADs

Here we introduced (1) basic circuit for logic and (2)recent nano-devices, and presented (3) some practical issues on nano-devices.

COMBINATIONAL CIRCUITS

A 1-GSPS CMOS Flash A/D Converter for System-on-Chip Applications

Binary Division. Decimal Division. Hardware for Binary Division. Simple 16-bit Divider Circuit

High Speed and Efficient 4-Tap FIR Filter Design Using Modified ETA and Multipliers

An Effective Deterministic BIST Scheme for Shifter/Accumulator Pairs in Datapaths

Computer System: User s View. Computer System Components: High Level View. Input. Output. Computer. Computer System: Motherboard Level

ISSCC 2003 / SESSION 13 / 40Gb/s COMMUNICATION ICS / PAPER 13.7

An Efficient RNS to Binary Converter Using the Moduli Set {2n + 1, 2n, 2n 1}

Low Power and Reliable SRAM Memory Cell and Array Design

Leakage Power Reduction Using Sleepy Stack Power Gating Technique

ON SUITABILITY OF FPGA BASED EVOLVABLE HARDWARE SYSTEMS TO INTEGRATE RECONFIGURABLE CIRCUITS WITH HOST PROCESSING UNIT

Binary Adders: Half Adders and Full Adders

Lecture 5: Logical Effort

Static-Noise-Margin Analysis of Conventional 6T SRAM Cell at 45nm Technology

TRUE SINGLE PHASE CLOCKING BASED FLIP-FLOP DESIGN

Combinational Logic Design

Adder.PPT(10/1/2009) 5.1. Lecture 13. Adder Circuits

5V Tolerance Techniques for CoolRunner-II Devices

Memory Elements. Combinational logic cannot remember

Performance of Flip-Flop Using 22nm CMOS Technology

Low Power AMD Athlon 64 and AMD Opteron Processors

ASYNCHRONOUS COUNTERS

3.Basic Gate Combinations

Circuits and Boolean Expressions

Semiconductor Memories

INTRODUCTION TO DIGITAL SYSTEMS. IMPLEMENTATION: MODULES (ICs) AND NETWORKS IMPLEMENTATION OF ALGORITHMS IN HARDWARE

ECE124 Digital Circuits and Systems Page 1

True Single Phase Clocking Flip-Flop Design using Multi Threshold CMOS Technique

The components. E3: Digital electronics. Goals:

NAND Flash FAQ. Eureka Technology. apn5_87. NAND Flash FAQ

Flip-Flops, Registers, Counters, and a Simple Processor

Lecture 8: Binary Multiplication & Division

Power Reduction Techniques in the SoC Clock Network. Clock Power

. HIGH SPEED .LOW POWER DISSIPATION .COMPATIBLE WITH TTL OUTPUTS M54HCT27 M74HCT27 TRIPLE 3-INPUT NOR GATE. tpd = 9 ns (TYP.

Upon completion of unit 1.1, students will be able to

CMOS Thyristor Based Low Frequency Ring Oscillator

FPGA. AT6000 FPGAs. Application Note AT6000 FPGAs. 3x3 Convolver with Run-Time Reconfigurable Vector Multiplier in Atmel AT6000 FPGAs.

Title : Analog Circuit for Sound Localization Applications

MAS.836 HOW TO BIAS AN OP-AMP

COMBINATIONAL and SEQUENTIAL LOGIC CIRCUITS Hardware implementation and software design

Digital Circuit Design

1.1 Silicon on Insulator a brief Introduction

A 10,000 Frames/s 0.18 µm CMOS Digital Pixel Sensor with Pixel-Level Memory

Innovative improvement of fundamental metrics including power dissipation and efficiency of the ALU system

High Intensify Interleaved Converter for Renewable Energy Resources

Introduction to CMOS VLSI Design

Transcription:

INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 DESIGN OF 16-BIT CARRY-LOOKAHEAD ADDER AND 8-BIT KOGGE-STONE ADDER USING GDI LOGIC Dharani.A 1, Dr.M.Jagadeeswari 2 1 P.G Scholar, Department of VLSI Design, email2dharani@yahoo.co.in 2 Professor, Department of VLSI Design, jagadee_raj@rediffmail.com Abstract Addition is a fundamental arithmetic operation and is the base of many other commonly used arithmetic operations such as subtraction, multiplication, division and, multiply and accumulate (MAC) in most of these systems. The 1-bit Full Adder cell is the building block of an arithmetic unit of a system. There are several full adder designs designed so far to improve the performance. However, each design suffers from specific disadvantage. The adder design which has good driving capability acquires more power and the design which consumes less power will have more delay. This paper proposes Gate Diffusion Input (GDI) Logic based 16-bit carry-lookahead adder and 8-bit Kogge-stone adder which consumes low power, operates at high speed and has less area. Keywords: GDI Structure, Low power, Carry-lookahead adder, Kogge-stone adder. 1. Introduction The demand and popularity of portable electronics is driving designers to strive for smaller silicon area, higher speeds, longer battery life, and more reliability. Power consumption and area reduction of logic and memory have become primary focuses of attention in VLSI digital design. Power is the limiting factor in both high performance systems and portable applications. Die area directly affects the device size and cost. Since the introduction of the standard CMOS Logic in early 80s, many design solutions have been proposed to improve power dissipation, area and performance of digital VLSI chips. Gate Diffusion Input (GDI) design methodology was introduced as a promising alternative to Static CMOS Logic. Originally proposed for fabrication in Silicon on Insulator (SOI) and twin-well CMOS processes, GDI methodology allowed implementation of a wide range of complex logic functions using only two transistors. It was shown, that area and dynamic power of GDI combinatorial and sequential logic were significantly reduced, as compared to standard CMOS implementations. D h a r a n i. A e t a l Page 136

2. Review of Existing Techniques 2.1 Carry-Lookahead Adder (CLA) CLA is used in most ALU designs. It is faster especially in adding large number of bits.. A carry-lookahead adder improves speed by reducing the amount of time required to determine carry bits. It can be contrasted with the simpler, but usually slower, ripple carry adder for which the carry bit is calculated alongside the sum bit, and each bit must wait until the previous carry has been calculated to begin calculating its own result and carry bits The carry-lookahead adder calculates one or more carry bits before the sum, which reduces the wait time to calculate the result of the larger value bit. Carry-Lookahead Adder is able to generate carries before the sum is produced using propagate and generate logics to make addition much faster. Generate, G i = A i AND B i (1) Propagate, Pi = (A i XOR B i ) (2) The general architecture of 16-bit CLA is shown in Figure 1. Carry-Lookahead adder and Kogge-stone adder were previously designed using static CMOS logic designs. The static digital designs are mostly based on CMOS NAND and NOR gates. The previously proposed designs suffer from high power consumption and more area [Jagannath samanta et al., 2013]. The proposed GDI based carry-lookahead adder is compared with a carry-lookahead adder designed using ULPD (Ultra Low Power Diode) and full swing transistor based carry-lookahead adder design. The CLA adder designs have various modules. The base module will provide propagate and generate as outputs by accepting two inputs. These base propagate and generate outputs will act as inputs to another block (PG) in the hierarchy. Local Carry Generate module is built after this block using base propagate and generate outputs and by using input carry. A 2-bit CLA can be made by using PG and LCG (Local Carry Generate) modules. ULPD based CLA uses Ultra Low Power Diode which is used to provide full swing and to obtain low power. This diode consists of an NMS and PMOS whose gates are connected in series [David Levacq et al., 2007]. This diode reduces leakage current. ULPD is shown in Figure 2 [Hassoune. I et.,al 2010]. Full Swing transistor based CLA uses F1 and F2 gates which are shown in Figure 3. These gates use swing restoring transistors to improve the output swing. These transistors will have a diffusion input as nmos for F1 and pmos for F2. These two adder designs consume more power. Figure 1: General architecture of CLA D h a r a n i. A e t a l Page 137

Figure 2: ULPD Figure 3(a): F1 gate Figure 3(b): F2 gate 2.2 Kogge-Stone Adder It is the fastest adder used in industries. It is the parallel prefix form of carry-lookahead adder. It consists of black cell and grey cell [Adilakshmi siliveru et al., 2013]. The general architecture of 8-bit Kogge-Stone adder is shown in Figure 4. There are three stages of operation. 2.2.1 Preprocessing stage In this stage, propagate and generate terms are obtained. Propagate, P = A XOR B (3) Generate, G = A AND B (4) 2.2.2 Carry-Lookahead network In this network, (Pij, Gij) is generated from (Gi, Pi) and (Gj, Pj) P i:j = P i:k+1 AND P k:j (5) G i:j = G i:k+1 OR (P i:k+1 AND G k:j ) (6) 2.2.3 Post Processing Sum and carry are obtained. Sum = Pi XOR Carry in (7) Carry= G i: 0 OR (Cin AND P i: 0 ) (8) D h a r a n i. A e t a l Page 138

3. Overview of GDI cell Figure 4: General architecture of 8-bit Kogge-Stone adder The basic GDI cell [Arkadiy Morgenshtein et al., 2002] is shown in Figure 5 while the Truth-Table of basic GDI cell is shown in Table 1. At first glance, the basic cell reminds one of the standard CMOS inverter, but there are some important differences. The GDI cell contains three inputs: G (common gate input of NMOS and PMOS), P (input to the source/drain of PMOS) and N (input to the source/ drain of NMOS).Bulks of both NMOS and PMOS are linked to N or P, so it can arbitrarily be biased at contrast to a CMOS inverter. These features give the GDI cell two extra input pins to use, which make the GDI design more flexible than usual CMOS design. Figure 5: Basic GDI Cell Table 1: Truth table of GDI cell N P G Out Function 0 B A B 1 A A B A B F1 F2 B B A A B OR 1 0 A AB AND C B A AB AC MUX 0 1 A A NOT Most of these functions are complex (6 12 transistors) in CMOS, as well as in standard PTL implementations, but very simple (only two transistors per function) in the GDI design method. GDI is suitable for designing fast, Low-Power circuits, using a reduced number of transistors (as compared to CMOS and Pass Transistor D h a r a n i. A e t a l Page 139

Logic techniques), while improving logic level swing and static power characteristics [Jiang.Y et al., 2004, Lee P.M et al., 2007 and Narendra Lakhani et al., 2013]. 4. Proposed Adder Circuits 4.1 Carry-Lookahead Adder (CLA) The base pg unit is implemented using (9) and (10) p = a xor b, GDI XOR gate (9) g = a and b = (10) The PG unit is implemented using (11) and (12) P = p 1 p 0 = (11) G = g 1 + g 0 p 1 = (12) The local carry generate block (LCG) is implemented according to (13) Cloc = g 0 + p 0 c in = (13) Figure 6: 2-bit CLA Figure 6 shows 2-bit CLA block consisting of PG and LCG unit. The global carry generate block is shown in Figure 7 and the output is implemented according to (14) Cout = G1 + P1G0 + P1P0Cin = = ) = (14) 4.2 Kogge-Stone Adder Figure 7: Last CLA [Arkadiy Morgenshtein et al., 2013] Kogge-stone adder generates carry signals in O (log n) time. It is the fastest adder design and is the common design for high performance adders in industry. It can also be used to implement other functions [Madhu Thakur et al., 2013]. Kogge-stone adder consists of black cell and grey cell. The black cell shown in Figure 8 D h a r a n i. A e t a l Page 140

consists of two AND gates and an OR gate which will produce propagate and generate terms. The Grey cell shown in Figure 9 consists of an AND gate and an OR gate to provide generate term. Figure 8: Black cell 5. Simulation Results and Analysis Figure 9: Grey cell 5.1 simulation Results The simulation result is similar to that of one bit full adder. When A, C are high and B is low, SUM is low and COUT is high. When any one of the three inputs is high, SUM will be high. 5.2 Analysis Table 2 shows the analysis report of various CLA adder designs. Table 3 shows the analysis report of various Kogge-Stone adder designs. From the tables, it is obvious that GDI based CLA and GDI based Kogge-Stone adders have low power, less delay, utilizes minimum number of transistors and thereby has reduced area. Table 2: Analysis Report of various CLA adders Various CLA adder designs Power (pw) Delay (ps) PDP(J) No. of components Full swing transistor 2133.72 203.10 433358.73 958 based CLA ULPD based CLA 80.07 205.43 16450.81 890 GDI based CLA 69.77 127.15 8871.56 658 The graphical representations for power, delay and PDP for various CLA adder designs are shown in Figure 10, Figure 11 and Figure 12 respectively. D h a r a n i. A e t a l Page 141

Figure 10: Comparison result of power dissipation (various CLA adder designs) Figure 11: Comparison result of delay (various CLA adder designs) Figure 12: Comparison result of PDP (various CLA adder designs) Various Kogge stone adder designs Table 3: Analysis Report of various Kogge-Stone adders Power (pw) Delay (ps) PDP (J) No. of components Primitive gate based Kogge 42.21 547.11 23095.31 588 stone adder Transistor based Kogge stone 37.98 563.38 21400.77 442 adder GDI based Kogge stone adder 20.85 471.57 9835.29 390 D h a r a n i. A e t a l Page 142

The graphical representations for power, delay and PDP for various Kogge-Stone adder designs are shown in Figure 13, Figure 14 and Figure 15 respectively. Figure 13: Comparison result of power dissipation (various Kogge stone adder designs) Figure 14: Comparison result for delay (various Kogge-Stone adder designs) 6. Conclusion Figure 15: Comparison result of PDP ((various Kogge stone adder designs) The proposed GDI based CLA adder and GDI based kogge stone adder utilize GDI structure as its main cell which is proved to be one of the lowest power consumer cells that not only is suitable for designing fast, Low- Power circuits but also improves logic level swing.. After analyzing the performance of GDI based CLA adder and GDI based Kogge stone adder using Mentor Graphics EDA tool under 180 nm technology, GDI based CLA is found to occupy low power, less delay and less number of transistors compared to ULPD based CLA and full swing transistor based CLA, GDI based Kogge stone is found to occupy low power, less area and less number of transistors compared to primitive gates based and transistor based Kogge-Stone adders. The proposed adder designs can be applied to any operation used in VLSI applications such as DSP (Digital Signal Processing), micro processors, video and image processors. The work can be further extended to any benchmark circuits, where they can be converted into standard cells and realized in an Integrated Circuit. D h a r a n i. A e t a l Page 143

References [1] Adilakshmi siliveru and Bharathi M., 2013, Design of Kogge -Stone and Brent-kung adders using degenerate pass transistor logic,international Journal of Emerging Science and Engineering, 1(4), 2319 6378. [2] Arkadiy Morgenshtein, Fish A and Israel Wagner A., 2002, Gate-diffusion input (GDI): a power-efficient method for digital combinatorial circuits, IEEE Transactions on VLSI Systems, 566 581. [3] Arkadiy Morgenshtein, Viacheslav Yuzhaninov, Alexey Kovshilovsky and Alexander Fish, 2013, Full-Swing Gate Diffusion Input logic Case-study of low-power CLA adder design, Integration, the VLSI Journal. [4] David Levacq, Vincent Dessard and Denis Flandre, 2007, Low leakage SOI CMOS static memory cell with ultra low power diode, IEEE Journal of solid-state circuits, vol. 42, no. 3. [5] Hassoune I, Flandre D, O Connor I and Legat J. D., 2010, ULPFA: a new efficient design of a power-aware full adder,ieee Transactions on Circuits and Systems I: Regular Papers 57(8). [6] Jagannath samanta, Mousam Halder and Bishnu Prasad De, 2013, Performance analysis of high speed low power carry look ahead adder using differential logic styles, International Journal of Soft Computing and Engineering, 2(6), 2231-2307. [7] Jiang Y, Al-Sheraidah A, Wang Y, Sha E and Chung J, 2004, A novel multiplexer-based low-power full adder, IEEE Transactions on Circuits and Systems II: Express Briefs 51 (7). [8] Lee P.M, Hsu C.H and Hung Y.H., 2007, Novel 10-T full adders realized by GDI structure, in: In Proceedings of the IEEE International Symposium on Integrated Circuits. [9] Madhu Thakur, Javed Ashraf, 2013, Design of Braun Multiplier with Kogge Stone Adder & its Implementation on FPGA, International Journal of Scientific & Engineering Research, Volume 3, Issue 10, October-2012 1 ISSN 2229-5518. [10] Narendra Lakhani and Kiran gupta, 2013, Efficient 8x8 Multiplier Based on Gate Diffusion Input Technique, International Journal of Engineering Research & Technology, 2(7), 2278-0181. D h a r a n i. A e t a l Page 144