Statistical Blockade: A Novel Method for Very Fast Monte Carlo Simulation of Rare Circuit Events, and its Application
- 1 April 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15301591,p. 1-6
Abstract
Circuit reliability under statistical process variation is an area of growing concern. For highly replicated circuits such as SRAMs and flip flops, a rare statistical event for one circuit may induce a not-so-rare system failure. Existing techniques perform poorly when tasked to generate both efficient sampling and sound statistics for these rare events. Statistical blockade is a novel Monte Carlo technique that allows us to efficiently filter - to block - unwanted samples insufficiently rare in the tail distributions we seek. The method synthesizes ideas from data mining and extreme value theory, and shows speed-ups of 10times - 100times over standard Monte CarloKeywords
This publication has 11 references indexed in Scilit:
- Estimation of delay variations due to random-dopant fluctuations in nanoscale CMOS circuitsIEEE Journal of Solid-State Circuits, 2005
- The impact of intrinsic device fluctuations on CMOS SRAM cell stabilityIEEE Journal of Solid-State Circuits, 2001
- Estimating the Tails of Loss Severity Distributions Using Extreme Value TheoryASTIN Bulletin, 1997
- Parameter and Quantile Estimation for the Generalized Pareto DistributionTechnometrics, 1987
- A Study of Variance Reduction Techniques for Estimating Circuit YieldsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Probability weighted moments: Definition and relation to parameters of several distributions expressable in inverse formWater Resources Research, 1979
- Statistical Inference Using Extreme Order StatisticsThe Annals of Statistics, 1975
- Residual Life Time at Great AgeThe Annals of Probability, 1974
- Sur La Distribution Limite Du Terme Maximum D'Une Serie AleatoireAnnals of Mathematics, 1943
- Limiting forms of the frequency distribution of the largest or smallest member of a sampleMathematical Proceedings of the Cambridge Philosophical Society, 1928