2010 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE 2010) 2010
DOI: 10.1109/date.2010.5456971
|View full text |Cite
|
Sign up to set email alerts
|

Computation of yield-optimized Pareto fronts for analog integrated circuit specifications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…Therefore, instead of a single solution, multi-objective algorithms provide the trade-off of the multiple objectives represented in the Pareto front [17]. The Pareto front is a set of solution points that can not be improved in one objective without getting degraded in another [13,18]. The general formulation of a constrained optimization problem is as follows: ub , e(x,p) = 0, and g(x,p) < 0.…”
Section: Multi-objective Optimizationmentioning
confidence: 99%
See 2 more Smart Citations
“…Therefore, instead of a single solution, multi-objective algorithms provide the trade-off of the multiple objectives represented in the Pareto front [17]. The Pareto front is a set of solution points that can not be improved in one objective without getting degraded in another [13,18]. The general formulation of a constrained optimization problem is as follows: ub , e(x,p) = 0, and g(x,p) < 0.…”
Section: Multi-objective Optimizationmentioning
confidence: 99%
“…Optimization algorithms can be classified in two main categories according to the operations performed to find solutions: deterministic or gradient-based [19,20], and stochastic or heuristicsbased [12,18,[21][22][23]. If a problem has an objective function that allows the calculation of gradients and a search space with a global minimum, using deterministic algorithms is usually the fastest way to find a solution.…”
Section: Multi-objective Optimizationmentioning
confidence: 99%
See 1 more Smart Citation
“…In the literature, many yield-aware synthesis approaches are proposed based on simulation-based techniques [3][4][5][6]. After the device sizes are obtained in each iteration, the design yield is also evaluated while simulating the circuit performance.…”
Section: Introductionmentioning
confidence: 99%
“…Although the result of the approach might not be the global worst case points, the su±cient accuracy of the method has been shown in previous publications. 7,13 Besides the worst case points, the gradient of the objective function must be computed for the FSQP approach. For this purpose, the sensitivities against variations in the design parameters and the performance values are computed at the approximated worst case points in lines 13À18.…”
Section: Automatic Sizing Approachmentioning
confidence: 99%