Proceedings of the 1998 IEEE/ACM International Conference on Computer-Aided Design - ICCAD '98 1998
DOI: 10.1145/288548.288630
|View full text |Cite
|
Sign up to set email alerts
|

Efficient analog circuit synthesis with simultaneous yield and robustness optimization

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
31
0
1

Year Published

2001
2001
2016
2016

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 38 publications
(32 citation statements)
references
References 10 publications
0
31
0
1
Order By: Relevance
“…The independence assumption in (8)- (11) simply implies that we do not know the correlation information between the late-stage coefficients {α L,n ; n = 1, 2, …, N} as a prior. However, the correlation between {α L,n ; n = 1, 2, …, N} will be taken into account by our proposed BMF algorithm through two different avenues: (i) when we legalize the prior distribution in (8) to guarantee that pdf L (g) in (2) is a valid probability density function, and (ii) when we calculate the posterior distribution of {α L,n ; n = 1, 2, …, N} once the late-stage simulation samples are available. In what follows, we will discuss these two topics (i.e., prior distribution legalization and posterior distribution calculation) in Section 3.2 and 3.3 respectively.…”
Section: Prior Knowledge Definitionmentioning
confidence: 99%
See 1 more Smart Citation
“…The independence assumption in (8)- (11) simply implies that we do not know the correlation information between the late-stage coefficients {α L,n ; n = 1, 2, …, N} as a prior. However, the correlation between {α L,n ; n = 1, 2, …, N} will be taken into account by our proposed BMF algorithm through two different avenues: (i) when we legalize the prior distribution in (8) to guarantee that pdf L (g) in (2) is a valid probability density function, and (ii) when we calculate the posterior distribution of {α L,n ; n = 1, 2, …, N} once the late-stage simulation samples are available. In what follows, we will discuss these two topics (i.e., prior distribution legalization and posterior distribution calculation) in Section 3.2 and 3.3 respectively.…”
Section: Prior Knowledge Definitionmentioning
confidence: 99%
“…Remember that the prior distribution in (8) assumes that all coefficients {α L,n ; n = 1, 2, …, N} are mutually independent and each coefficient follows a Gaussian distribution. Since these Gaussian distributions associated with {α L,n ; n = 1, 2, …, N} are not bounded, our definition of prior distribution in (8) allows a coefficient α L,n to take any value ranging from −∞ to +∞.…”
Section: Prior Distribution Legalizationmentioning
confidence: 99%
“…, n x . (Note that, in general, we can verify if this assumption holds since in many circuit designs it is easy to determine reasonable range of values for each design variable, e.g., (18).) We also assume that p i − 3σ p i > 0, i = 1, .…”
Section: B) Variance-not-linked-to-mean Variations In Design Variablementioning
confidence: 99%
“…Either lower bound (for maximal inscribed ellipsoid) or upper bound (for minimal circumscribed ellipsoid) of the actual parametric yield is estimated using this approach. The worst-case optimization techniques optimize worst-case circuit performances over all process and environmental variations (see, e.g., [16], [18]). Traditional worst-case optimization uses the process parameters taking values within a certain range which forms a tolerance "box," and the circuit performance is optimized for all of the "corners," or the vertices of the formed polyhedron.…”
mentioning
confidence: 99%
“…Recently numerous papers (e.g. [12], [18]- [23]) are addressing the sizing problem from different aspects like process and operating tolerances, mismatch, yield and robustness.…”
Section: Introductionmentioning
confidence: 99%