Chapter 14 Arithmetic Circuits (I): Adder Designs Rev /12/2003

Slides:



Advertisements
Similar presentations
Feb. 17, 2011 Midterm overview Real life examples of built chips
Advertisements

Introduction So far, we have studied the basic skills of designing combinational and sequential logic using schematic and Verilog-HDL Now, we are going.
CPE 626 CPU Resources: Adders & Multipliers Aleksandar Milenkovic Web:
Chapter 9 Computer Design Basics. 9-2 Datapaths Reminding A digital system (or a simple computer) contains datapath unit and control unit. Datapath: A.
EE141 © Digital Integrated Circuits 2nd Arithmetic Circuits 1 Digital Integrated Circuits A Design Perspective Arithmetic Circuits Jan M. Rabaey Anantha.
EE141 Adder Circuits S. Sundar Kumar Iyer.
Digital Integrated Circuits A Design Perspective
CSE-221 Digital Logic Design (DLD)
EE141 © Digital Integrated Circuits 2nd Arithmetic Circuits 1 [Adapted from Rabaey’s Digital Integrated Circuits, ©2002, J. Rabaey et al.]
S. Reda EN160 SP’07 Design and Implementation of VLSI Systems (EN0160) Lecture 28: Datapath Subsystems 2/3 Prof. Sherief Reda Division of Engineering,
Digital Integrated Circuits 2e: Chapter Copyright  2002 Prentice Hall PTR, Adapted by Yunsi Fei ECE 300 Advanced VLSI Design Fall 2006 Lecture.
VLSI Arithmetic Adders Prof. Vojin G. Oklobdzija University of California
CSE477 VLSI Digital Circuits Fall 2002 Lecture 20: Adder Design
Introduction to CMOS VLSI Design Lecture 11: Adders
Introduction to VLSI Circuits and Systems, NCUT 2007 Chapter 12 Arithmetic Circuits in CMOS VLSI Introduction to VLSI Circuits and Systems 積體電路概論 賴秉樑 Dept.
Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Topics n Shifters. n Adders and ALUs.
S. Reda EN1600 SP’08 Design and Implementation of VLSI Systems (EN1600) Lecture 25: Datapath Subsystems 1/4 Prof. Sherief Reda Division of Engineering,
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE VLSI Circuit Design Lecture 23 - Subsystem.
Digital Integrated Circuits© Prentice Hall 1995 Arithmetic Arithmetic Building Blocks.
Fall 2008EE VLSI Design I - © Kia Bazargan 1 EE 5323 – VLSI Design I Kia Bazargan University of Minnesota Adders.
Spring 2006EE VLSI Design II - © Kia Bazargan 68 EE 5324 – VLSI Design II Kia Bazargan University of Minnesota Part II: Adders.
Lecture 17: Adders.
Chapter 5 Arithmetic Logic Functions. Page 2 This Chapter..  We will be looking at multi-valued arithmetic and logic functions  Bitwise AND, OR, EXOR,
VLSI Digital System Design 1.Carry-Save, 2.Pass-Gate, 3.Carry-Lookahead, and 4.Manchester Adders.
Adders. Full-Adder The Binary Adder Express Sum and Carry as a function of P, G, D Define 3 new variable which ONLY depend on A, B Generate (G) = AB.
Lec 17 : ADDERS ece407/507.
Introduction to CMOS VLSI Design Lecture 11: Adders David Harris Harvey Mudd College Spring 2004.
Bar Ilan University, Engineering Faculty
Evolution in Complexity Evolution in Transistor Count.
VLSI Arithmetic Adders & Multipliers Prof. Vojin G. Oklobdzija University of California
Abdullah Aldahami ( ) Feb26, Introduction 2. Feedback Switch Logic 3. Arithmetic Logic Unit Architecture a.Ripple-Carry Adder b.Kogge-Stone.
Arithmetic Building Blocks
EE141 © Digital Integrated Circuits 2nd Arithmetic Circuits 1 Digital Integrated Circuits A Design Perspective Arithmetic Circuits Reference: Digital Integrated.
Arithmetic Building Blocks
Advanced VLSI Design Unit 05: Datapath Units. Slide 2 Outline  Adders  Comparators  Shifters  Multi-input Adders  Multipliers.
1/8/ L3 Data Path DesignCopyright Joanne DeGroat, ECE, OSU1 ALUs and Data Paths Subtitle: How to design the data path of a processor.
CSE115: Digital Design Lecture 20: Comparators, Adders and Subtractors Faculty of Engineering.
Nov 10, 2008ECE 561 Lecture 151 Adders. Nov 10, 2008ECE 561 Lecture 152 Adders Basic Ripple Adders Faster Adders Sequential Adders.
Modern VLSI Design 4e: Chapter 6 Copyright  2008 Wayne Wolf Topics n Shifters. n Adders and ALUs.
COE 202: Digital Logic Design Combinational Circuits Part 2 KFUPM Courtesy of Dr. Ahmad Almulhem.
CDA 3101 Fall 2013 Introduction to Computer Organization The Arithmetic Logic Unit (ALU) and MIPS ALU Support 20 September 2013.
EE 466/586 VLSI Design Partha Pande School of EECS Washington State University
EE141 © Digital Integrated Circuits 2nd Arithmetic Circuits 1 Digital Integrated Circuits A Design Perspective Arithmetic Circuits Jan M. Rabaey Anantha.
Digital Integrated Circuits© Prentice Hall 1995 Arithmetic Arithmetic Building Blocks.
EE466: VLSI Design Lecture 13: Adders
CMPEN 411 VLSI Digital Circuits Spring 2009 Lecture 19: Adder Design
C-H1 Lecture Adders Half adder. C-H2 Full Adder si is the modulo- 2 sum of ci, xi, yi.
CSE477 VLSI Digital Circuits Fall 2002 Lecture 20: Adder Design
1. 2 Figure 10.1 Truth table and schematic diagram for a binary half-adder Simple Adders Half-adder.
EE141 Arithmetic Circuits 1 Chapter 14 Arithmetic Circuits Rev /12/2003 Rev /05/2003.
Topic: N-Bit parallel and Serial adder
EE141 Arithmetic Circuits 1 Chapter 14 Arithmetic Circuits Rev /12/2003.
Combinational Circuits
Lecture 12 Logistics Last lecture Today HW4 due today Timing diagrams
Prof. An-Yeu Wu Undergraduate VLSI Course Updated: May 24, 2002
Subtitle: How to design the data path of a processor.
Swamynathan.S.M AP/ECE/SNSCT
CSE Winter 2001 – Arithmetic Unit - 1
VLSI Arithmetic Adders & Multipliers
Lecture 14 Logistics Last lecture Today
Digital Integrated Circuits A Design Perspective
Review: Basic Building Blocks
Part III The Arithmetic/Logic Unit
Lecture 14 Logistics Last lecture Today
Combinational Circuits
Prof. An-Yeu Wu Undergraduate VLSI Course Updated: May 24, 2002
Prof. An-Yeu Wu Undergraduate VLSI Course Updated: May 24, 2002
Arithmetic Building Blocks
Arithmetic Circuits.
Chapter 14 Arithmetic Circuits (II): Multiplier Rev /12/2003
Presentation transcript:

