Basic Statistical Analysis and Yield Calculations

Similar documents
Composite Hypotheses testing

CIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M

Statistics Chapter 4

U-Pb Geochronology Practical: Background

Modeling and Simulation NETW 707

Uncertainty in measurements of power and energy on power networks

Economics 130. Lecture 4 Simple Linear Regression Continued

CS 2750 Machine Learning. Lecture 5. Density estimation. CS 2750 Machine Learning. Announcements

Statistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics )

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Answers Problem Set 2 Chem 314A Williamsen Spring 2000

Here is the rationale: If X and y have a strong positive relationship to one another, then ( x x) will tend to be positive when ( y y)

x = , so that calculated

Department of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution

Statistics for Economics & Business

x i1 =1 for all i (the constant ).

An Application of Fuzzy Hypotheses Testing in Radar Detection

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Simulation and Probability Distribution

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan

Econometrics of Panel Data

See Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

STAT 3008 Applied Regression Analysis

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Laboratory 1c: Method of Least Squares

Lecture 20: Hypothesis testing

Goodness of fit and Wilks theorem

BIO Lab 2: TWO-LEVEL NORMAL MODELS with school children popularity data

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Classification as a Regression Problem

Some basic statistics and curve fitting techniques

Linear Regression Analysis: Terminology and Notation

En Route Traffic Optimization to Reduce Environmental Impact

Predictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore

Variability-Driven Module Selection with Joint Design Time Optimization and Post-Silicon Tuning

Problem Set 9 Solutions

Lossy Compression. Compromise accuracy of reconstruction for increased compression.

Regulation No. 117 (Tyres rolling noise and wet grip adhesion) Proposal for amendments to ECE/TRANS/WP.29/GRB/2010/3

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

Negative Binomial Regression

RELIABILITY ASSESSMENT

Flexible Allocation of Capacity in Multi-Cell CDMA Networks

Statistical Evaluation of WATFLOOD

Laboratory 3: Method of Least Squares

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

Second Order Analysis

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Statistics for Managers Using Microsoft Excel/SPSS Chapter 13 The Simple Linear Regression Model and Correlation

8/25/17. Data Modeling. Data Modeling. Data Modeling. Patrice Koehl Department of Biological Sciences National University of Singapore

Basic Business Statistics, 10/e

find (x): given element x, return the canonical element of the set containing x;

Statistics II Final Exam 26/6/18

Chapter 5 Multilevel Models

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

ECE559VV Project Report

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

Chapter 3 Describing Data Using Numerical Measures

Cathy Walker March 5, 2010

First Year Examination Department of Statistics, University of Florida

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

CHAPTER 6 GOODNESS OF FIT AND CONTINGENCY TABLE PREPARED BY: DR SITI ZANARIAH SATARI & FARAHANIM MISNI

PHYS 450 Spring semester Lecture 02: Dealing with Experimental Uncertainties. Ron Reifenberger Birck Nanotechnology Center Purdue University

Properties of Least Squares

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1

1. Inference on Regression Parameters a. Finding Mean, s.d and covariance amongst estimates. 2. Confidence Intervals and Working Hotelling Bands

Markov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement

2016 Wiley. Study Session 2: Ethical and Professional Standards Application

Logistic Regression. CAP 5610: Machine Learning Instructor: Guo-Jun QI

Regression Analysis. Regression Analysis

Department of Quantitative Methods & Information Systems. Time Series and Their Components QMIS 320. Chapter 6

Joint Statistical Meetings - Biopharmaceutical Section

MATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)

FUZZY FINITE ELEMENT METHOD

The Gaussian classifier. Nuno Vasconcelos ECE Department, UCSD

Chapter 11: Simple Linear Regression and Correlation

Hydrological statistics. Hydrological statistics and extremes

Exam. Econometrics - Exam 1

Limited Dependent Variables and Panel Data. Tibor Hanappi

Lecture 6 More on Complete Randomized Block Design (RBD)

MACHINE APPLIED MACHINE LEARNING LEARNING. Gaussian Mixture Regression

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities

Confidence Intervals for the Overall Effect Size in Random-Effects Meta-Analysis

A quantum-statistical-mechanical extension of Gaussian mixture model

Probability Theory (revisited)

Interval Estimation in the Classical Normal Linear Regression Model. 1. Introduction

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

