This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
March 1981 (vol. 30 no. 3)
pp. 215-222
P. Goel, IBM General Technology Division
The D-algorithm (DALG) is shown to be ineffective for the class of combinational logic circuits that is used to implement error correction and translation (ECAT) functions. PODEM (path-oriented decision making) is a new test generation algorithm for combinational logic circuits. PODEM uses an implicit enumeration approach analogous to that used for solving 0-1 integer programming problems. It is shown that PODEM is very efficient for ECAT circuits and is significantly more efficient than DALG over the general spectrum of combinational logic circuits. A distinctive feature of PODEM is its simplicity when compared to the D-algorithm. PODEM is a complete algorithm in that it will generate a test if one exists. Heuristics are used to achieve an efficient implicit search of the space of all possible primary input patterns until either a test is found or the space is exhausted.
Index Terms:
untestable fault, Combinational logic, D-algorithm, decision tree, error correction, implicit enumeration, stuck faults, test generation
Citation:
P. Goel, "An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits," IEEE Transactions on Computers, vol. 30, no. 3, pp. 215-222, March 1981, doi:10.1109/TC.1981.1675757
Usage of this product signifies your acceptance of the Terms of Use.