DSD 19

Module 1
Libraries and Mapping Giovanni De Micheli

Integrated Systems Centre EPF Lausanne
!!Objective
"!Libraries "!Problem
formulation and analysis for library binding based on structural
"!Algorithms
methods
This presentation can be used for non-commercial purposes as long as this note and the copyright footers are not removed Giovanni De Micheli All rights reserved
(c) Giovanni De Micheli
Library binding
!!Given an unbound logic network and a set of library cells
"!Transform "!Optimize
#! (under
Major approaches
!!Rule-based systems
"!Generic, "!Hard "!Data
into an interconnection of instances of library cells
handle all types of cells and situations
delay area power
to obtain circuit with specific properties base:

of pattern pairs search: detect pattern, implement its best realization
area or power constraints) delay and/or power constraints delay and/or area constraints
"!Optimize
#! Under
#! Set
#! Local
"!Optimize
#! Under
!!Heuristic algorithms
"!Typically "!Library
restricted to single-output combinational cells
!!Library binding is called also technology mapping

"!Redesigning
described by cell functionality and parameters
circuits in different technologies

3
!!Most systems use a combination of both approaches:

"!Rules
are used for I/Os, high buffering requirements,

4
Page 1
Examples
!!Matching:
"!A
Library binding: issues
cell matches a sub-network when their terminal behavior is the same problem assignment problem
"!Tautology
"!Input-variable
!!Covering:
"!A
cover of an unbound network is a partition into sub-networks which can be replaced by library cells. covering problem
"!Binate
Assumptions
!!Network granularity is fine
"!Decomposition "!2-input
Example
into base functions:
AND, OR, NAND, NOR
!!Trivial binding
"!Use
base cells to realize decomposed network exists always a trivial binding:

solution
"!There
#! Base-cost
Page 2
Example
Library AND2 OR2 OA21 Cost 4 4 5
a
Example
v2 v1 x v3
z y
!! Vertex covering:
"! Covering v1 "! Covering v2 "! Covering v3
x=b+c y = ax z = xd
b c d
: ( m 1 + m4 + m5 ) : ( m 2 + m4 ) : ( m 3 + m5 )
v2 v1
x
!! Input compatibility:
"! Match
v3
a b c d x
m1: {v1,OR2}
y
m2 requires m1 m3 requires m1
m2: {v2,AND2} m3: {v3,AND2} m4: {v1,v2,OA21} m5: {v1,v3,OA21} v1

x
v2
#!
(m2 + m1) (m3 + m1 )
"! Match
#!
v3
!! Overall binate covering clause

"! (m1+m4+m5)
(m2+m4)(m3+m5)(m2+m1)(m3+m1) = 1
10
Heuristic approach to library binding

!!Split problem into various stages:
"!Decomposition
#! Cast
Decomposition
network and library in standard form into base functions #! Example, NAND2 and INV
#! Decompose
"!Partitioning
#! Break #! Reduce
network into cones to many multi-input, single-output networks each sub-network by library cells
"!Covering
#! Cover
!!Most tools use this strategy

"!Sometimes
stages are merged

11 (c) Giovanni De Micheli 12
Page 3
Partitioning
Covering
13
14
Heuristic algorithms
!!Structural approach
"!Model "!Rely
Example
!!Boolean vs. structural matching !! f = xy + xy + yz !! g = xy + xy + xz !!Function equality is a tautology
"! Boolean
functions by patterns
tree, dags
#! Example:
on pattern matching techniques
!!Boolean approach
"!Use
match
Boolean models the tautology problem

BDD technology
!!Patterns may be different

"! Structural
"!Solve
#! Use
match may not exist
"!More
powerful
15
16
Page 4
Structural matching and covering

!!Expression patterns
"!Represented
Example
by dags
!!Identify pattern dags in network

"!Sub-graph
isomorphism
!!Simplification:
"!Use
tree patterns
!!Typical problems with EXORs and MAJority functions
17
18
Tree-based matching
!! Network:
"! Partitioned
#! #!
Example
SUBJECT TREE PATTERN TREES
and decomposed
NOR2 (or NAND2) + INV Generic base functions

!!
Not much used
#!
Subject tree
!! Library
"! Represented "! Possibly
by trees cost = 2 INV cost = 3 NAND cost = 4 AND cost = 5 OR
more than one tree per cell
!! Pattern recognition
"! Simple
binary tree match automaton

