VLSI Testing Assignment 2

Similar documents
Tangram Fractions Overview: Students will analyze standard and nonstandard

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

Edge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work?

Walk Like a Mathematician Learning Task:

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

In which direction do compass needles always align? Why?

Functions and Graphs 1. (a) (b) (c) (f) (e) (d) 2. (a) (b) (c) (d)

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

Complete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT

OpenMx Matrices and Operators

Online Supplement: Advance Selling in a Supply Chain under Uncertain Supply and Demand

Weighted Graphs. Weighted graphs may be either directed or undirected.

The University of Sydney MATH 2009

Lecture 20: Minimum Spanning Trees (CLRS 23)

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

CS 103 BFS Alorithm. Mark Redekopp

Overview. Usages of Fault Simulators. Problem and Motivation. Alternatives and Their Limitations. VLSI Design Verification and Testing

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

CS150 Sp 98 R. Newton & K. Pister 1

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

Physics 222 Midterm, Form: A

Planar convex hulls (I)

TOPIC 5: INTEGRATION

(4, 2)-choosability of planar graphs with forbidden structures

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

k m The reason that his is very useful can be seen by examining the Taylor series expansion of some potential V(x) about a minimum point:

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

QUESTIONS BEGIN HERE!

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

1 Introduction to Modulo 7 Arithmetic

Present state Next state Q + M N

d e c b a d c b a d e c b a a c a d c c e b

EE1000 Project 4 Digital Volt Meter

Designing A Uniformly Loaded Arch Or Cable

Section 3: Antiderivatives of Formulas

G-001 SACO SACO BAY BIDDEFORD INDEX OF NAVIGATION AIDS GENERAL NOTES: GENERAL PLAN A6 SCALE: 1" = 1000' CANADA MAINE STATE PLANE GEOGRAPHIC NO.

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

Experiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor

Minimum Spanning Trees

QUESTIONS BEGIN HERE!

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

Outlines: Graphs Part-4. Applications of Depth-First Search. Directed Acyclic Graph (DAG) Generic scheduling problem.

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

Outline. Binary Tree

The tangent line and the velocity problems. The derivative at a point and rates of change. , such as the graph shown below:

G-001 CHATHAM HARBOR AUNT LYDIA'S COVE CHATHAM ATLANTIC OCEAN INDEX OF NAVIGATION AIDS GENERAL NOTES: GENERAL PLAN A6 SCALE: 1" = 500' CANADA

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Lecture 4. Conic section

Decimals DECIMALS.

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall

CS September 2018

BASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY

Planar Upward Drawings

( ) ( ) ( ) 0. Conservation of Energy & Poynting Theorem. From Maxwell s equations we have. M t. From above it can be shown (HW)

BASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP

c 2009 Society for Industrial and Applied Mathematics

Strongly connected components. Finding strongly-connected components

Case Study VI Answers PHA 5127 Fall 2006

ENGR 7181 LECTURE NOTES WEEK 3 Dr. Amir G. Aghdam Concordia University

CPS 616 W2017 MIDTERM SOLUTIONS 1

Closed Monochromatic Bishops Tours

SAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings

Indices. Indices. Curriculum Ready ACMNA: 209, 210, 212,

A New Binary Sequence Family with Low Correlation and Large Size

Chapter 2. Numerical Integration also called quadrature. 2.2 Trapezoidal Rule. 2.1 A basic principle Extending the Trapezoidal Rule DRAWINGS

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Limits Indeterminate Forms and L Hospital s Rule

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2

Chem 104A, Fall 2016, Midterm 1 Key

DFA Minimization. DFA minimization: the idea. Not in Sipser. Background: Questions: Assignments: Previously: Today: Then:

Fractions. Mathletics Instant Workbooks. Simplify. Copyright

Ch 1.2: Solutions of Some Differential Equations

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

Direct Approach for Discrete Systems One-Dimensional Elements

Relation between Fourier Series and Transform

1- I. M. ALGHROUZ: A New Approach To Fractional Derivatives, J. AOU, V. 10, (2007), pp

Optimization of Multistage Interconnection Networks

Priority Search Trees - Part I

An action with positive kinetic energy term for general relativity. T. Mei

University of Washington Department of Chemistry Chemistry 453 Winter Quarter 2014 Lecture 20: Transition State Theory. ERD: 25.14

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

NOTE: ONLY RIGHT IDLER (CONFIGURATION A) ARM SHOWN IN VIEWS ON THIS PAGE

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

3-2-1 ANN Architecture

Face Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017

Problem solving by search

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

