A small test generator for large designs
Authors:
- S. KunduSKS. Kundu
- L.M. HuismanLHL.M. Huisman
- I. NairINI. Nair
- V. IvenaarVIV. Ivenaar
- L.N. ReddyLRL.N. Reddy
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10893539,p. 30
Abstract
We report an automatic test pattern generator that can handle designs with one million gates or more on medium size workstations. Run times and success rates, i.e. the fraction of faults that are resolved, are comparable to or better than those reported previously in the literature. No preprocessing is required and the amount of memory needed is less than 100 bytes per gate. The low memory requirements and high performance have been achieved by working with a larger but simpler search space, by simplifying decision making and backtracking and by using only implication techniques that are fast and that require no preprocessing.Keywords
This publication has 9 references indexed in Scilit:
- Toward massively parallel automatic test generationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- Dynamic testability measures for ATPGIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- SOCRATES: a highly efficient automatic test pattern generation systemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- A topological search algorithm for ATPG1987
- Effectiveness of heuristics measures for automatic test pattern generation1986
- On the Acceleration of Test Generation AlgorithmsIEEE Transactions on Computers, 1983
- An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic CircuitsIEEE Transactions on Computers, 1981
- 9-V Algorithm for Test Pattern Generation of Combinational Digital CircuitsIEEE Transactions on Computers, 1978
- Diagnosis of Automata Failures: A Calculus and a MethodIBM Journal of Research and Development, 1966