Chapter 2 - The Simple Linear Regression Model S =0. e i is a random error. S β2 β. This is a minimization problem. Solution is a calculus exercise.

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

Turbulence classification of load data by the frequency and severity of wind gusts. Oscar Moñux, DEWI GmbH Kevin Bleibler, DEWI GmbH

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora

Statistical Circuit Optimization Considering Device and Interconnect Process Variations

BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS. M. Krishna Reddy, B. Naveen Kumar and Y. Ramu

Probability Theory. The nth coefficient of the Taylor series of f(k), expanded around k = 0, gives the nth moment of x as ( ik) n n!

Strong Markov property: Same assertion holds for stopping times τ.

Lecture 4 Hypothesis Testing

Testing for seasonal unit roots in heterogeneous panels

[The following data appear in Wooldridge Q2.3.] The table below contains the ACT score and college GPA for eight college students.

ANOVA. The Observations y ij

Transcription:

October 17, 007 Basc Statstcal Analyss and Yeld Calculatons Dr. José Ernesto Rayas Sánchez 1 Outlne Sources of desgn-performance uncertanty Desgn and development processes Desgn for manufacturablty A general formulaton to statstcal analyss Tolerance and acceptablty regons Yeld defntons Calculatng the yeld Statstcal dstrbutons and tolerances Nomnal optmzaton vs yeld optmzaton 1

October 17, 007 Sources of Desgn-Performance Uncertanty FROM THE DESIGN PROCESS Modelng errors Numercal errors (smulaton errors) FROM THE MANUFACTURING PROCESS Envronmental effects Component agng Fabrcaton mprecson FROM THE TESTING PROCESS Measurement nose Calbraton errors Measurement errors 3 Typcal Desgn and Development Process Start Structure and components Hand calculatons Develop ntal desgn CAD smulatons Manufacture prototype Redesgn Test reject End pass 4

October 17, 007 Improvng the Desgn and Development Process Start Structure and components Hand calculatons Parameter statstcs Manufacturng and test models Develop ntal desgn Manufacture prototype Redesgn CAD smulatons, yeld analyss and optmzaton Test reject End pass 5 Desgn for Manufacturablty Start Choose structure and components Assgn ntal parameter values Smulate performance Optmze performance no Performance acceptable? yes Analze yeld Yeld acceptable? no yes End to manufacture... Optmze yeld 6 3

October 17, 007 Achevng a Hgh Yeld By numercal methods (yeld optmzaton): for a gven structure, fnd a nomnal soluton that best sut the manufacturng tolerances - $ By developng new structures: fnd a structure (topology, components, materals) less senstve to manufacturng tolerances - $$$$ By controllng (ncreasng precson of) the manufacturng process - $$$$$$$$$$ 7 A General Formulaton to Statstcal Analyss It s assumed that the crcut topology and the component types are already selected by the desgner and are fxed y R t represent the t parameters of the electronc crcut that are subject to statstcal fluctuatons The optmzaton varables are restrcted to a regon X of vald desgn parameters x X R n represent the n optmzaton varables of the electronc crcut to be optmzed y ncludes all the elements n x (n m) The elements n y not ncluded n x are consdered preassgned parameters, contaned n vector p R m, wth m = t n 8 4

October 17, 007 A Formulaton to Statstcal Analyss (cont) The parameters of the k-th manufactured devce, outcome y k, are actually spread around the nomnal pont y accordng to ther statstcal dstrbutons and tolerances These parameters can be represented as y = y + j y j j = 1,, N where N s the number of outcomes, and y j represents a random varaton for the j-th outcome 9 A Formulaton to Statstcal Analyss (cont) The crcut responses are denoted by R(y) R r where r s the number of responses to be optmzed The statstcal analyss of a crcut around a nomnal pont y conssts of realzng N smulatons of R(y j )for j = 1 to N (also called Monte Carlo analyss) The number of outcomes N must be suffcently large to have statstcal sgnfcance 10 5

October 17, 007 Tolerance and Acceptablty Regons T: Desgn tolerance regon around a pont x (depends on all the sources of uncertanty) A: Desgn acceptablty regon for the responses (depends on the desgn specfcatons) Example: 11 Yeld Defntons The probablty that a manufactured unt (outcome) wll pass ts performance test The probablty that a manufactured unt wll satsfy all ts desgn specfcatons The rato of the number of manufactured unts whch pass performance testng to the total number of unts manufactured (n the lmt, when the number of unts tends to nfnty) The ntersecton between the A and T regons, over T 1 6

