Block p and g Generators - PowerPoint PPT Presentation

1 / 16
About This Presentation
Title:

Block p and g Generators

Description:

right group generates and left group propagates. Carry ... is Brent-Kung Parallel Prefix Graph ... Brent-Kung Network. independent, so single delay. Kogge ... – PowerPoint PPT presentation

Number of Views:10
Avg rating:3.0/5.0
Slides: 17
Provided by: mitchth
Category:
Tags: block | generators | kung

less

Transcript and Presenter's Notes

Title: Block p and g Generators


1
Block p and g Generators
2
Carry Determination as Prefix Computations
  • Two Contiguous (or Overlapping) Blocks (g, p)
    and (g, p)
  • Merged Block (g, p) g g gp p
    pp
  • Large Group Generates Carry if
  • left group generates carry
  • right group generates and left group propagates

3
Carry Operator,
  • Define Operator Over (g, p) Pairs (g, p) (g,
    p) (g, p)
  • g g gp p pp
  • is Associative (g, p) (g, p)
    (g, p) (g, p) (g, p) (g,
    p) (g, p) (g, p) (g, p)

4
Carry Operator, (cont)
  • is NOT Commutative (g, p) (g, p) ?
    (g, p) (g, p)
  • This is Easy to See Because g g gp ?
    g gp

5
Prefix Adders
6
Carry Determination
  • Assume Adder with NO cIN ci1 g0,i
  • Carry Enters i1 Block iff Generated in Block
    0,i
  • Assume Adder with cIN 1
  • Viewed as Generated Carry from Stage -1 p-1
    0, g-1 cIN
  • Compute g-1,i For All i
  • Formulate Carry Determination as

7
Prefix Computation
8
Prefix Sums Analogy
  • Designs for Prefix Sums Can be Converted to
    Carry Computation
  • Replace Adder with Operator
  • Addition IS Commutative, Order Doesnt 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)

9
Prefix Sum Network
(adder levels)
( of adders)
10
Another Way for Prefix Sums
  • Compute the Following Firstx0x1 x2x3
    x4x5 ... xk-2xk-1
  • Yields the Partial Sums, s1, s3, s5, ..., sk-1
  • Next, Even Indexed Sums Computed As s2j
    s2j-1 x2j

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

13
Brent-Kung Network
independent,so single delay
14
Kogge-Stone Network
15
Area/Levels of Prefix Networks
16
Hybrid Parallel Prefix Network
Write a Comment
User Comments (0)
About PowerShow.com