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

Slides:

Advertisements

Similar presentations

UNIVERSITY OF MASSACHUSETTS Dept

Advertisements

ECE2030 Introduction to Computer Engineering Lecture 13: Building Blocks for Combinational Logic (4) Shifters, Multipliers Prof. Hsien-Hsin Sean Lee School.

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:

Using Carry-Save Adders For Radix- 4, Can Be Used to Generate 3a – No Booth’s Slight Delay Penalty from CSA – 3 Gates.

Datapath Functional Units. Outline  Comparators  Shifters  Multi-input Adders  Multipliers.

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

UNIVERSITY OF MASSACHUSETTS Dept

CSE-221 Digital Logic Design (DLD)

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.

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 CMOS VLSI Design Lecture 11: Adders

Chapter # 5: Arithmetic Circuits Contemporary Logic Design Randy H

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Topics n Shifters. n Adders and ALUs.

Lecture 8 Arithmetic Logic Circuits

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.

Lecture 17: Adders.

Introduction to CMOS VLSI Design Datapath Functional Units

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.

Parallel Prefix Adders A Case Study

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

C. N. Colón Geometry St. Barnabas H. S. Bronx, NY Real Numbers and Their Properties Ch 1.2.

Multiplication.

Bar Ilan University, Engineering Faculty

Lecture 9: Structure for Discrete-Time System XILIANG LUO 2014/11 1.

Lecture 18: Datapath Functional Units

Top-down modular design

Aug Shift Operations Source: David Harris. Aug Shifter Implementation Regular layout, can be compact, use transmission gates to avoid threshold.

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,

Chapter 8 Problems Prof. Sin-Min Lee Department of Mathematics and Computer Science.

Chapter # 5: Arithmetic Circuits

5-1 Programmable and Steering Logic Chapter # 5: Arithmetic Circuits.

Advanced VLSI Design Unit 05: Datapath Units. Slide 2 Outline  Adders  Comparators  Shifters  Multi-input Adders  Multipliers.

Design of a 32-Bit Hybrid Prefix-Carry Look-Ahead Adder

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

CHAPTER 4 Combinational Logic Design- Arithmetic Operation (Section 4.6&4.9)

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

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

Binary Adder DesignSpring Binary Adders. Binary Adder DesignSpring n-bit Addition –Ripple Carry Adder –Conditional Sum Adder –(Carry Lookahead.

COMP541 Arithmetic Circuits

CS221: Digital Logic Design Combinational Circuits

Unrolling Carry Recurrence

Conditional-Sum Adders Parallel Prefix Network Adders

Computer Architecture Lecture 16 Fasih ur Rehman.

Reconfigurable Computing - Options in Circuit Design John Morris Chung-Ang University The University of Auckland ‘Iolanthe’ at 13 knots on Cockburn Sound,

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.

Adding the Superset Adder to the DesignWare IP Library

Full Tree Multipliers All k PPs Produced Simultaneously Input to k-input Multioperand Tree Multiples of a (Binary, High-Radix or Recoded) Formed at Top.

CSE477 VLSI Digital Circuits Fall 2002 Lecture 20: Adder Design

CSE 311 Foundations of Computing I Lecture 25 Circuits for FSMs, Carry-Look-Ahead Adders Autumn 2011 CSE 3111.

Topic: N-Bit parallel and Serial adder

Full Adder Truth Table Conjugate Symmetry A B C CARRY SUM

Conditional-Sum Adders Parallel Prefix Network Adders

Properties of Addition and Multiplication

Divide-and-Conquer Design

Unsigned Multiplication

Chapter 5 -Part 3.

Conditional-Sum Adders Parallel Prefix Network Adders

Presentation transcript:

Block p and g Generators

Carry Determination as Prefix Computations Two Contiguous (or Overlapping) Blocks (g’, p’) and (g’’, p’’) Merged Block (g, p) g = g’’+ g’p’’ p = p’p’’ Large Group Generates Carry if: 1)left group generates carry 2)right group generates and left group propagates

Carry Operator, ¢ Define Operator Over (g, p) Pairs (g, p) = (g’, p’) ¢ (g’’, p’’) g = g’’+ g’p’ p = p’p’’ ¢ is Associative (g’, p’) ¢ (g’’, p’’) ¢ (g’’’, p’’’) =[(g’, p’) ¢ (g’’, p’’) ] ¢ (g’’’, p’’’) = (g’, p’) ¢ [(g’’, p’’) ¢ (g’’’, p’’’)]

Carry Operator, ¢ (cont) ¢ is NOT Commutative (g’, p’) ¢ (g’’, p’’)  (g’’, p’’)¢ (g’, p’) This is Easy to See Because: g = g’’+ g’p’  g’+ g’’p’’

Prefix Adders

Carry Determination Assume Adder with NO c IN c i+1 = g [0,i] Carry Enters i+1 Block iff Generated in Block [0,i] Assume Adder with c IN = 1 Viewed as Generated Carry from Stage -1 p -1 = 0, g -1 = c IN Compute g [-1,i] For All i Formulate Carry Determination as:

Prefix Computation

Prefix Sums Analogy Designs for Prefix Sums Can be Converted to Carry Computation Replace Adder with ¢ Operator Addition IS Commutative, Order Doesn’t Matter Can Group (g, p) In Anyway to Combine Into Block Signals (as long as order is preserved) (g, p) Allow for Overlapping Groups, Prefix Sums Does Not (sum would contain some values added two or times)

Prefix Sum Network (adder levels) (# of adders)

Another Way for Prefix Sums Compute the Following First: x 0 +x 1 x 2 +x 3 x 4 +x 5...x k-2 +x k-1 Yields the Partial Sums, s 1, s 3, s 5,..., s k-1 Next, Even Indexed Sums Computed As: s 2j = s 2j-1 + x 2j

Alternative Prefix Sum Network

Comparison of Prefix Sum Networks First Design Faster: lg 2 (k) versus 2lg 2 (k)-2(levels) First Design has High Fan-out Requirements First Design Requires More Cells (k/2)lg 2 k versus 2k-2-lg 2 k Second Design is Brent-Kung Parallel Prefix Graph First Design is Kogge-Stone Parallel Prefix Graph (fan-out can be avoided by distributing computations)

Brent-Kung Network independent, so single delay

Kogge-Stone Network

Area/Levels of Prefix Networks

Hybrid Parallel Prefix Network