"! Aho-Corasik
Page 5
Example: Lib
Match of s: t1 cost = 2 Match of u: t2 cost = 3 r s t u s r t u s r t u s r t u s r t u Match of t: t1 cost = 2+3 = 5 Match of t: t3 cost = 4 Match of r: t2 Match of r: t4 cost = 3+2+4 =9 cost = 5+3 =8
Tree covering
!!Dynamic programming "!Visit subject tree bottom up !!At each vertex "!Attempt to match:
#! Locally #! Find
rooted subtree to all library cell best match and record
"!There
is always a match when the base cells are in the library
!!Bottom-up search yields and optimum cover !!Caveat: "!Mapping into trees is a distortion for some cells "!Overall optimality is weakened by the overall strategy of splitting into several stages
21
22
Different covering problems

!!Covering for minimum area:
"!Each "!Area
Simple library
cell has a fixed area cost (label) is additive:

area of match to cost of sub-trees
#! Add
!!Covering for minimum delay:

"!Delay
is fanout independent
computed with (max, +) rules delay of match to highest cost of sub-trees scheme is required
#! Delay #! Add
"!Delay
is fanout dependent
#! Look-ahead
23
24
Page 6
Example minimum area cover

!!Area cost:
Network o I w y z v v N I N N v v
25
Example minimum delay cover

Cost
INV:2
NAND2:3
x y z w o
AND2: 4 AOI21: 6
Gate NAND2(b,c) INV(a) NAND2(x,d) NAND2(y,z) INV(w) AND2(y,z) AOI21(x,d,a) 3 2 3+3 = 6 3+6+ 2 = 11 2+11 = 13 6 + 4 + 2 = 12 6+3=9 t2 t1 t2 t2 t1 t3 t6B
Subject graph
Vertex Match
!! Fixed delays: INV:2 NAND2:4 AND2: 5 AOI21: 10 !! All inputs are stable at time 0, except for td = 6
26
Subject graph
Vertex Match x y z w o t2 t1 t2 t2 t1 t3 t6B
Gate NAND2(b,c) INV(a) NAND2(x,d) NAND2(y,z) INV(w) AND2(y,z) AOI21(x,d,a) 4 2
Cost
6+4 = 10 10 + 4 = 14 14 + 2 = 16 10 + 5 = 15 10 + 6 = 16
x b
d c
x b
d c
Minimum-delay cover for load-dependent delays

!! Model
"! Gate

!! Delays: INV:1+load NAND2: 3+load AND2: 4+load AOI21: 9+load !! All inputs are stable at time 0, except for td = 6 Same as before ! !! All loads are 1
28
delay is d = ! + " cap_load load depends on the driven cells (fanout cone) is a finite (possibly small) set of capacitive loads
"! Capacitive "! There
Subject graph
Gate NAND2(b,c) INV(a) NAND2(x,d) NAND2(y,z) INV(w) AND2(y,z) AOI21(x,d,a) 4 2
Cost
!! Algorithm
"! Visit
subject tree bottom up an array of solutions for each possible load
"! Compute "! For
6+4 = 10 10 + 4 = 14 14 + 2 = 16 10 + 5 = 15 10 + 6 = 16
each input to a matching cell, the best match for the corresponding load is selected solution when all possible loads are considered group loads into bins
!! Optimality
"! Optimum "! Heuristic:
x b
d c
27
Page 7

!! Delays: INV: 1+load NAND2: 3+load AND2: 4+load AOI21: 9+load !! All inputs are stable at time 0, except for td = 6 !! All loads are 1 (for cells seen so far) !! Add new cell SINV with delay 1 + ! load and load 2 !! The sub-network drives a load of 5
y w z v Network o

Cost Subject graph I N I N N v v
30
Gate NAND2(b,c) INV(a) NAND2(x,d) NAND2(y,z) INV(w) AND2(y,z) AOI21(x,d,a) SINV(w)
Load=1 Load=2 Load=5 4 2 10 14 5 3 11 15 8 6 14 18 20 19 20 18.5
x b
d c
29
Module 2
!!Objectives
"!Boolean "!Boolean
Boolean covering
!!Decompose network into base functions !!Partition network into cones !!Apply bottom-up covering to each cone
"! When
#!
covering matching optimization and binding to Boolean methods
"!Simultaneous "!Extensions
considering vertex v:
Construct clusters by local elimination #! Limit the depth of the cluster by limiting the support of the function #! Associate several functions with vertex v #! Apply matching and record cost
37
38
Page 8
Boolean matching P-equivalence

