Introduction to CMOS VLSI Design Lecture 11: Adders

Slides:

Advertisements

Similar presentations

Introduction So far, we have studied the basic skills of designing combinational and sequential logic using schematic and Verilog-HDL Now, we are going.

Advertisements

CPE 626 CPU Resources: Adders & Multipliers Aleksandar Milenkovic Web:

EE141 © Digital Integrated Circuits 2nd Arithmetic Circuits 1 Digital Integrated Circuits A Design Perspective Arithmetic Circuits Jan M. Rabaey Anantha.

Institute of Applied Microelectronics and Computer Engineering College of Computer Science and Electrical Engineering, University of Rostock Slide 1 Spezielle.

Fast Adders See: P&H Chapter 3.1-3, C Goals: serial to parallel conversion time vs. space tradeoffs design choices.

Fast Adders See: P&H Chapter 3.1-3, C Goals: serial to parallel conversion time vs. space tradeoffs design choices.

Lecture 17: Adders.

Design and Implementation of VLSI Systems (EN1600) Lecture 27: Datapath Subsystems 3/4 Prof. Sherief Reda Division of Engineering, Brown University Spring.

EE141 © Digital Integrated Circuits 2nd Arithmetic Circuits 1 [Adapted from Rabaey’s Digital Integrated Circuits, ©2002, J. Rabaey et al.]

1 CS 140 Lecture 14 Standard Combinational Modules Professor CK Cheng CSE Dept. UC San Diego Some slides from Harris and Harris.

S. Reda EN160 SP’07 Design and Implementation of VLSI Systems (EN0160) Lecture 28: Datapath Subsystems 2/3 Prof. Sherief Reda Division of Engineering,

VLSI Arithmetic Adders Prof. Vojin G. Oklobdzija University of California

CSE477 VLSI Digital Circuits Fall 2002 Lecture 20: Adder Design

1 Design of a Parallel-Prefix Adder Architecture with Efficient Timing-Area Tradeoff Characteristic Sabyasachi Das University of Colorado, Boulder Sunil.

ECE C03 Lecture 61 Lecture 6 Arithmetic Logic Circuits Hai Zhou ECE 303 Advanced Digital Design Spring 2002.

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,

Lecture 8 Arithmetic Logic Circuits

Design and Implementation of VLSI Systems (EN1600) Lecture 26: Datapath Subsystems 2/4 Prof. Sherief Reda Division of Engineering, Brown University Spring.

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.

ECE 301 – Digital Electronics

Lecture 12b: Adders. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 2 Generate / Propagate  Equations often factored into G and P  Generate and.

Spring 2002EECS150 - Lec10-cl1 Page 1 EECS150 - Digital Design Lecture 10 - Combinational Logic Circuits Part 1 Feburary 26, 2002 John Wawrzynek.

Chapter 5 Arithmetic Logic Functions. Page 2 This Chapter..  We will be looking at multi-valued arithmetic and logic functions  Bitwise AND, OR, EXOR,

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.

Parallel Prefix Adders A Case Study

Introduction to CMOS VLSI Design Lecture 11: Adders David Harris Harvey Mudd College Spring 2004.

Bar Ilan University, Engineering Faculty

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.

ECE2030 Introduction to Computer Engineering Lecture 12: Building Blocks for Combinational Logic (3) Adders/Subtractors, Parity Checkers Prof. Hsien-Hsin.

Introduction to Computer Organization and Architecture Lecture 10 By Juthawut Chantharamalee wut_cha/home.htm.

Arithmetic Building Blocks

Arithmetic Building Blocks

55:035 Computer Architecture and Organization Lecture 5.

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.

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

Outline Introduction CMOS devices CMOS technology CMOS logic structures CMOS sequential circuits CMOS regular structures.

Basic Addition Review Basic Adders and the Carry Problem

Nov 10, 2008ECE 561 Lecture 151 Adders. Nov 10, 2008ECE 561 Lecture 152 Adders Basic Ripple Adders Faster Adders Sequential Adders.

July 2005Computer Architecture, The Arithmetic/Logic UnitSlide 1 Part III The Arithmetic/Logic Unit.

Modern VLSI Design 4e: Chapter 6 Copyright  2008 Wayne Wolf Topics n Shifters. n Adders and ALUs.

Computing Systems Designing a basic ALU.

درس مدارهای منطقی دانشگاه قم مدارهای منطقی محاسباتی تهیه شده توسط حسین امیرخانی مبتنی بر اسلایدهای درس مدارهای منطقی دانشگاه.

FPGA-Based System Design: Chapter 4 Copyright  2003 Prentice Hall PTR Topics n Number representation. n Shifters. n Adders and ALUs.

Spring C:160/55:132 Page 1 Lecture 19 - Computer Arithmetic March 30, 2004 Sukumar Ghosh.

1 Lecture 12 Time/space trade offs Adders. 2 Time vs. speed: Linear chain 8-input OR function with 2-input gates Gates: 7 Max delay: 7.

Unrolling Carry Recurrence

Digital Integrated Circuits© Prentice Hall 1995 Arithmetic Arithmetic Building Blocks.

Computer Architecture Lecture 16 Fasih ur Rehman.

EE466: VLSI Design Lecture 13: Adders

CMPEN 411 VLSI Digital Circuits Spring 2009 Lecture 19: Adder Design

1 Carry Lookahead Logic Carry Generate Gi = Ai Bi must generate carry when A = B = 1 Carry Propagate Pi = Ai xor Bi carry in will equal carry out here.

CSE477 VLSI Digital Circuits Fall 2002 Lecture 20: Adder Design

Logical Effort of Higher Valency Adders David Harris Harvey Mudd College November 2004.

Arithmetic-Logic Units. Logic Gates AND gate OR gate NOT gate.

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.

