Introduction to Computer Design. Standard Forms for Boolean Functions. Sums and Products. Standard Forms for Boolean Functions (cont ) CMPT-150

Similar documents
Third handout: On the Gini Index

Assignment 7/MATH 247/Winter, 2010 Due: Friday, March 19. Powers of a square matrix

Lecture 3. Sampling, sampling distributions, and parameter estimation

CHAPTER 4 RADICAL EXPRESSIONS

Econometric Methods. Review of Estimation

Lecture 3 Probability review (cont d)

Assignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class)

HOOKE'S LAW. THE RATE OR SPRING CONSTANT k.

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:

Descriptive Statistics

A Primer on Summation Notation George H Olson, Ph. D. Doctoral Program in Educational Leadership Appalachian State University Spring 2010

CHAPTER VI Statistical Analysis of Experimental Data

Centroids Method of Composite Areas

Lecture Notes Types of economic variables

Mechanics of Materials CIVL 3322 / MECH 3322

Design maintenanceand reliability of engineering systems: a probability based approach

Summary of the lecture in Biostatistics

i 2 σ ) i = 1,2,...,n , and = 3.01 = 4.01

Regression and the LMS Algorithm

QR Factorization and Singular Value Decomposition COS 323

Continuous Random Variables: Conditioning, Expectation and Independence

Lecture 9: Tolerant Testing

Non-uniform Turán-type problems

CS 1675 Introduction to Machine Learning Lecture 12 Support vector machines

Lecture Notes 2. The ability to manipulate matrices is critical in economics.

A tighter lower bound on the circuit size of the hardest Boolean functions

Chapter 5. Curve fitting

Linear Regression with One Regressor

Simple Linear Regression

Lecture Notes Forecasting the process of estimating or predicting unknown situations

2. Independence and Bernoulli Trials

Objectives of Multiple Regression

STATISTICS 13. Lecture 5 Apr 7, 2010

Chapter 9 Jordan Block Matrices

PTAS for Bin-Packing

Block-Based Compact Thermal Modeling of Semiconductor Integrated Circuits

02/15/04 INTERESTING FINITE AND INFINITE PRODUCTS FROM SIMPLE ALGEBRAIC IDENTITIES

1. Overview of basic probability

0/1 INTEGER PROGRAMMING AND SEMIDEFINTE PROGRAMMING

Algorithms Theory, Solution for Assignment 2

Functions of Random Variables

MMJ 1113 FINITE ELEMENT METHOD Introduction to PART I

Chapter 13, Part A Analysis of Variance and Experimental Design. Introduction to Analysis of Variance. Introduction to Analysis of Variance

Chapter 2 Supplemental Text Material

Introduction to Matrices and Matrix Approach to Simple Linear Regression

St John s College. Preliminary Examinations July 2014 Mathematics Paper 1. Examiner: G Evans Time: 3 hrs Moderator: D Grigoratos Marks: 150

( ) 2 2. Multi-Layer Refraction Problem Rafael Espericueta, Bakersfield College, November, 2006

Parameter, Statistic and Random Samples

CS5620 Intro to Computer Graphics

9.1 Introduction to the probit and logit models

ICS141: Discrete Mathematics for Computer Science I

Johns Hopkins University Department of Biostatistics Math Review for Introductory Courses

Chapter 5 Properties of a Random Sample

Lecture 1: Introduction to Regression

Machine Learning. Introduction to Regression. Le Song. CSE6740/CS7641/ISYE6740, Fall 2012

Sampling Theory MODULE V LECTURE - 14 RATIO AND PRODUCT METHODS OF ESTIMATION

Johns Hopkins University Department of Biostatistics Math Review for Introductory Courses

COMPLEX NUMBERS AND DE MOIVRE S THEOREM

The internal structure of natural numbers, one method for the definition of large prime numbers, and a factorization test

L5 Polynomial / Spline Curves

Unsupervised Learning and Other Neural Networks

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

Random Variables and Probability Distributions

ESS Line Fitting