October 17, 007 Yeld Defntons (cont) The ntersecton between the A and T regons, over T Y = A T T x * : optmal nomnal soluton 13 Yeld Defntons (cont) The ntersecton between the A and T regons, over T A T Y = T x Y* : optmal yeld soluton 14 7

October 17, 007 Calculatng the Yeld Usng a mnmax objectve functon U, { Ke ( y) } U ( y) = max K Vector e(y) contans all the error functons wth respect to the desgn specfcatons e(y) s formulated such that a postve element value n e(y j ) mples that the j-th outcome s volatng some desgn specfcaton k 15 Calculatng the Yeld (cont) Each outcome has an acceptance ndex defned by 1, Ia ( y j ) = 0, f U ( y j ) 0 f U ( y ) > 0 If N s suffcently large for statstcal sgnfcance, the yeld Y at the nomnal pont y can be approxmated by usng 1 Y ( y) ( y j ) N N I a j= 1 j 16 8

October 17, 007 Probablty Dstrbutons The crcut parameters for the j-th outcome at the nomnal desgn y are gven by y j = y + y j, where y j represents a random varaton for the j-th outcome Each parameter n y follows some probablty dstrbuton functon (PDF), typcally unform, normal (Gaussan) or bnormal If the -th parameter y follows a probablty dstrbuton functon p, then the probablty of y to have a value between y = a and b s b p ( a y b) = p ( y ) dy y = a p( y ) = p ( y ) dy = 1 17 Normal Probablty Dstrbuton Functon 1 p y) = e σ π ( y µ ) ( σ µ average σ standard devaton σ varance 0.4 0.3 Gaussan PDF (µ = 0) σ = 1 σ = σ = 3 0.4 0.3 Gaussan PDF (σ = 1) µ = 0 µ = µ = -3 p(y) 0. p(y) 0. 0.1 0.1 0-5 0 5 y 0-5 0 5 y 18 9

October 17, 007 Student s t Probablty Dstrbuton Functon ν 1 Γ + y 1 + ν p( y) = νπ Γ 0.4 0.3 ( ν / ) ( ν + 1)/ Student's t PDF ν degrees of freedom Γ gamma functon ν = 1 ν = ν = 3 ν = 30 p(y) 0. 0.1 0-5 0 5 y 19 Raylegh Probablty Dstrbuton Functon y = yb e b center (Raylegh) b p( y) p(y) 0.7 0.6 0.5 0.4 0.3 0. 0.1 Raylegh PDF b = 1 b = b = 3 0-0 4 6 y 0 10

October 17, 007 Probablty Dstrbutons and Tolerances Unform dstrbuton p( y) p ( y) = C Gaussan dstrbuton 1 = e σ π y σ ( ) p y y(tol) y 0 +y(tol) p( y) σ varance σ standard devaton y(tol) 0 +y(tol) y 1 Calculatng the Number of Outcomes, N We assume that all the statstcal crcut parameters follow a Gaussan probablty dstrbuton functon The number of outcomes N needed to have a certanty c when calculatng the yeld can be obtaned from where Y: estmated (expected) yeld ε: error n the yeld estmaton t: statstcal value wth a probablty c to happen (c s the area under the bell curve between t and +t) [ t( c) ] N = round ( Y )(1 Y ) ε (Meehan and Purvance, 1993) 11

October 17, 007 Crcut Nomnal Optmzaton The problem of crcut nomnal optmzaton s formulated as typcally, x x * * = arg mn ( R( x)) x U = arg mn max{ e ( x)} x where all the parameters n the crcut (elements n y) have zero tolerances, x * s the optmal nomnal desgn, R(x * ) = R * s the optmal nomnal response, and U s the objectve functon 3 Crcut Yeld Optmzaton The problem of crcut yeld optmzaton s formulated as Y* x = arg mn U ( x) where some elements of y have non zero tolerances, x Y* s the optmal yeld soluton, R(x Y* ) = R Y* s the optmal yeld response, and U Y s some sutable yeld objectve functon x Y 4 1