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

Slides:

Advertisements

Similar presentations

L23 – Adder Architectures. Adders  Carry Lookahead adder  Carry select adder (staged)  Carry Multiplexed Adder  Ref: text Unit 15 9/2/2012 – ECE 3561.

Advertisements

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

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

Lecture 20: Hardware for Arithmetic Today’s topic –Carry Look-Ahead Adder 1.

Lecture Adders Half adder.

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.

CSE-221 Digital Logic Design (DLD)

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

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

1 A Timing-Driven Synthesis Approach of a Fast Four-Stage Hybrid Adder in Sum-of-Products Sabyasachi Das University of Colorado, Boulder Sunil P. Khatri.

1 Generation of Optimal Bit-Width Topology of Fast Hybrid Adder in a Parallel Multiplier Sabyasachi Das Synplicity Inc. Sunil P. Khatri Texas A&M University.

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.

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.

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

VLSI Arithmetic Adders & Multipliers

EE466: VLSI Design Lecture 14: Datapath Functional Units.

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.

Introduction to CMOS VLSI Design Datapath Functional Units

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

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.

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

Lecture 18: Datapath Functional Units

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

1. Copyright  2005 by Oxford University Press, Inc. Computer Architecture Parhami2 Figure 10.1 Truth table and schematic diagram for a binary half-adder.

Abdullah Aldahami ( ) Feb26, Introduction 2. Feedback Switch Logic 3. Arithmetic Logic Unit Architecture a.Ripple-Carry Adder b.Kogge-Stone.

1 Design Space Exploration for Power-Efficient Mixed-Radix Ling Adders Chung-Kuan Cheng Computer Science and Engineering Depart. University of California,

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

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.

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

1 CPSC3850 Adders and Simple ALUs Simple Adders Figures 10.1/10.2 Binary half-adder (HA) and full-adder (FA). Digit-set interpretation: {0, 1}

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.

Fast Adders: Parallel Prefix Network Adders, Conditional-Sum Adders, & Carry-Skip Adders ECE 645: Lecture 5.

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.

1 Arithmetic I Instructor: Mozafar Bag-Mohammadi Ilam University.

Block p and g Generators. Carry Determination as Prefix Computations Two Contiguous (or Overlapping) Blocks (g’, p’) and (g’’, p’’) Merged Block (g, p)

Unrolling Carry Recurrence

Conditional-Sum Adders Parallel Prefix Network Adders

Computer Architecture Lecture 16 Fasih ur Rehman.

ECE 331 – Digital System Design Multi-bit Adder Circuits, Adder/Subtractor Circuit, and Multiplier Circuit (Lecture #12)

EE466: VLSI Design Lecture 13: Adders

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

Digital Integrated Circuits 2e: Chapter Copyright  2002 Prentice Hall PTR, Adapted by Yunsi Fei ECE 300 Advanced VLSI Design Fall 2006 Lecture.

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.

C-H1 Lecture Adders Half adder. C-H2 Full Adder si is the modulo- 2 sum of ci, xi, yi.

ECE/CS 552: Arithmetic I Instructor:Mikko H Lipasti Fall 2010 University of Wisconsin-Madison Lecture notes partially based on set created by Mark Hill.

1. 2 Figure 10.1 Truth table and schematic diagram for a binary half-adder Simple Adders Half-adder.

Carry-Lookahead, Carry-Select, & Hybrid Adders ECE 645: Lecture 2.

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1.

How Computers Work Lecture 4 Page 1 How Computers Work Lecture 4 Computer Arithmetic.

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

Introduction to VLSI Design Datapath

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

Lecture 18: Datapath Functional Units. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 18: Datapath Functional Units2 Outline  Multipliers.

Divide-and-Conquer Design

Presentation transcript:

Lecture 12b: Adders

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 2 Generate / Propagate  Equations often factored into G and P  Generate and propagate for groups spanning i:j  Base case  Sum:

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 3 PG Logic

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 4 Carry-Ripple Revisited

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 5 Carry-Ripple PG Diagram

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 6 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

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 7 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

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 8 Carry-Lookahead Adder  Carry-lookahead adder computes G i:0 for many bits in parallel.  Uses higher-valency cells with more than two inputs.

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 9 Carry-Lookahead Adder  Carry-lookahead adder computes G i:0 for many bits in parallel.  Uses higher-valency cells with more than two inputs.

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 10 Tree Adder  If lookahead is good, lookahead across lookahead! –Recursive lookahead gives O(log N) delay  Many variations on tree adders

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 11 PG Diagram Notation

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 12 Sklansky

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 13 Brent-Kung

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 14 Kogge-Stone

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 15 Han-Carlson

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 16 Knowles [2, 1, 1, 1]

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 17 Ladner-Fischer

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 18 Taxonomy Revisited

CMOS VLSI DesignCMOS VLSI Design 4th Ed. 17: Adders 19 Summary ArchitectureClassificationLogic Levels Max Fanout TracksCells Carry-RippleN-111N Carry-Skip n=4N/ N Carry-Inc. n=4N/ N Brent-Kung(L-1, 0, 0)2log 2 N – 1212N Sklansky(0, L-1, 0)log 2 NN/ Nlog 2 N Kogge-Stone(0, 0, L-1)log 2 N2N/2Nlog 2 N Adder architectures offer area / power / delay tradeoffs. Choose the best one for your application.