Efficient SAT-based combinational ATPG using multi-level don´t-cares

In this paper, we present two combinational ATPG algorithms for combinational designs. These algorithms utilize the multi-level don´t cares that are computed for the design during technology independent logic optimization. They are based on Boolean satisfiability (SAT), and utilize the single stuck-at fault model. Both algorithms make use of the compatible observability don´t cares (CODCs) associated with nodes of the circuit, to speed up the ATPG process. For large circuits, both algorithms make use of approximate CODCs (ACODCs), which we can compute efficiently. Our first technique speeds up fault propagation by modifying the active clauses in the transitive fanout (TFO) of the fault site. In our second technique, we define new j-active variables for specific nodes in the transitive fanin (TFI) of the fault site. Using these j-active variables we write additional clauses to speed up fault justification. Experimental results demonstrate that the combination of these techniques (when using CODCs) results in an average reduction of 45% in ATPG run-times. When ACODCs are used, a speed-up of about 30% is obtained in the ATPG run-times for large designs. We compared our method against a commercial structural ATPG tool as well. Our method was slower for small designs, but for large designs, we obtained a 31% average speedup over the commercial tool