Basic Addition Review Basic Adders and the Carry Problem Carry Propagation Speedup Speed/Cost Tradeoffs Two-operand Versus Multi-operand Adders.

Introduction to VLSI Design Datapath

EE141 Arithmetic Circuits 1 Chapter 14 Arithmetic Circuits Rev /12/2003.

Somet things you should know about digital arithmetic:

CSE Winter 2001 – Arithmetic Unit - 1

CSE 140 Lecture 14 Standard Combinational Modules

Presentation transcript:

Introduction to CMOS VLSI Design Lecture 11: Adders David Harris Harvey Mudd College Spring 2004

Outline Single-bit Addition Carry-Ripple Adder Carry-Skip Adder Carry-Lookahead Adder Carry-Select Adder Carry-Increment Adder Tree Adder 11: Adders

Single-Bit Addition Half Adder Full Adder A B Cout S 1 A B C Cout S 1 1 A B C Cout S 1 11: Adders

Single-Bit Addition Half Adder Full Adder A B Cout S 1 A B C Cout S 1 1 A B C Cout S 1 11: Adders

PGK For a full adder, define what happens to carries Generate: Cout = 1 independent of C G = Propagate: Cout = C P = Kill: Cout = 0 independent of C K = 11: Adders

PGK For a full adder, define what happens to carries Generate: Cout = 1 independent of C G = A • B Propagate: Cout = C P = A  B Kill: Cout = 0 independent of C K = ~A • ~B 11: Adders

Full Adder Design I Brute force implementation from eqns 11: Adders

Full Adder Design II Factor S in terms of Cout S = ABC + (A + B + C)(~Cout) Critical path is usually C to Cout in ripple adder 11: Adders

Layout Clever layout circumvents usual line of diffusion Use wide transistors on critical path Eliminate output inverters 11: Adders

Full Adder Design III Complementary Pass Transistor Logic (CPL) Slightly faster, but more area 11: Adders

Full Adder Design IV Dual-rail domino Very fast, but large and power hungry Used in very fast multipliers 11: Adders

Carry Propagate Adders N-bit adder called CPA Each sum bit depends on all previous carries How do we compute all these carries quickly? 11: Adders

Carry-Ripple Adder Simplest design: cascade full adders Critical path goes from Cin to Cout Design full adder to have fast carry delay 11: Adders

Adder is Symmetric 11: Adders

Inversions Critical path passes through majority gate Built from minority + inverter Eliminate inverter and use inverting full adder 11: Adders

Generate / Propagate Define 3 new variable which ONLY depend on A, B Generate (G) = AB Propagate (P) = A Å B Kill = A B

Generate / Propagate Equations often factored into G and P Generate and propagate for groups spanning i:j Base case Sum: 11: Adders

Generate / Propagate 11: Adders

Generate / Propagate Equations often factored into G and P Generate and propagate for groups spanning i:j Base case Sum: 11: Adders

PG Logic 11: Adders

Carry-Ripple Revisited 11: Adders

Carry-Ripple PG Diagram 11: Adders

Carry-Ripple PG Diagram 11: Adders

PG Diagram Notation 11: Adders

Carry Chain Designs 11: Adders

Manchester Carry Chain 11: Adders

Carry-Skip Adder Carry-ripple is slow through all N stages Carry-skip allows carry to skip over groups of n bits Decision based on n-bit propagate signal 11: Adders

Carry-Skip PG Diagram For k n-bit groups (N = nk) 11: Adders

Carry-Skip PG Diagram For k n-bit groups (N = nk) 11: Adders

Variable Group Size Delay grows as O(sqrt(N)) 11: Adders

Carry-Lookahead Adder Carry-lookahead adder computes Gi:0 for many bits in parallel. Uses higher-valency cells with more than two inputs. 11: Adders

CLA PG Diagram 11: Adders

Higher-Valency Cells 11: Adders

Carry-Select Adder Trick for critical paths dependent on late input X Precompute two possible outputs for X = 0, 1 Select proper output when X arrives Carry-select adder precomputes n-bit sums For both possible carries into n-bit group 11: Adders

Carry-Increment Adder Factor initial PG and final XOR out of carry-select 11: Adders

Carry-Increment Adder Factor initial PG and final XOR out of carry-select 11: Adders

Variable Group Size Also buffer noncritical signals 11: Adders

Tree Adder If lookahead is good, lookahead across lookahead! Recursive lookahead gives O(log N) delay Many variations on tree adders 11: Adders

Brent-Kung 11: Adders

Sklansky 11: Adders

Kogge-Stone 11: Adders

Tree Adder Taxonomy Ideal N-bit tree adder would have L = log N logic levels Fanout never exceeding 2 No more than one wiring track between levels Describe adder with 3-D taxonomy (l, f, t) Logic levels: L + l Fanout: 2f + 1 Wiring tracks: 2t Known tree adders sit on plane defined by l + f + t = L-1 11: Adders

Tree Adder Taxonomy 11: Adders

Tree Adder Taxonomy 11: Adders

Han-Carlson 11: Adders

Knowles [2, 1, 1, 1] 11: Adders

Ladner-Fischer 11: Adders

Taxonomy Revisited 11: Adders

Summary Adder architectures offer area / power / delay tradeoffs. Choose the best one for your application. Architecture Classification Logic Levels Max Fanout Tracks Cells Carry-Ripple N-1 1 N Carry-Skip n=4 N/4 + 5 2 1.25N Carry-Inc. n=4 N/4 + 2 4 2N Brent-Kung (L-1, 0, 0) 2log2N – 1 Sklansky (0, L-1, 0) log2N N/2 + 1 0.5 Nlog2N Kogge-Stone (0, 0, L-1) N/2 Nlog2N 11: Adders

LookAhead - Basic Idea