1 Mixed Quantum State. 2 Density Matrix. CS Density Matrices, von Neumann Entropy 3/7/07 Spring 2007 Lecture 13. ψ = α x x. ρ = p i ψ i ψ i.

Lecture 12 APPROXIMATION OF FIRST ORDER DERIVATIVES

Special Instructions / Useful Data

The number of observed cases The number of parameters. ith case of the dichotomous dependent variable. the ith case of the jth parameter

Application of Calibration Approach for Regression Coefficient Estimation under Two-stage Sampling Design

NATIONAL SENIOR CERTIFICATE GRADE 11

Lecture 1: Introduction to Regression

C.11 Bang-bang Control

EECE 301 Signals & Systems

Arithmetic Mean and Geometric Mean

Ordinary Least Squares Regression. Simple Regression. Algebra and Assumptions.

STA 108 Applied Linear Models: Regression Analysis Spring Solution for Homework #1

Chapter 3 Sampling For Proportions and Percentages

Some Notes on the Probability Space of Statistical Surveys

Basic Structures: Sets, Functions, Sequences, and Sums

Power Flow S + Buses with either or both Generator Load S G1 S G2 S G3 S D3 S D1 S D4 S D5. S Dk. Injection S G1

MA 524 Homework 6 Solutions

UNIT 7 RANK CORRELATION

: At least two means differ SST

best estimate (mean) for X uncertainty or error in the measurement (systematic, random or statistical) best

MEASURES OF DISPERSION

Part 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971))

( ) = ( ) ( ) Chapter 13 Asymptotic Theory and Stochastic Regressors. Stochastic regressors model

Analysis of Lagrange Interpolation Formula

Generative classification models

The equation is sometimes presented in form Y = a + b x. This is reasonable, but it s not the notation we use.

Binary classification: Support Vector Machines

Fibonacci Identities as Binomial Sums

ENGI 4430 Numerical Integration Page 5-01

Correlation and Simple Linear Regression

REIHE INFORMATIK 7/95. Extremal Codes for Speed-Up of Distributed Parallel Arbitration

4 Inner Product Spaces

Chapter Business Statistics: A First Course Fifth Edition. Learning Objectives. Correlation vs. Regression. In this chapter, you learn:

Evaluation of uncertainty in measurements

1 Onto functions and bijections Applications to Counting

UNIT 1 MEASURES OF CENTRAL TENDENCY

Transcription:

CMPT- Itroducto to Computer Desg SFU Harbour Cetre Sprg 7 Lecture : Ja. 6 7 Stadard orms or boolea uctos Sum o Products Product o Sums Stadard Forms or Boolea Fuctos (cot ) It s useul to spec Boolea uctos a orm that: Allows comparso or equalt. Has a correspodece to the truth tables Stadard (caocal) Forms commo usage: Sum o Products Product o Sums Stadard Forms or Boolea Fuctos A boolea ucto ca be descrbed uquel b a truth table but several was as a boolea epresso leads to deret logc crcuts. ( ) = ( ) ( ) = ( ) ( ) () Sums ad Products Lteral: A varable or a complemet o a varable. Eamples: A B Product term: a lteral or a cojucto (AND) o lterals. Eamples: Sum o Products: a product term or a dsjucto (OR) o several product terms. Sum term: a lteral or a dsjucto (OR) o lterals. Eamples: Product o Sums: a sum term or a dsjucto (OR) o several product terms. ( )( ) ( )( ) ( )

Sums ad Products (cot ) For each ucto below spec t s a Sum o Products orm or Product o Sums orm or ether. = = ( )( ) = ( ) = ( ) = Materms Materm: a sum term whch ever varable appears eactl oce ether complemeted or ot complemeted. Eample: For varables there are 8 possble materms: For a materm there s a uque assgmet o s ad s to the varables such that the value o the materm s. Note: ever materm the varables appear the same order (usuall lecographc). Mterms Mterm: a product term whch ever varable appears eactl oce ether complemeted or ot complemeted. Eample: For varables there are 8 possble mterms: For a mterm there s a uque assgmet o s ad s to the varables such that the value o the mterm s. Note: ever mterm the varables appear the same order (usuall lecographc). Q: How ma mterms are there or varables? Idces o Mterms ad Materms Istead o wrtg the mterms/materms we ca order them ad reer to a mterm/materm b ts de the order. Ide (decmal) 6 7 Ide (bar) Mterm Materm

