Академический Документы
Профессиональный Документы
Культура Документы
Introduction
1 lecture
IC Design Data Formats and Tools
4 lectures
Electronic Design Methodology
4 lectures
IC Synthesis
2 lectures
Databases for EDA
3 lectures
IC Design Approaches and Flows
3 lectures
EDA Tools
3 lectures
Overview of Synopsys EDA Tools
3 lectures
Functional
IP
RAM
(M-1) - level
devices
Block 2
Block 3
Blocks
(M-2) - level
Functional
nodes
(M-3) - level
Elements
(transistor)
0 - level
System
Add
Accumulator Register-Transfer
Input
Command Register
+1
Command Counter
& &
1
Gate
J TT
C
K
Circuit
Device
n+
p
n +
n
+
p
Add
Accumulator
Functional circuits on
Input
Register-Transfer the level of multibit
Command Register
devices
+1
Command Counter Boolean algebra
System of differential
Circuit Electrical circuit
equations
n+
p+ System of differential
Device IC components n equations with partial
n+ derivative
p
Structural Synthesis
Structural
optimization
Parametrical Synthesis
Parametrical
optimization
Simulation
no
Are the operational
conditions met?
yes
Transition into more detailed circuit design
Description of
circuit
Simulation
program Results
Simulation deck
Dependent Independent
2. Cyclic 3. Independent
2
1 2 i N
1 3 5
4
The result of some i-th phase does
not meet the requirements and there More than one design problem
is need to return to the previous phases
The action of each subsequent phase is planned from the outcome of the previous
phase.
5. Strategy of increases
Cautious strategy
6. Random search
Selection of random
Result estimation
“points”
a1
A
Worse parameters can be
obtained from A structure
b1
which is better than B.
a2
B
b2
Logic Level
Technology mapping
Geometrical Level
Physical design
p-view
Synopsys University Courseware
Copyright © 2017 Synopsys, Inc. All rights reserved.
EDA Introduction
Lecture - 3
13 Developed By: Vazgen Melikyan
Optimization
Area (extensive)
Performance (intensive)
Power
Delay
Cycle-time
…
x1pmin
2 Y FX ; X x ;
i i 1, n
y 1 f 1 x 1 , , x n
y 2 f 2 x 1 , , x n
x1min
y m f m x 1 , , x n
X2
x2min x2pmin x2o x2pmax x2max
Efficiency function
y extr
1. Set of possible variants
Optimization criteria
Fx10 , x 20 extr
2. Set of permissible variants
3. Optimal variant
Synopsys University Courseware
Copyright © 2017 Synopsys, Inc. All rights reserved.
EDA Introduction
Lecture - 3
16 Developed By: Vazgen Melikyan
Design Hierarchy
U1
A
1 2 U3
B Block-hierarchic approach of
V1
V2
design is based on the hierarchy
3 V5
U2
V3
Z1
of mathematical models.
V4
4 5
Z2
C Model classification according to
description depth:
Full mathematical model of block A Micromodel
f1(U1, V1)=0; Macromodel
f2(U3, V5)=0; Metamodel
F(UA,ZA,VA)=0
~y yj
(~ j
j
y j ) relative deviation of output parameter
yj
m
Model accuracy for m parameter M max j or M 2
j
j1
j1, m
Tool examples
Easier to solve
Only worry about one problem at a time
Less computational work
Smaller problem size
Abstraction hides important objectives
Solving 2 problems optimally in a sequence often does not give
optimal result of simultaneous solution
Two important things to get back to
Disentangling problems
Coping with NP-hardness
Synopsys University Courseware
Copyright © 2017 Synopsys, Inc. All rights reserved.
EDA Introduction
Lecture - 3
26 Developed By: Vazgen Melikyan
Decomposition (3)
Scheduling
Logic optimization
Covering / gate-mapping
Partitioning
Placement
Routing
Selection of composition
Synopsys University Courseware
Copyright © 2017 Synopsys, Inc. All rights reserved.
EDA Introduction
Lecture - 3
27 Developed By: Vazgen Melikyan
Costs
NP-hard problems
Almost always solved in suboptimal manner
For particular special cases
Decomposed in suboptimal ways
Quality of solution changes as dominant costs
change
And relative costs are changing.
New effects and mapping problems crop up with
new architectures, substrates
Synopsys University Courseware
Copyright © 2017 Synopsys, Inc. All rights reserved.
EDA Introduction
Lecture - 3
33 Developed By: Vazgen Melikyan
Big Challenge
Dynamic programming
Linear programming (LP, ILP)
Graph algorithms
Greedy algorithms
Randomization
Search
Heuristics
Approximation algorithms
Synopsys University Courseware
Copyright © 2017 Synopsys, Inc. All rights reserved.
EDA Introduction
Lecture - 3
35 Developed By: Vazgen Melikyan