A L A BA M A L A W R E V IE W

160 SSC Variable Speed Drive (Series C)

Theoretical Study on the While Drilling Electromagnetic Signal Transmission of Horizontal Well

P a g e 5 1 of R e p o r t P B 4 / 0 9

Problem 1. Solution: = show that for a constant number of particles: c and V. a) Using the definitions of P

Transcription:

1. 5-vlu D-clculus trut tbl or t XOR unction: XOR 0 1 X D ~D 0 0 1 X D ~D 1 1 0 X ~D D X X X X X X D D ~D X 0 1 ~D ~D D X 1 0 Tbl 1: 5-vlu D-clculus Trut Tbl or t XOR Function Sinc 2-input XOR t wors s comprtor or prity ccr, outputtin 0 wn t inputs r t sm n 1 wn ty r irnt, it is ncssry to now bot vlus t t inputs in orr to vlut t output. I on vlu is not nown, ow cn t t compr it to t otr vlu? Simply, it cnnot. Tus, or ll css wr n input is unnown t output is unnown. s suc t X inputs l to X outputs. Wn on input s t vlu 0, t output will b t sm s t vlu o t otr input. 0 n 1 ivs 1, 0 n ~D ivs ~D, n so on. Wn on input s t vlu 1, t output will b t complmnt o t vlu o t otr input. 1 n 0 ivs 1, 1 n ~D ivs D, 1 n 1 ivs 0, n so on. T rminin css r tos wn bot inputs r itr D or ~D. s t XOR t wors s comprtor, i bot vlus r t sm, t output will b 0. Tis is tru wn bot inputs r itr D, or bot inputs r ~D. Wn bot inputs r irnt t output will b 1, suc is t cs wn on input is D n t otr is ~D. 2. Primitiv ub or XOR XOR 0 0 0 1 1 0 0 1 1 1 0 1 Tbl 2: Primry ub Tbl or 2 Input XOR Gt s cn b sn in t bov tbl Tbl 2 tr is no minimiztion possibl in inin t Primry ubs o n XOR t. ll ntris r rquir, s n unnown t t input rsults in n unnown output, s sown bov Tbl 1. P 1 o 7

Primitiv ub or 2:1 MUX Sl Output 0 0 0 0 0 1 0 0 1 0 0 1 1 1 0 1 0 0 1 0 0 1 1 1 1 0 1 0 1 1 1 1 Tbl 3: Trut Tbl or 2:1 MUX Sl Output 0 X 0 0 X 0 1 0 X 1 1 1 1 X 0 1 Tbl 4: Primry ub Tbl or 2:1 MUX s cn b sn in t bov tbl, t slction lin must b ctiv to t n output. T input tt psss trou t multiplxor ccorin to t slct lin must b spcii. T otr inconsquntil input cn b ny vlu, rprsnt by n X in t tbl bov. 3. s w r tstin or stuc-t-1 ult t t no, w cn st t vlu o tis no to: = D P 2 o 7

W n to riv tis D vlu to Primry Output PO. It is ssum tt sinc nos,, n r lbl irntly tt ty cn b isjoint. s in t cs r, wr is s--1 n n unction normlly. s suc, it is impossibl to riv t D vlu to t output. Tror, w will riv t D vlu to. Tus, = D W cnnot stblis wt t output t is s it pns on t vlu o. Eitr 1 or 0 or is vli s tis will rsult in n output o D or ~D or, rspctivly. W r, now, t t stp wr w must o t justiiction by bc proptin our st vlus. W now tt in orr to tst i is s--1: = = 0 In orr to civ t prvious conition, w n = = 0 In orr or = 0, w n = = 1 In orr or = 0, sinc = 1, w n = 1 In orr or to not b qul to 0, w n = 1 In orr or = 1, w n or n to b irnt. s w v prviously stblis tt = = 1, w cn s tt t ult is runnt, n cnnot b tst or. nswr: Tr r no vctors to tst tis ult s it is runnt. 4. PODEM Mto or prormin src or no s--1. ccorin to my uristics blow t orr is s ollows: 1 0 F1 D 1 0 F2 F3 FX is trminl stt rsultin in no tst vctor. P 3 o 7