!!Cluster function f(x)
"!Sub-network
Input/output polarity assignment

!!NPN classification of logic functions !!NPN-equivalence
"!There
behavior
!!Pattern function g(y)

"!Cell
behavior
exist a permutation operator P and complementation operators Ni and No, such that f(x) = No g ( P Ni x) is a tautology
!!P-equivalence
"!Is
!!Variations:
"!N-equivalence "!PN-equivalence
there a permutation operator P, such that f(x) = g ( P x) is a tautology? check over all input permutations pattern ROBDD capturing all permutations
39
!!Approaches:
"!Tautology "!Multi-rooted
40
Boolean matching
!!Pin assignment problem:
"!Map
Example
!!Cluster terminals: x -- cell terminals: y
cluster variables x to pattern variables y equation: A(x,y) = 1
x1 x2
&
f g
x1 x2 y1 y2
"!Characteristic
!!Assign x1 to y2 and x2 to y1 !!Characteristic equation

"!A
f g
1 !!Pattern function under variable assignment: y y2 "! gA (x) = Sy ( A (x,y) g (y) )
(x1,x2,y1,y2) = (x1 " y2) (x2 " y1)
!!Tautology problem
"! f(x) "!!x
!!AND pattern function

"!g
= gA (x)
= y1 y2
f(x) = Sy ( A (x,y) g (y) )
!!Pattern function under assignment

"!Sy1y2
A g = Sy1y2 ((x1 " y2) (x1 " y1) y1 y2 ) = x2 x1

42
41
Page 9
Signatures and filters

!!Capture some properties of Boolean functions !!If signatures do not match, there is no match !!Signatures are used as filters to reduce computation !!Signatures:
"!Unateness "!Symmetries "!Co-factor "!Spectra
Filters based on unateness and symmetries

!!Any pin assignment must associate:
"!Unate "!Binate
variables in f(x) with unate variables in g(y) variables in f(x) with binate variables in g(y)
!!Variables or group of variables:

"!That
are interchangeable in f(x) must be interchangeable in g(y)
sizes
43
44
Example
!! Cluster function: f = abc
"! Symmetries "! Unate
Concurrent optimization and library binding

!!Motivation
"!Logic "!Logic
{ { a,b,c} }
simplification is usually done prior to binding
!! Pattern functions
"! g1
=a+b+c
Symmetries { { a,b,c} } Unate
#! #!
simplification and substitution can be combined with binding
"! g2
= ab +c
!!Mechanism
"!Binding "!Exploit
Symmetries { {a,b}, {c} } #! Unate

#!
induces some dont care conditions
"! g3
= abc + abc
Symmetries { {a,b,c} } #! Binate

#!
dont cares as degrees of freedom in matching
45
46
Page 10
Example
Boolean matching with dont care conditions

!!Given f(x), fDC(x) and g(y)
"!g
matches f, if g is equivalent to h, where:
f fDC " h " f + fDC

