John Giraldi
ABSTRACT
We present a new algorithm, EST, that accelerates any combinatorial circuit Automatic Test-Pattern Generation algorithm. EST detects equivalent search states, which are saved for all faults during ATPG. The search space is reduced by using Binary Decision Diagram fragments to detect previously-encountered search states (possibly from prior faults). Search terminates earlier than before. Redundant fault analysis further accelerates ATPG. ATPG is accelerated 1347 times for hard-to-test faults in the ISCAS '85 benchmarks.
- 1.S.B. Akers. Binary Decision Diagrams. IEEE Trans. on Computers, C-27(6):509-516, June 1978.Google Scholar
Digital Library
- 2.F. Brglez and H. Fujiwara. A Neutral Netlist of 10 Combinational Benchmark Circuits. In Proc. of IS- CAS; Special Session on ATPG and Fault Simulation, pages 151-158. IEEE, June 1985.Google Scholar
- 3.K. Cho and R.E. Bryant. Test Pattern Generation for Sequential MOS Circuits by Symbolic Fault Simulation. In Proc. of the ~6th DAC., pages 418-423. ACM/IEEE, June 1989. Google ScholarDigital Library
- 4.H. Fujiwara and T. Shimono. On the Acceleration of Test Generation Algorithms. In Proc. of the i3th FTCS, pages 98-105. IEEE, June 1983.Google ScholarDigital Library
- 5.R.K. Gaede, M.R. Mercer, K.M. Butler, and D.E. Ross. CATAPULT: Concurrent Automatic Testing Allowing Parallelization and Using Limited Topology. In Proc. ol the 25~h DAC, pages 597-600. ACM/:{EEE, June 1988. Google ScholarDigital Library
- 6.T. Kirkland and M.R. Mercer. A Topological Search Algorithm for ATPG. In Proc. of the: 24th DA C, pages 502-508. ACM/IEEE, June 1987. Google ScholarDigital Library
- 7.T. Larrabee. Efficient Generation of Test Patterns Using Boolean Difference. In Proc. of the Int. Test Conf., pages 795-801. IEEE, August 1989.Google ScholarCross Ref
- 8.P.Goel. An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits. IEEE Trans. on Computers, C-30(3):215-222, March 1981.Google ScholarDigital Library
- 9.J.P. Roth, W.G. Bouricius, and P.I~L. Schneider. Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic Circuits. IEEE Trans. on Electronic Computers, t'}G-16(10):567-580, Oct. 1967.Google Scholar
- 10.M. Schulz and E. Auth. Improved :Deterministic Test Pattern Generation with Applications to Redundancy Identification. IEEE Trans. on CAD, 8(7):811-816, July 1989.Google ScholarDigital Library
- 11.R. S. Wei and A. Sangiovanni-VincenteUl. PROTEUS: A Logic Verification System for Combinational Circuits. In Proc. of the ITC, pages 350-359. IEEE, Oct. 1986.Google Scholar
Index Terms
- EST: The new frontier in automatic test-pattern generation
Recommendations
On achieving complete fault coverage for sequential machines
A method for generating tests for gate-level stuck-at faults in sequential machines is given, which is applicable when a state-table description of the machine under test is either given or extractable from the given description. A test generation ...
On clustering of undetectable single stuck-at faults and test quality in full-scan circuits
We demonstrate that undetectable single stuck-at faults in full-scan benchmark circuits tend to cluster in certain areas. This implies that certain areas may remain uncovered by a test set for single stuck-at faults. We describe an exteusion to the set ...
Comments