Presentation is loading. Please wait.

Presentation is loading. Please wait.

CALTECH CS137 Winter2004 -- DeHon CS137: Electronic Design Automation Day 5: January 21, 2004 Multi-level Synthesis.

Published byWinifred Sanders Modified over 9 years ago

Similar presentations

Presentation on theme: "CALTECH CS137 Winter2004 -- DeHon CS137: Electronic Design Automation Day 5: January 21, 2004 Multi-level Synthesis."— Presentation transcript:

1 CALTECH CS137 Winter2004 -- DeHon CS137: Electronic Design Automation Day 5: January 21, 2004 Multi-level Synthesis

2 CALTECH CS137 Winter2004 -- DeHon Today Multilevel Synthesis/Optimization –Why –Transforms -- defined –Division/extraction How we support transforms –Boolean Division Higher quality division –Speedup sketch

3 CALTECH CS137 Winter2004 -- DeHon Multi-level General circuit netlist May have –sums within products –products within sum –arbitrarily deep y=((a (b+c)+e)fg+h)i

4 CALTECH CS137 Winter2004 -- DeHon Why multi-level? ab(c+d+e)(f+g)

5 CALTECH CS137 Winter2004 -- DeHon Why multi-level? ab(c+d+e)(f+g) abcf+abdf+abef+abcg+abdg+abeg 6 product terms vs. 3 gates: and4,or3,or2 Cannot share sub-expressions

6 CALTECH CS137 Winter2004 -- DeHon Why Multilevel a xor b –a/b+/ab a xor b xor c –a/bc+/abc+/a/b/c+ab/c a xor b xor c xor d –a/bcd+/abcd+/a/b/cd+ab/cd+/ab/c/d+a/b/c/d+abc/d+/a/bc/d

7 CALTECH CS137 Winter2004 -- DeHon Why Multilevel a xor b –x1=a/b+/ab a xor b xor c –x2=x1/c+/x1*c a xor b xor c xor d –x3=x2/d+x2*d Multi-level –exploit common sub-expressions –linear complexity Two-level –exponential complexity

8 CALTECH CS137 Winter2004 -- DeHon Goal Find the structure Exploit to minimize gates –Total (area) –In path (delay)

9 CALTECH CS137 Winter2004 -- DeHon Multi-level Transformations Decomposition Extraction Factoring Substitution Collapsing [copy these to board so stay up as we move forward]

10 CALTECH CS137 Winter2004 -- DeHon Decomposition F=abc+abd+/a/c/d+/b/c/d F=XY+/X/Y X=ab Y=c+d

11 CALTECH CS137 Winter2004 -- DeHon Decomposition F=abc+abd+/a/c/d+/b/c/d –4 3-input + 1 4-input F=XY+/X/Y X=ab Y=c+d –5 2-input gates Note: use X and /X, use at multiple places

12 CALTECH CS137 Winter2004 -- DeHon Extraction F=(a+b)cd+e G=(a+b)/e H=cde F=XY+e G=x/e H=Ye X=a+b Y=cd

13 CALTECH CS137 Winter2004 -- DeHon Extraction F=(a+b)cd+e G=(a+b)/e H=cde 2-input: 4 3-input: 2 F=XY+e G=X/e H=Ye X=a+b Y=cd 2-input: 6 Common sub-expressions over multiple output

14 CALTECH CS137 Winter2004 -- DeHon Factoring F=ac+ad+bc+bd+e F=(a+b)(c+d)+e

15 CALTECH CS137 Winter2004 -- DeHon Factoring F=ac+ad+bc+bd+e –4 2-input, 1 5-input –9 literals F=(a+b)(c+d)+e –4 2-input –5 literals

16 CALTECH CS137 Winter2004 -- DeHon Substitution G=a+b F=a+bc Substitute G into F F=G(a+c) –(verify) F=(a+b)(a+c)=aa+ab+ac+bc=a+bc useful if also have H=a+c? (F=GH)

17 CALTECH CS137 Winter2004 -- DeHon Collapsing F=Ga+/Gb G=c+d F=ac+ad+b/c/d opposite of substitution –sometimes want to collapse and refactor –especially for delay optimization

18 CALTECH CS137 Winter2004 -- DeHon Moves These transforms define the “moves” we can make to modify our network. Goal is to apply, usually repeatedly, to minimize gates –…then apply as necessary to accelerate design MIS/SIS –Applies to canonical 2-input gates –Then covers with target gate library (back to day2)

19 CALTECH CS137 Winter2004 -- DeHon Division

20 CALTECH CS137 Winter2004 -- DeHon Division Given: function (f) and divisor (p) Find: quotient and remainder f=pq+r E.g. f=abc+abd+ef, p=ab q=c+d, r=ef

