Dominance Fault Collapsing Lu Yuanlin ECE Dept. Auburn University.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Logic Gates.
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
Fault Equivalence Number of fault sites in a Boolean gate circuit is = #PI + #gates + # (fanout branches) Fault equivalence: Two faults f1.
9-Oct-2002Prasad et al., ITC'021 A New Algorithm for Global Fault Collapsing into Equivalence and Dominance Sets A. V. S. S. Prasad Agere Systems, Bangalore.
ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.
Copyright 2001, Agrawal & BushnellDay-1 AM-3 Lecture 31 Testing Analog & Digital Products Lecture 3: Fault Modeling n Why model faults? n Some real defects.
Universal Gates Sum of Products Products of Sum
A Programmable Logic Device Lecture 4.3. A Programmable Logic Device Multiple-input Gates A 2-Input, 1-Output PLD.
Dominance Fault Collapsing - Alok Doshi ELEC 7250 Spring 2004.
Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.
Sep. 30, 2003Agrawal: ITC'031 Fault Collapsing Via Functional Dominance Vishwani D. Agrawal Rutgers University, ECE Dept., Piscataway, NJ 08854, USA
August 29, 2003Agrawal: VDAT'031 It is Sufficient to Test 25% of Faults Vishwani D. Agrawal Rutgers University, ECE Dept., Piscataway, NJ 08854, USA
4/20/2006ELEC7250: Alexander 1 LOGIC SIMULATION AND FAULT DIAGNOSIS BY JINS DAVIS ALEXANDER ELEC 7250 PRESENTATION.
Lecture 5 Fault Modeling
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 51 Lecture 5 Fault Modeling n Why model faults? n Some real defects in VLSI and PCB n Common fault.
ELEC7250: VLSI Testing Spring 2004 Experimental Analysis of Fault Collapsing Methods Dixit, Ayoush M.
Dominance Fault Collapsing of Combinational Circuits By Kalpesh Shetye & Kapil Gore ELEC 7250, Spring 2004.
Logic simulator and fault diagnosis Fan Wang Dept. of Electrical & Computer Engineering Auburn University ELEC7250 Term Project Spring 06’
Digital Logic Systems Combinational Circuits. Basic Gates & Truth Tables.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTES Fault Modeling.
LOGIC GATES Logic generally has only 2 states, ON or OFF, represented by 1 or 0. Logic gates react to inputs in certain ways. Symbol for AND gate INPUT.
Transistors and Logic Circuits. Transistor control voltage in voltage out control high allows current to flow -- switch is closed (on) control low stops.
TODAY YOU ARE LEARNING to explain why data is represented in computer systems in binary form 2. to understand and produce simple logic diagrams.
INSTEAD OF SIMCIR USING MULTIMEDIA LOGIC. THE PALLET Row 1, 1st Selector Use to select and move objects.
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.
Chapter 33 Basic Logic Gates. 2 Objectives –After completing this chapter, the student should be able to: Identify and explain the function of the basic.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 2.
Gates and Logic Dr John Cowell phones off (please)
April 3, 2003Agrawal: Fault Collapsing1 Hierarchical Fault Collapsing; Functional Equivalences and Dominances Vishwani D. Agrawal Rutgers University, Dept.
Fault Models, Fault Simulation and Test Generation Vishwani D. Agrawal Department of ECE, Auburn University Auburn, AL 36849, USA
Dominance Fault Collapsing 1 VLSI TESTING PROJECT Dominance Fault Collapsing Anandshankar Mudlapur Arun Balaji Kannan Muthu Balaji Ramkumar Muthu Balan.
EE434 ASIC & Digital Systems Partha Pande School of EECS Washington State University
Logic Gates. AND gate Produces an output only if both inputs are on Input AInput BOutput (Q) Q=
Jan. 26, 2001VLSI Test: Bushnell-Agrawal/Lecture 51 Lecture 5 Fault Modeling n Why model faults? n Some real defects in VLSI and PCB n Common fault models.
The George Washington University School of Engineering and Applied Science Department of Electrical and Computer Engineering ECE122 – 30 Lab 2: NAND gate.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 51 Lecture 5 Fault Modeling n Why model faults? n Some real defects in VLSI and PCB n Common fault.
The George Washington University School of Engineering and Applied Science Department of Electrical and Computer Engineering ECE122 – 30 Lab 2: NAND gate.
Basic Gates and ICs 74LS00 Quad 2-Input NAND gate 74LS02 Quad 2-Input NOR gate 74LS04 Quad 2-Input NOT gate 74LS08 Quad 2-Input AND gate 74LS32 Quad 2-Input.
Eng. Mai Z. Alyazji October, 2016
Transistors and Logic Circuits
Dominance Fault Collapsing
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
EI205 Lecture 5 Dianguang Ma Fall 2008.
Exclusive OR Gate.
Traversing a Linked List
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Definitions D-Algorithm (Roth) D-cubes Bridging faults
Definitions D-Algorithm (Roth) D-cubes Bridging faults
ELEC Digital Logic Circuits Fall 2014 Logic Testing (Chapter 12)
Lecture 5 Fault Modeling
Logic Gates.
Logic Gates.
Garimella Srinivas Gottiparthy Ramraj Vippa Prakash
Fault Collapsing via Functional Dominance
KS4 Electricity – Electronic systems
13 Digital Logic Circuits.
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.
Logic Gates.
VLSI Testing Lecture 3: Fault Modeling
ELEC Digital Logic Circuits Fall 2015 Logic Testing (Chapter 12)
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Basic Logic Operations
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Dominance Fault Collapsing Lu Yuanlin ECE Dept. Auburn University

