10.06.2016 Views

eldo_user

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Monte Carlo Analysis<br />

Importance Sampling Monte Carlo<br />

• It should produce high-quality random numbers uniformly distributed in the interval<br />

(0, 1).<br />

• The computations should be fast. Separate threads of random numbers are allowed to be<br />

generated in parallel.<br />

• It should be portable (Unix and Windows platforms).<br />

To start this generator, its initial state needs to be specified. Knuth introduced an algorithm that<br />

uses a single integer, which can take on approximately 10 9 different values, in such a way that a<br />

given seed is guaranteed to produce at least 10 21 different starts before colliding with those<br />

produced by a different seed.<br />

Importance Sampling Monte Carlo<br />

The Importance Sampling Monte Carlo (ISMC) method is dedicated to the estimation of failure<br />

probabilities (or the computation of parametric yield in circuit design terms) and, conversely, to<br />

the estimation of the thresholds corresponding to <strong>user</strong>-defined yield.<br />

Note<br />

Estimation of low failure probabilities is often called a “high sigma” problem in the EDA<br />

literature. The terms “low probability estimation” and “rare events simulation” are used in<br />

this section to mean the same thing.<br />

Rare events can be defined as the regions of the input parameter space that have a very small<br />

volume with respect to the measure induced by the joint probability of the parameters. The<br />

associated probabilities of interest are close to zero, and may range from 10 −4 to 10 −10 . In this<br />

context, Monte Carlo analysis is used as a verification tool to check that the probability of<br />

exceeding a performance specification is acceptably small.<br />

The Monte Carlo algorithm is an iterative simulation method that may be described briefly as a<br />

random exploration of the space of input parameters. The fundamental problem with this<br />

technique is that the sample size has to be large when the probabilities to estimate are small. For<br />

example, estimating a probability of around 10 −K (where K > 2) to a target accuracy of 10% will<br />

involve more than 10 −(K + 2) simulations of the circuit performances.<br />

The ISMC method is implemented using an adaptive procedure based on importance sampling,<br />

and has the following properties:<br />

• It is as insensitive as possible to the dimension of the problem.<br />

• It requires no prior knowledge to function. Specifically, it functions if nothing is known<br />

about the output distribution and its tails.<br />

• It does not need to be manually tuned to work with a given cell or circuit.<br />

452<br />

Eldo® User's Manual, 15.3

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!