Next:
Mathematic Optimization
Up:
Design and optimization techniques
Previous:
Conclusions
Contents
Optimization
Subsections
Mathematic Optimization
Optimization theory
Mono-objective optimization
Unconstrained problem
Constrained problem
Multi-objective optimization
Unconstrained
Constrained
Optimization Algorithms
One-dimensional search techniques
The section search
Parabolic interpolation
Multi-dimensional search
The gradient direction: steepest (maximum) descent
The optimal gradient
The conjugate direction method
The Fletcher-Reeves conjugate gradient algorithm
The Powell conjugate gradient algorithm
The ``SLOP'' algorithm
The simulated-annealing algorithm
Conclusions
Circuit Optimization
Optimization targets
Circuit delay
Delay formula obtained by the Elmore model
Delay measurement obtained by the
FAST
model and by
HSPICE
Power consumption
Area
Optimization examples
Algorithm choice
Mono-objective optimizations
Area
Power
Delay
Multi-objective optimizations
Conclusion
A
CAD
tool for optimization
Logical description
The optimization algorithm module (
OAM
)
The function evaluation module (
FEM
)
Core engine
Code implementation
The classes CircuitNetlist and Circuit
The class EvaluationAlgorithm
The class OptimizationAlgorithm
The critical path retrieving
The derived classes
Program flows
Conclusions
Results and conclusions
Optimization
Mono-objective vs. Multiobjective
Conclusions
Future works
Class graph
Source code
Main functions
Optimization algorithms
Simulators
marco+site@equars.com