Idces o Mterms ad Materms (cot ) The de bar base dcates whch varables are ther complemeted orm: For a mterm the th bt s the the correspodg varable s complemeted otherwse ot complemeted. For a materm the th bt s the the correspodg varable s ot complemeted otherwse complemeted. Eample: For the our varables wrte the mterm ad the materm that correspod to the de 9. 9 = () The mterm wth de s deoted b m. The materm wth de s deoted b M. Truth Tables or Both Mterms o Materms o varables varables m m m m M M M M Each colum the materm ucto table s the complemet o the colum the mterm ucto table sce M s the complemet o m. Mterm ad Materm Relatoshp Revew: B De-Morga s laws = ad = Two varables eample: m ad M = = M s the complemet o m ad vce-versa. De-Morga s laws ca be geeraled to varables: L = L ad L = L For a umber o varables ad a de we have: m = = M ad M m Observatos I the truth tables: Each mterm has eactl oe preset the terms. Each materm has eactl oe preset the terms. We ca mplemet a ucto b "ORg" the mterms correspodg to "" etres the ucto table. These are called the mterms o the ucto. We ca mplemet a ucto b "ANDg" the materms correspodg to "" etres the ucto table. These are called the materms o the ucto. Ths gves us two stadard (caocal) orms: Sum o Mterms (SOM) Product o Materms (POM) or statg a Boolea ucto.

Sum o Mterms: Eample We ca mplemet a ucto b "ORg" the mterms correspodg to "" etres the ucto table. Eample: wrte () SOM orm. Ide () Short orm b dces: ( ) = (67 ) 6 7 The Number o Levels a Crcut Revew: Gve two crcuts that mplemet the same ucto whch oe s better? Possble measure: the umber o levels a crcut. Product o Materms: Eample We ca mplemet a ucto b "ANDg" the materms correspodg to "" etres the ucto table. Eample: wrte () POM orm. Ide () Short orm b dces: = ( ) 6 7 Propagato Dela Propagato/gate dela: the elapsed tme rom the momet the puts o a gate are stable utl the outputs are stable. NOT Gate (verter) OUTPUT INPUT. HIGH HIGH. Volts A Ā LOW.... Volts LOW A Ā tme t t tme t Propagato dela: t pd = t - t

Propagato Dela (cot ) The dela o a path rom a put sgal to a output sgal s the sum o delas o the gates alog that path. The dela o a crcut s the mamum dela o a o paths rom a put sgal to a output sgal the crcut. D D D t pd (D ) =.s t pd (D ) =.s D D levels crcut t pd (D ) =.s The logest path t pd (D )t pd (D )t pd (D )t pd (D )=.9s I all the gates have roughl the same dela the the total dela s proportoal to the mamum umber o gates alog a path rom put to output = the umber o levels. Smplg Sum o Products Ever ucto has at least oe represetato as Sum o Products: Sum o Mterms. Other represetatos as Sum o Products possbl smpler mght also est ad ca be oud usg Boolea dettes. Eample: ( ) = ( = ) = = (Dstrbutve) (Complemet) (Idett) Sum o Products ad -Level Gates Sum o Products represetato elds a -level gate* Level : AND gates or the Products o the puts. Level : OR gates or the Sum o Products. Eample: ( ) = Smlarl Product o Sums also elds a -level gate* * Assumg or ever put ts complemet s also a put. Summar Stadard orms or boolea uctos: Sum o Products Product o Sums Ever boolea ucto ca be represeted as a Sum o Mterms ad as a Sum o Materms. These represetatos correspod to -level crcuts that eld a small propagato dela. Boolea Algebra ca be used to d smpler orms as sum o products or product sums lead to smpler -level crcuts. Ca we atta the smplest epresso? Is there ol oe mmum cost crcut?