Dominance Fault Collapsing

1. Dominance Fault Collapsing Lu Yuanlin ECE Dept. Auburn University

2. Equivalence Fault Collapsing Dominance Fault Collapsing Basic of Fault Collapsing

3. Fanout Branch Selection in Dominance Fault Collapsing • Delete the faults on input fanout branch with priority! M N_b1 N N_b2

4. Algorithm ---Extract Gate & Node Info. struct node { char name[20]; int node_type; int fanout; char sa1_del; char sa0_del; int br_node; int gate_no; char gate_type; int gate_con_no; }; struct node nodes[500] ; • One Node Array Each Fault Line is a Node • Two Gate Arrays • One-Port Gate (NOT, BUF) • Multi-port Gate (AND, OR, XOR …) 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];

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

6. Fanout of PO

7. RESULT