F1 is u to t ct tt bin 1 orcs to vlu o 1, wic os not tst or t s--1 conition soul b 0. F2 is u to t ct tt D bin 1 orcs to vlu o 1, wic os not tst or t s--1 conition soul b 0. F3 is u to t ct tt bot n D bin 0 os not llow or t vlu t to b pss to nitr nor. Tus, t s--1 ult cnnot b tst or s t D-vlu t tis no cnnot b pus orwr to PO rrlss o t PI vctors. s--1 is runnt ult. b T uristics us or prt wr s ollows: ssin t primry inputs PI tt irctly inlunc t vlu t t no unr tst. Do tis in orr to st to t rit conition: 1 or s- -0 ults, n 0 or s--1 ults. Ts PIs r n D. s t prvious stp prov tt t ult ws runnt, t nxt stps r moot. I will, owvr, inict t uristics tt woul v bn us t prvious stp not il. Onc, t no unr tst s bn snsitiz, stblis snsitiz pt to t primry output PO, wic woul v rquir us ssinin vlus to itr or, or n. Finlly, t inputs tt sm to ct t pt to t output most inirctly woul v bn ssin, E n F. ll tis woul v l to tst vctor, t ult not bn runnt. 5. Drivin lobl implictions or t SORTES loritm, will not b on or trivil css wic only spn on t. =1 =1 m=1 p=0 =1 =1 m=1 q=1 Tror, =1 p=0. n, =1 q=1. n, =1 m=1. D=1 =1 m=1 p=0 D=1 =1 m=1 q=1 Tror, D=1 p=0. n, D=1 q=1. n, D=1 m=1. =0 m=0 =0 u=0 =1 w=1 Wit mous ponns, w cn lso in t ollowin implictions, p=1 =0 q=0 =0 P 4 o 7

m=0 =0 p=1 D=0 q=0 D=0 m=0 D=0 m=1 =1 u=1 =1 w=0 =0 It ws notic tt no r is st to 0 no mttr t input vctor. I is 1, tn p is 0, wic orcs r to 0. Eqully, i is 0, tn r is ncssrily 0. Tus, ny nlysis o implictions t no r is irrlvnt s w now t vlu o tis no rrlss. 6. 1 2 3 5 6 4, n r consir s sprt nos in orr to b bl to istinuis btwn t intrnl nos o n, n t Primry Output PO,. 1 ND : 2 NND : 3 OR : 4 XOR : 5 ND : 6 XOR : Extrs: P 5 o 7

P 6 o 7 In orr to tst t no s--0, w n to s on Primry Output to b inlunc by tis. s t primry outputs r n, n no is isolt rom no unlss pssin trou no wic is inrntly lin to, it is only ncssry to us output s t obsrvtion point. Tus, ll o no n t circuit lin to it not pssin trou no cn b omitt. I v writtn out t ull ST cluss blow, n tn t ruc st o cluss wic r t only ons rquir or inin vctor to supply n obsrvbl inlunc t on primry output. Lrrb inicts tt rmovin cluss is not problm provi w r urnt tt rmovin t vribl will not cus stisibl ormul to ppr to b n unstisibl on. [Lrrb p 8] ST luss: Goo ircuit 60 Litrls: Fulty ircuit 34 Litrls: ctiv lus 45 Litrls: Fult sit n Gol 5 Litrls: Notic ow it is ncssry to inclu t brncs, n. I w i not, it woul not v bn s stritorwr to crctriz t ctiv lus, s t 3 litrl clus is ncssry to stblis tt is Primry Output, n tt ls to notr PO. Tus, itr cn b ctiv in orr to obsrv t prsnc o ult.

Ruc ST luss: Goo ircuit 52 Litrls: Fulty ircuit 26 Litrls: ctiv lus 30 Litrls: Fult sit n Gol 5 Litrls: Finin vctor: To stisy t ult sit cluss, w rquir: = 1, = 1, = 0, = 1. In orr to stisy t oo circuit clus, w t = 1. In orr to stisy t oo circuit clus, w t = 1. In orr to stisy t ctiv clus, w t = 0. In orr to stisy t ulty circuit clus, w t = 0. In orr to stisy t ctiv clus, w t = 1. In orr to stisy t ulty circuit clus, w t = 0. In orr to stisy t oo circuit clus, w n itr =0, =0, or =0 n =0. In orr to stisy t oo circuit clus, w n itr =0, =0, or =0 n =0. Tror, w cn v t ollowin vctors to tst or t s--0 ult: : 000, 001, 010, 100, 101. ll obsrvbility is t t output, n. Rrncs Lrrb, Trcy. Tst Pttrn Gnrtion Usin ooln Stisibility IEEE Trnsctions on omputr-i Dsin, Jnury 1992. Sculz, M. H., Trisclr, E., n Srrt, T. M. SORTES: Hily Eicint utomtic Tst Pttrn Gnrtion Systm IEEE Trnsctions on omputr-i Dsin, Jnury 1988. P 7 o 7