Chapter 14 Arithmetic Circuits (I): Adder Designs Rev. 1.0 05/12/2003 EE141 Chapter 14 Arithmetic Circuits (I): Adder Designs Rev. 1.0 05/12/2003 Rev. 2.0 06/05/2003 Rev. 2.1 06/12/2003

A Generic Digital Processor

Building Blocks for Digital Architectures Arithmetic and Unit - Bit-sliced datapath (adder, multiplier, shifter, comparator, etc.) Memory - RAM, ROM, Buffers, Shift registers Control - Finite state machine (PLA, random logic.) - Counters Interconnect - Switches - Arbiters - Bus

Intel Microprocessor Itanium has 6 integer execution units like this

Bit-Sliced Design

Itanium Integer Datapath Fetzer, Orton, ISSCC’02

Adders

Several Implementations of Adders One-Bit Full Adder (Cell) Carry-Ripple Adder Bit-Serial Adder Mirror Adder Transmission-Gate Adder Manchester Adder Carry lookahead Adder Carry-Select Adder

Full-Adder (FA) Generate (G) = AB Propagate (P) = A Å B Delete = A B

Boolean Function of Binary Full-Adder CMOS Implementation

Express Sum and Carry as a function of P, G, D Define 3 new variable which ONLY depend on A, B Generate (G) = AB Propagate (P) = A Å B Delete = A B Can also derive expressions for S and C based on D and P o Note that we will be sometimes using an alternate definition for Propagate (P) = A + B

Carry-Ripple Adder Critical Path FA A B S 1 2 3 C i ,0 o ( = ,1 ) ,2 ,3 Critical Path Worst-case delay is linear with the number of bits tadder = (N-1)tcarry + tsum td = O(N) Propagation delay (or critical path) is the worst-case delay over all possible input patterns A= 0001, B=1111, trigger the worst-case delay A: 0  1, and B= 1111 fixed to set up the worst-case delay transition.

Complimentary Static CMOS Full Adder 28 Transistors Logic effort of Ci is reduced to 2 (c.f., A and B signals) Ci is late arrival signal  near the output signal Co needs to be inverted  Slow down the ripple propagate