!!Matching condition:
!x ( fDC(x) + f(x) " Sy ( A (x,y) g(y) ) )
47
48
Example
!!Assume vx is bound to an OR3(c,b,e) !!Dont care set includes x " (c+b+e) !!Consider fj = x(a+c) with CDC = xc !!No simplification.
"! Mapping
Example
into AOI gate.
!!Matching with DCs.

"! Map
to a MUX gate.
49
50
Page 11
Extended matching
!! Motivation: "! Search implicitly for best pin assignment "! Make a single test, determining matching and assignment !! Technique:
"! Construct
Example
!!g = y1 + y2 y3 !!y1 (c,x) = (c0c1x1 + c0c1x2 + c0c1x3) " c2 !!G = y1 (c,x) + y2(c,x) y3(c,x)
BDD model of cell and assignments
!! Visual intuition:
"! Imagine "! Each "! Input
#!
!!An EXOR gate can be placed at the gate
to place MUX function at cell inputs
output to support NPN-equivalence check
cell input can be routed to any cluster input (or voltage rail) polarity can be changed:
NP-equivalence (extensible to NPN)
"! Cell
and cluster may differ in size assignment is determining c

!! Cell and multiplexers are described by a composite function G(x,c)

"! Pin
Extended matching modeling

!!Model composite functions with ROBDDs
"!Assume "!For
#!
#
Example
!!Cell: g=xy !!Cluster: f = wz
z w a c z w 1 0 1 0 b d x y
n-input cluster and m-input cell

$
&
each cell input:

!!G(a,b,c,d) = (c"(za+wa))(d"zb+wb))
log2 n variables for pin permutation #! One variable for input polarity
"!Total "!One
size of c: m( log2 n + 1 )
!!M(c) = abcd + abcd
additional variable for output polarity
!!f"G=(wz) " (c"(za+wa))(d"zb+wb))
&
!!A match exists if there is at least one value of c satisfying
M (c) = !x [ G(x,c) " f(x) ]

(c) Giovanni De Micheli 53 (c) Giovanni De Micheli
54
Page 12
Extended matching
!!Extended matching captures implicitly all possible matches !!No extra burden when exploiting dont care sets !!M (c) = !x [ G(x,c) " f(x) + fDC(x) ] !!Efficient BDD representation !!Extensions:
"!Support "!Full
Full library model

!!Represent full library with L(x,c)
"!One
single (large) BDD
G1 L
!!Visual intuition
"!All
composite cells connected to a MUX
G2
!!Compare cluster to Library L(x,c)

"!M
multiple-output matching
(c) = !x [ L(x,c) " f(x) + fDC(x) ] c determines: Gn
library representation
"!Vector
#! Feasible #! Feasible
cell matches pin assignments #! Feasible output polarity

55 (c) Giovanni De Micheli
56
Summary
!!Library binding is a key step in synthesis !!Most systems use some rules together with heuristic
algorithms that concentrate on combinational logic

"!Best
results are obtained with Boolean matching structural matching is used for speed
"!Sometimes
!!Library binding is tightly linked to buffering and to physical
design
57
Page 13

DSD 19

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DSD 19

Uploaded by

Copyright:

Available Formats

Module 1

Libraries and Mapping Giovanni De Micheli

formulation and analysis for library binding based on structural

(c) Giovanni De Micheli

into an interconnection of instances of library cells

handle all types of cells and situations

delay area power

to obtain circuit with specific properties base:

restricted to single-output combinational cells

!!Library binding is called also technology mapping

described by cell functionality and parameters

circuits in different technologies

!!Most systems use a combination of both approaches:

are used for I/Os, high buffering requirements,

(c) Giovanni De Micheli

(c) Giovanni De Micheli

Library binding: issues

(c) Giovanni De Micheli

(c) Giovanni De Micheli

into base functions:

AND, OR, NAND, NOR

base cells to realize decomposed network exists always a trivial binding:

(c) Giovanni De Micheli

(c) Giovanni De Micheli

m2: {v2,AND2} m3: {v3,AND2} m4: {v1,v2,OA21} m5: {v1,v3,OA21} v1

(m2 + m1) (m3 + m1 )

!! Overall binate covering clause

(c) Giovanni De Micheli

(c) Giovanni De Micheli

Heuristic approach to library binding

!!Most tools use this strategy

stages are merged

(c) Giovanni De Micheli

(c) Giovanni De Micheli

on pattern matching techniques

Boolean models the tautology problem

!!Patterns may be different

match may not exist

(c) Giovanni De Micheli

(c) Giovanni De Micheli

Structural matching and covering

!!Identify pattern dags in network

!!Typical problems with EXORs and MAJority functions

(c) Giovanni De Micheli

(c) Giovanni De Micheli

NOR2 (or NAND2) + INV Generic base functions

Not much used

by trees cost = 2 INV cost = 3 NAND cost = 4 AND cost = 5 OR

more than one tree per cell

binary tree match automaton

rooted subtree to all library cell best match and record

is always a match when the base cells are in the library

(c) Giovanni De Micheli

(c) Giovanni De Micheli

Different covering problems

cell has a fixed area cost (label) is additive:

!!Covering for minimum delay:

(c) Giovanni De Micheli

(c) Giovanni De Micheli

Example minimum area cover

Example minimum delay cover

Vertex Match x y z w o t2 t1 t2 t2 t1 t3 t6B

Gate NAND2(b,c) INV(a) NAND2(x,d) NAND2(y,z) INV(w) AND2(y,z) AOI21(x,d,a) 4 2