EE3A1 Computer Hardware and Digital Design Worked Examples 3 Test and testability (1)

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Logic Gates.
Digital Circuits.
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
n-bit comparator using 1-bit comparator
Module 8.  In Module 3, we have learned about Exclusive OR (XOR) gate.  Boolean Expression AB’ + A’B = Y also A  B = Y  Logic Gate  Truth table ABY.
Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.
DIGITAL SYSTEMS TCE OTHER COMBINATIONAL LOGIC CIRCUITS WEEK 7 AND WEEK 8 (LECTURE 1 OF 3) COMPARATORS CODE CONVERTERS.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
TOPIC : Truth tables and Primitive Cubes
ECE 301 – Digital Electronics
Boolean Algebra and Truth Table The mathematics associated with binary number system (or logic) is call Boolean: –“0” and “1”, or “False” and “True” –Calculation.
ENGIN112 L12: Circuit Analysis Procedure September 29, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 12 Circuit Analysis Procedure.
Boolean Algebra Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
1 CHAPTER 4: PART I ARITHMETIC FOR COMPUTERS. 2 The MIPS ALU We’ll be working with the MIPS instruction set architecture –similar to other architectures.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
TODAY YOU ARE LEARNING to explain why data is represented in computer systems in binary form 2. to understand and produce simple logic diagrams.
The Digital Logic Level
Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.
What is an And Gate? It is a digital circuit that produce logical operations The logical operations are call Boolean logical Boolean operation consist.
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
Digital Electronics Lecture 6 Combinational Logic Circuit Design.
DIGITAL LOGIC ELECTRICITY, GATES, COMPONENTS. DIGITAL LOGIC READING: APPENDIX C THROUGH C.3 The Student shall be able to: Define voltage, current, resistance,
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /05/2013 Lecture 4: Basics of Logic Design Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
Boolean Algebra & Logic Prepared by Dr P Marais (Modified by D Burford)
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
EE3A1 Computer Hardware and Digital Design Lecture 6 supplement Common misunderstandings about VHDL processes.
Combination of logic gates  Logic gates can be combined to produce more complex functions.  They can also be combined to substitute one type of gate.
CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.
Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
Abdullah Said Alkalbani University of Buraimi
Digital Logic Design.
Universal college of engineering & technology. .By Harsh Patel)
Multiplexers and Demultiplexers
CEC 220 Digital Circuit Design Boolean Algebra I Wed, Sept 2 CEC 220 Digital Circuit Design Slide 1 of 13.
An introduction to Fault Detection in Logic Circuits By Dr. Amin Danial Asham.
COMPUTER ARCHITECTURE TRUTH TABLES AND LOGIC GATES.
Designing Combinational Logic Circuits
THE K-MAP.
C.S.Choy39 TERMINOLOGY Minterm –product term containing all input variables of a function in either true or complementary form Maxterm – sum term containing.
Computer Organization CSC 405 Decoders and Multiplexers.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
Karnaugh Map. Simplifying Digital Circuits Reconsider the 1-bit full adder. The carry bit is But we can implement the function with a much simpler circuit:
Logic Gates and Boolean Algebra Introduction to Logic II.
Combinational Logic Design
Digital Logic Design. Truth Table  Logic Circuit 1. Start with truth table 2. When your output is a 1, figure out the combination of inputs, ANDs, and.
Mu.com.lec 9. Overview Gates, latches, memories and other logic components are used to design computer systems and their subsystems Good understanding.
EE3A1 Computer Hardware and Digital Design Lecture 13 Detecting faults in Digital Systems.
Boolean Algebra & Logic Gates
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Eng. Mai Z. Alyazji October, 2016
Logic Gates and Boolean Algebra
Logic Gates.
Boolean Algebra.
Logic Gates.
Boolean Expressions Lecture No. 10.
Circuits & Boolean Expressions
The Digital Logic Level
EEL 3705 / 3705L Digital Logic Design
Week 7: Gates and Circuits: PART II
Logic Gates.
Logic Gates.
Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.
Binary Logic.
XOR Function Logic Symbol  Description  Truth Table 
Eng. Ahmed M Bader El-Din October, 2018
Circuits & Boolean Expressions
Presentation transcript:

EE3A1 Computer Hardware and Digital Design Worked Examples 3 Test and testability (1)

Worked Examples (a) Explain testability enhancement.[5] (b) Form Boolean difference of the output with respect to each of the inputs. [8] (c) Produce a set of test vectors that can test the inputs a,b,c for single s-a-0 and s-a-1 faults.[3]

Worked Examples (d) Signature analyser initialized to the all-zero state, and fed with (MSB first ). i) What is the fault-free signature? ii) Show that if the fifth bit is in error, the final signature is different from the fault-free case. [4]

Solution: part (b)  Form Boolean difference of the output with respect to each of the inputs. (c) Circuit function is Likewise for b and c Boolean proposition: if a changes then f will also change This is true when setting a=1 and a=0 give rise to different value for f f0f1f0 XOR f

Solution: Sensitivity to a (b) Circuit function is Using identity X  Y=X.Y+X.Y

Solution: Sensitivity to b (b) Circuit function is Using identity X  Y=X.Y+X.Y

Solution: Sensitivity to c (b) Circuit function is Using identity X  Y=X.Y+X.Y

Solution: part (b) What does this mean?

Meaning of Boolean Difference Truth table for f K-Map for f

Meaning of Boolean Difference K-Map for f Where b is changing: is true if change in b causes change in f Where change in f results

Meaning of Boolean Difference Where b is changing: K-Map for f is true if a change in b causes a change in f Where change in f results

Questions  What is the value of  (i.e. under what condition will a change in A cause a change in C) (a) a+b (b) 1 (c) a (d) b (e) b

Solution: part (c) Test a, b and c for s-a-0, s-a-1

Solution: part (c) node a Test a s-a-0 Set a=1 Make f sensitive to a b=0 Test vector abc=100 or 101 Test a s-a-1 Set a=0 Make f sensitive to a b=0 Test vector abc=000 or 001

Solution: part (c) node b Test b s-a-0 Set b=1 Make f sensitive to b ac=11 or 00 Test vector abc=111 or 010 Test b s-a-1 Set b=0 Make f sensitive to b ac=11 or 00 Test vector abc=101 or 000

Solution: part (c) node c Test c s-a-0 Set c=1 Make f sensitive to c b=1 Test vector abc=011 or 111 Test c s-a-1 Set c=0 Make f sensitive to c b=1 Test vector abc=010 or 110

Solution: part (d)  Initialized to 0 and fed with (MSB first ).  What is 4-input XOR?

XOR gates abcdout a b c d a b c d Output is high when odd number of inputs is high

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Part (d): 5 th bit in error  Fed with (MSB first ). InputTest

Part (d): 5 th bit in error  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest

Solution: part (d)  Fed with (MSB first ). InputTest  Signature is different  This fault is detected