Inversion Property

Minimize Critical Path by Reducing Inverting Stages Exploit Inversion Property Reduce One inverter delay in each Full-adder (FA) unit

Subtractor

Bit-Serial Adder A B

A Better Structure: The Mirror Adder Exploring the “Self-Duality” of the Sum and Carry functions

Mirror Adder: Stick Diagram

Mirror Adder Design The NMOS and PMOS chains are completely symmetrical A maximum of two series transistors can be observed in the carry-generation circuitry  for good speed. When laying out the cell, the most critical issue is the minimization of the capacitance at node Co. The capacitance at node Co is composed of four diffusion capacitances, two internal gate capacitances, and six gate capacitances in the connecting adder cell . The transistors connected to Ci are placed closest to the output.

Transmission-Gate 6T XOR Gate Truth Table A B F 1 A=0: Pass B Signal A=1: Inverting B Signal

Transmission-Gate Full Adder (24T) Same delay for Sum and Carry  Multiplier design

Manchester Carry-Chain Adder Static Circuits Dynamic Circuits

Manchester Carry Chain

Manchester Carry-Chain Adder

Manchester Adder Circuits (Weste) Dynamic Static Mux- based 4-bit Section sum<n>

Manchester Adder Circuits (Cont.) Dynamic stage When CLK is low, the output node is pre-charged by the p pull-up transistor. When CLK goes high, the pull-down transistor turns on. If carry generate G=AB is true  the output node discharges. If carry propagate P=A+B is true  a previous carry may be coupled to the output node, conditionally discharging it. Static stage This requires P to be generated as AB The Manchester adder stage improves on the carry-lookahead implementation.

Carry-Bypass Adder Design FA P G 1 2 3 C o,3 o,2 o,1 o,0 i,0 M u l t i p e x r BP=P o Also called Carry-Skip Idea: If ( ) else Kill or Generate then C = C O,3 I,0

Manchester Adder Circuits (Cont.) Wired OR The control signals T1,T2,and T3 shown in Fig6(b) are generated by: T1 = -(P0P1P2)P3 T2 = -P3 T3 = P0P1P2P3 Fig6. Manchester adder with carry bypass: (a) simple (b) conflict free

Manchester Adder Circuits (Cont.) The worst case propagation time of a Manchester adder can be improved by bypassing the four stages if all carry-propagate signals are true. Fig. 6(b) uses a “conflict -free” bypass circuit, which improves the speed by using a 3-input multiplexer that prevents conflicts at the wired OR node in the adder. In Fig. 6(b), the inverter presented on the Cin signal has been moved to the center of the carry chain to improve speed.

Carry-Bypass Adder (cont.) tadder = tsetup + Mtcarry + (N/M-1)tbypass + (M-1)tcarry + tsum M bits form a Section  (N/M) Bypass Stages

Carry Ripple versus Carry Bypass Wordlength (N) > 4~8 is better for Bypass Adder

Carry-Select Adder Setup "0" Carry Propagation "1" Carry Propagation 2-to-1 Multiplexer Sum Generation C o,k-1 o,k+3 "0" "1" P,G Carry Vector

Carry-Select Adder Fig7. Carry-select adder:(a) basic architecture (b) 32-bit carry-select adder example

Carry Select Adder: Critical Path

Linear Carry Select

Square Root Carry Select N-bit adder with P stages: 1st stage adds M bits, 2nd has (M+1) bits 

Adder Delays - Comparison

Carry-Lookahead Adders The linear growth of adder carry-delay with the size of the input word for n-bit adder maybe improved by calculation the carries to each stage in parallel.

Carry-Lookahead Adders (cont’d) Carry of the ith stage --- Expanding: For four stages, the appropriate term: C0= G0 + P0CI C1= G1 + P1G0 + P1P0CI C2= G2 + P2G1 + P2P1G0 + P2P1P0CI C3= G3 + P3G2 + P3P2G1 + P3P2P1G0 + P3P2P1P0CI Fig1. Generic carry-lookahead adder

Look-ahead Adder - Basic Idea

Static CMOS Circuits Expanding Lookahead equations: All the way:

Dynamic CMOS Circuits The worst-case delay path in this circuit has six n-transistor in series.

Carry-Lookahead Adders Size and fan-in of the gates needed to implement this carry-lookahead scheme can clearly get out of hand Number of stages of lookahead is usually limited to about 4. The circuit and layout are quite irregular compared with ripple adder designs.

Summary Datapath designs are fundamentals for high-speed DSP, Multimedia, Communication digital VLSI designs. Most adders, multipliers, division circuits are now available in Synopsys Designware under different area/speed constraint. For details, check “Advanced VLSI” notes, or “Computer Arithmetic” textbooks