21 CALTECH CS137 Winter2004 -- DeHon Algebraic Division Use basic rules of algebra, rather than full boolean properties Computationally simple Weaker than boolean division f=a+bc p=(a+b) Algebra: not divisible Boolean: q=(a+c), r=0

22 CALTECH CS137 Winter2004 -- DeHon Algebraic Division f and p are expressions (lists of cubes) p={a 1,a 2,…} h i ={c j | a i * c j  f} f/p = h 1  h 2  h 3 …

23 CALTECH CS137 Winter2004 -- DeHon Algebraic Division Example (stay on alg.; work ex on board) f=abc+abd+de g=ab+e

24 CALTECH CS137 Winter2004 -- DeHon Algebraic Division Example f=abc+abd+de, p=ab+e p={ab,e} h1={c,d} h2={d} h1  h2={d} f/g=d r=f- p *(f/g) r=abc+abd+de-(ab+e)d r=abc

25 CALTECH CS137 Winter2004 -- DeHon Algebraic Division Time O(|f||p|) as described –compare every cube pair Sort cubes first –O((|f|+|p|)log(|f|+|p|)

26 CALTECH CS137 Winter2004 -- DeHon Primary Divisor f/c such that c is a cube f =abc+abde f/a=bc+bde is a primary divisor

27 CALTECH CS137 Winter2004 -- DeHon Cube Free The only cube that divides p is 1 c+de is cube free bc+bde is not cube free

28 CALTECH CS137 Winter2004 -- DeHon Kernel Kernels of f are –cube free primary divisors of f –Informally: sums w/ cubes factored out f=abc+abde f/ab = c+de is a kernel ab is cokernel of f to (c+de) –cokernels always cubes

29 CALTECH CS137 Winter2004 -- DeHon Kernel Extraction Find c f = largest cube factor of f K=Kernel1(0,f/c f ) if (f is cube-free) –return(f  K) else –return(K) Kernel1(j,g) –R=g –N max index in g –for(i=j+1 to N) if (l i in 2 or more cubes) –c f =largest cube divide g/l i –if (forall k  i, l k  c f ) »R=R  KERNEL1(i,g/(l i  c f )) –return(R) Must be to Generate Non-trivial kernel Consider each literal for cofactor once (largest kernels will already have been found)

30 CALTECH CS137 Winter2004 -- DeHon Kernel Extract Example (stay on prev. slide, ex. on board) f=abcd+abce+abef c f =ab f/c f =cd+ce+ef R={cd+ce+ef} N=6 a,b not present (cd+ce+ef)/c=e+d largest cube 1 Recurse  e+d R={cd+ce+ef,e+d} only 1 d (d+ce+ef)/e=c+f Recurse  c+f R={cd+ce+ef,e+d,c+f}

31 CALTECH CS137 Winter2004 -- DeHon Factoring Gfactor(f) if (terms==1) return(f) p=CHOOSE_DIVISOR(f) (h,r)=DIVIDE(f,p) f=Gfactor(h)*Gfactor(p)+Gfactor(r) return(f) // factored

32 CALTECH CS137 Winter2004 -- DeHon Factoring Trick is picking divisor –pick from kernels –goal minimize literals after resubstitution Re-express design using new intermediate variables Variable and complement

33 CALTECH CS137 Winter2004 -- DeHon Extraction Identify cube-free expressions in many functions (common sub expressions) Generate kernels for each function select pair such that k1  k2 is not a cube new variable from intersection –v= k1  k2 update functions (resubstitute) –f i = v*(f i /v)+ r i –(similar for common cubes)

34 CALTECH CS137 Winter2004 -- DeHon Extraction Example X=ab(c(d+e)+f+g)+g Y=ai(c(d+e)+f+j)+k

35 CALTECH CS137 Winter2004 -- DeHon Extraction Example X=ab(c(d+e)+f+g)+g Y=ai(c(d+e)+f+j)+k d+e kernel of both L=d+e X=ab(cL+f+g)+h Y=ai(cL+f+j)+k

36 CALTECH CS137 Winter2004 -- DeHon Extraction Example L=d+e X=ab(cL+f+g)+h Y=ai(cL+f+j)+k kernels:(cL+f+g), (cL+f+j) extract: M=cL+f X=ab(M+g)+h Y=ai(M+f)+h

37 CALTECH CS137 Winter2004 -- DeHon Extraction Example L=d+e M=cL+f X=ab(M+g)+h Y=ai(M+j)+h no kernels common cube: aM N=aM M=cL+f L=d+e X=b(N+ag)+h Y=I(N+aj)+k

38 CALTECH CS137 Winter2004 -- DeHon Extraction Example N=aM M=cL+f L=d+e X=b(N+ag)+h Y=I(N+aj)+k Can collapse –L into M into N –Only used once Get larger common kernel N –maybe useful if components becoming too small for efficient gate implementation

39 CALTECH CS137 Winter2004 -- DeHon Resubstitution Also useful to try complement on new factors f=ab+ac+/b/cd X=b+c f=aX+/b/cd /X=/b/c f=aX+/Xd …extracting complements not a direct target

40 CALTECH CS137 Winter2004 -- DeHon Good Divisors? Key to CHOOSE_DIVISOR in GFACTOR Variations to improve –e.g. rectangle covering (Devadas 7.4)

41 CALTECH CS137 Winter2004 -- DeHon Boolean Division

42 CALTECH CS137 Winter2004 -- DeHon Don’t Care Mentioned last time Structure of logic restricts values intermediates can take on

43 CALTECH CS137 Winter2004 -- DeHon Don’t Care Example e=/a/b g=/c/d f=/e/g e=0, a=0, b=0 cannot occur DC: e(a+b)+/e/a/b

44 CALTECH CS137 Winter2004 -- DeHon Satisfiability DC In general:  z=F(x,y)  z/F(x,y) + /zF(x,y) is don’t care

45 CALTECH CS137 Winter2004 -- DeHon Observability DC If output F not differentiated by input y, –then don’t care value of y –i.e. input conditions where (F y =F /y ) ODC =  (F y =F /y ) –(product over all outputs)

46 CALTECH CS137 Winter2004 -- DeHon Don’t Care Optimization Select a node in Boolean network Compute ODC for all outputs wrt node Compute SDC in terms of local inputs Minimize wrt ODC  SDC

47 CALTECH CS137 Winter2004 -- DeHon Boolean Division f//p assuming sup(p)  sup(f) add input P to f (for p) new function F = f//p –DC-set D=P/p+/Pp –ON-set f  /D –OFF-set /(f  D) minimize F for minimum literals in sum- of-products (last time)

48 CALTECH CS137 Winter2004 -- DeHon Boolean Division (check) F ON-set f  /D D=P/p+/Pp /D = Pp+/P/p F = f  /D = F(Pp+/P/p) f = F(Pp+/P/p)p = Fp –Goal since want F=f//p

49 CALTECH CS137 Winter2004 -- DeHon Boolean Division Example f=abc+a/b/c+/ab/c+/a/bc p=ab+/a/b F-DC=ab/P+/a/b/P+/abP+a/bP F-On=abcP+/a/bcP+/ab/cP+a/b/c/P After minimization get:  F=cP+/c/P  P=ab+/a/b

50 CALTECH CS137 Winter2004 -- DeHon Boolean Division Trick is finding boolean divisors Not as clear how to find –(not as much work on) Can always use boolean division on algebraic divisors –give same or better results

51 CALTECH CS137 Winter2004 -- DeHon Speed Up (sketch flavor)

52 CALTECH CS137 Winter2004 -- DeHon Speed Up Start with area optimized network Know target arrival times –Or know critical path Want to reduce delay of node

53 CALTECH CS137 Winter2004 -- DeHon Basic Idea Improve speed by: –Collapsing node(s) –Refactoring collapsed subgraph to reduce height

54 CALTECH CS137 Winter2004 -- DeHon Speed Up While (delay decreasing, timing not met) –Compute delay (slack) –Generate network close to critical path –Weight nodes in network –Compute mincut of nodes on weighted network –Partial collapse and timing redecompose on cut nodes

55 CALTECH CS137 Winter2004 -- DeHon Weighted Cut Want to minimize area expansion Want to maximize likely benefit –Prefer nodes with varying input times –Prefer nodes with critical path on longer paths

56 CALTECH CS137 Winter2004 -- DeHon Timing Decomposition Extract area saving kernels that do not include critical inputs to node When decompose (e.g. into nand2’s) similarly balance with critical inputs closest to output

57 CALTECH CS137 Winter2004 -- DeHon Example

58 CALTECH CS137 Winter2004 -- DeHon Example

59 CALTECH CS137 Winter2004 -- DeHon Example New factor

60 CALTECH CS137 Winter2004 -- DeHon Summary Want to exploit structure in problems to reduce (contain) size –common subexpressions –structural don’t cares Identify component elements –decomposition, factoring, extraction Division key to these operations Speedup refactoring

61 CALTECH CS137 Winter2004 -- DeHon Admin Reading for next lecture on web –(exact state assignment TRCAD91)

62 CALTECH CS137 Winter2004 -- DeHon Big Ideas Exploit freedom –form –don’t care Exploit structure/sharing –common sub expressions Techniques –Iterative Improvement –Refinement/relaxation

Download ppt "CALTECH CS137 Winter2004 -- DeHon CS137: Electronic Design Automation Day 5: January 21, 2004 Multi-level Synthesis."

Similar presentations

ENGG3190 Logic Synthesis “Multi Level Logic” (Part II) Winter 2014 S. Areibi School of Engineering University of Guelph.

ENGG3190 Logic Synthesis “Multi Level Logic” (Part II) Winter 2014 S. Areibi School of Engineering University of Guelph.
FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Topics n Logic synthesis. n Placement and routing.

FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Topics n Logic synthesis. n Placement and routing.
Timing Optimization. Optimization of Timing Three phases 1globally restructure to reduce the maximum level or longest path Ex: a ripple carry adder ==>

Timing Optimization. Optimization of Timing Three phases 1globally restructure to reduce the maximum level or longest path Ex: a ripple carry adder ==>
ECE 667 Synthesis & Verification - Algebraic Division 1 ECE 667 ECE 667 Synthesis and Verification of Digital Systems Multi-level Minimization Algebraic.

ECE 667 Synthesis & Verification - Algebraic Division 1 ECE 667 ECE 667 Synthesis and Verification of Digital Systems Multi-level Minimization Algebraic.
ECE 667 Synthesis and Verification of Digital Systems

ECE 667 Synthesis and Verification of Digital Systems
ECE C03 Lecture 21 Lecture 2 Two Level Minimization Hai Zhou ECE 303 Advanced Digital Design Spring 2002.

ECE C03 Lecture 21 Lecture 2 Two Level Minimization Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
1 Outline Division is central in many operations. –What is it (in the context of Boolean functions)? –What to divide (divisor) with? –How to divide (quotient.

1 Outline Division is central in many operations. –What is it (in the context of Boolean functions)? –What to divide (divisor) with? –How to divide (quotient.
Multilevel Logic Minimization -- Introduction. ENEE 6442 Outline > Multi-level minimization: technology independent local optimization. > What to optimize:

Multilevel Logic Minimization -- Introduction. ENEE 6442 Outline > Multi-level minimization: technology independent local optimization. > What to optimize:
Logic Synthesis Part II

Logic Synthesis Part II
Penn ESE353 Spring 2008 -- DeHon 1 ESE535: Electronic Design Automation Day 6: February 5, 2008 Multi-level Synthesis.

Penn ESE353 Spring DeHon 1 ESE535: Electronic Design Automation Day 6: February 5, 2008 Multi-level Synthesis.
EDA (CS286.5b) Day 15 Logic Synthesis: Two-Level.

EDA (CS286.5b) Day 15 Logic Synthesis: Two-Level.
Caltech CS184a Fall2000 -- DeHon1 CS184a: Computer Architecture (Structures and Organization) Day10: October 25, 2000 Computing Elements 2: Cascades, ALUs,

Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day10: October 25, 2000 Computing Elements 2: Cascades, ALUs,
EDA (CS286.5b) Day 17 Sequential Logic Synthesis (FSM Optimization)

EDA (CS286.5b) Day 17 Sequential Logic Synthesis (FSM Optimization)
Technology Mapping.

Technology Mapping.
Logic Synthesis Outline –Logic Synthesis Problem –Logic Specification –Two-Level Logic Optimization Goal –Understand logic synthesis problem –Understand.

Logic Synthesis Outline –Logic Synthesis Problem –Logic Specification –Two-Level Logic Optimization Goal –Understand logic synthesis problem –Understand.
Logic Synthesis 5 Outline –Multi-Level Logic Optimization –Recursive Learning - HANNIBAL Goal –Understand recursive learning –Understand HANNIBAL algorithms.

Logic Synthesis 5 Outline –Multi-Level Logic Optimization –Recursive Learning - HANNIBAL Goal –Understand recursive learning –Understand HANNIBAL algorithms.
Logic Synthesis 1 Outline –Logic Synthesis Problem –Logic Specification –Two-Level Logic Optimization Goal –Understand logic synthesis problem –Understand.

Logic Synthesis 1 Outline –Logic Synthesis Problem –Logic Specification –Two-Level Logic Optimization Goal –Understand logic synthesis problem –Understand.
Penn ESE353 Spring 2009 -- DeHon 1 ESE535: Electronic Design Automation Day 14: March 16, 2009 Multi-level Synthesis.

Penn ESE353 Spring DeHon 1 ESE535: Electronic Design Automation Day 14: March 16, 2009 Multi-level Synthesis.
Penn ESE535 Spring 2008 -- DeHon 1 ESE535: Electronic Design Automation Day 7: February 11, 2008 Static Timing Analysis and Multi-Level Speedup.

Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 7: February 11, 2008 Static Timing Analysis and Multi-Level Speedup.
ECE 667 - Synthesis & Verification - Lecture 14 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Systems BDD-based.

ECE Synthesis & Verification - Lecture 14 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Systems BDD-based.

Similar presentations

Ads by Google