Issue No. 01 - January (1996 vol. 45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.481486
<p><b>Abstract</b>—The problems involved in handling large numbers of path delay faults were alleviated in previous works, by developing fault simulation and test generation procedures that do not require paths to be explicitly considered. Thus, the methods developed allow the set of all path delay faults to be targeted during test generation and fault simulation. With the problems related to the number of paths removed, a new limiting factor in test generation for path delay faults is revealed, namely, the number of tests required to detect all path delay faults. In this work, the problems related to the number of tests are investigated. A procedure for computing a lower bound on the number of tests is described, and methods for synthesizing circuits with reduced lower bounds on the numbers of tests are developed. Experimental results are presented to demonstrate various aspects of the problem.</p>
Lower bound on test set size, multipliers, path delay faults;, pipelining, resynthesis.
Sudhakar M. Reddy, Irith Pomeranz, "On the Number of Tests to Detect All Path Delay Faults in Combinational Logic Circuits", IEEE Transactions on Computers, vol. 45, no. , pp. 50-62, January 1996, doi:10.1109/12.481486