Synthesis of delay fault testable combinational logic

The synthesis of combinational logic which is robust delay fault testable is developed. In a circuit, any reconvergent fanout may result in the presence of blocked paths and/or paths which can be sensitized only if some other path is also sensitized. Implicit don't care terms are used to detect these problems and a local transformation at the reconvergence point is used to upgrade the delay fault testability of the circuit. The sharing of terms in a multilevel circuit is preserved to the greatest extent possible. Good results have been obtained based on an implementation of the algorithm in the LISP programming language on a TI Explorer machine.<<ETX>>

[1]  Sudhakar M. Reddy,et al.  On the design of robust testable CMOS combinational logic circuits , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[2]  Kaushik Roy,et al.  A Novel Approach to Accurate Timing Verification Using RTL Descriptions , 1989, 26th ACM/IEEE Design Automation Conference.

[3]  D. Smith,et al.  A Unified Design Representation Can Work , 1989, 26th ACM/IEEE Design Automation Conference.

[4]  Gordon L. Smith,et al.  Model for Delay Faults Based upon Paths , 1985, ITC.

[5]  Robert K. Brayton,et al.  Multi-level logic minimization using implicit don't cares , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..