Basic of Fault Collapsing Equivalence Fault Collapsing Equivalence Fault Collapsing Dominance Fault Collapsing Dominance Fault Collapsing

Fanout Branch Selection in Dominance Fault Collapsing Delete the faults on input fanout branch with priority! Delete the faults on input fanout branch with priority!

Algorithm --- Extract Gate & Node Info. One Node Array One Node Array Each Fault Line is a Node Each Fault Line is a Node Two Gate Arrays Two Gate Arrays 1.One-Port Gate (NOT, BUF) 2.Multi-port Gate (AND, OR, XOR … ) struct node { char name[20]; { char name[20]; int node_type; int node_type; int fanout; int fanout; char sa1_del; char sa1_del; char sa0_del; char sa0_del; int br_node; int br_node; int gate_no; int gate_no; char gate_type; char gate_type; int gate_con_no; int gate_con_no; }; }; struct node nodes[500] ; struct p2_gate { char type[10]; int in_node1; int in_node2; int in_node3; int in_node4; int in_node5; int out_node; int input_no; }; struct p2_gate p2gate[255];

Algorithm --- Dominance Fault Collapsing Read each multi-port gate information from the multi-ports gate array Read each multi-port gate information from the multi-ports gate array {a. using its output node as array index to read the node array, {a. using its output node as array index to read the node array, and delete that node ’ s both “ sa0 ” and “ sa1 ” ; and delete that node ’ s both “ sa0 ” and “ sa1 ” ; b. Decide which input nodes are on fanout branches, b. Decide which input nodes are on fanout branches, if (an AND or NAND gate) if (an AND or NAND gate) delete “ sa0 ” on those nodes with priority ; delete “ sa0 ” on those nodes with priority ; else if (an OR or NOR gate) else if (an OR or NOR gate) delete “ sa1 ” on those nodes with priority ;} delete “ sa1 ” on those nodes with priority ;} Read each one-port gate information from the one port gate array Read each one-port gate information from the one port gate array { using its output node as array index to read the node array, { using its output node as array index to read the node array, and delete that node ’ s both “ sa0 ” and “ sa1 ” ;} and delete that node ’ s both “ sa0 ” and “ sa1 ” ;}

Fanout of PO

RESULT Benchmark Circuit Total Faults Equivalent Collapsed Faults Dominance Collapsed Faults MyHitecMy Tested By Hitec Redundant C XOR Five gates replacement