Fault-Tolerant Computing, International Symposium on (1997)
June 25, 1997 to June 27, 1997
Gurjeet S. Saund , Center for Reliable and High-Performance Computing
Michael S. Hsiao , Center for Reliable and High-Performance Computing
Janak H. Patel , Center for Reliable and High-Performance Computing
This paper addresses the problem of flip flop selection for partial scan in sequential circuits. In particular it addresses some of the shortcomings of the popular flip flop selection methods, based on cutting cycles present in the graph of the circuit structure. Previous approaches assume that cutting all cycles makes the circuit totally testable, which is not always true. In the proposed approach, first subsets of flip flops are formed based on cycles in the S-graph and flip flops with self-loops. Flip flops are selected from these subsets based on a testability measure which uses an approximate valid state analysis. Once a flip flop is selected from a subset, testability measures may indicate the need for more flip flops, thus possibly selecting more flip flops than required for minimum cycle cutting. The goal is to select the fewest number of flip flops required to obtain high fault coverage for all partial scan circuits. Experimental results on the benchmark circuits show that a test generation efficiency near 100 is achieved for most circuits.
Gurjeet S. Saund, Michael S. Hsiao, Janak H. Patel, "Partial Scan beyond Cycle Cutting", Fault-Tolerant Computing, International Symposium on, vol. 00, no. , pp. 320, 1997, doi:10.1109/FTCS.1997.614106