9-V Algorithm for Test Pattern Generation of Combinational Digital Circuits
Authors:
- DonathDODonath
- OzgunerOZOzguner
- 1 March 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-27 (3) , 193-200
Abstract
An algorithm for generating test patterns for combinational circuits has been developed and programmed. The algorithm is definitive and finds a test for all faults including those that require multiple paths to be sensitized, by sensitizing a single path at a time and trying at most each single path. This is achieved by using a new calculus based on nine values (0,1,D,D̄,0/D,0/D̄, 1/D,1/D̄,U). One path is deliberately sensitized while the alternative paths are assigned values which permit the option of desensitizing or sensitizing them as the sensitized path is developed. Experimental results are presented for a variety of cases.Keywords
This publication has 6 references indexed in Scilit:
- A Logic System for Fault Test GenerationIEEE Transactions on Computers, 1976
- Polynomially Complete Fault Detection ProblemsIEEE Transactions on Computers, 1975
- Analyzing Errors with the Boolean DifferenceIEEE Transactions on Computers, 1968
- Fault Testing and Diagnosis in Combinational Digital CircuitsIEEE Transactions on Computers, 1968
- Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic CircuitsIEEE Transactions on Electronic Computers, 1967
- On Finding a Nearly Minimal Set of Fault Detection Tests for Combinational Logic NetsIEEE Transactions on Electronic Computers, 1966