Synthesis of delay-verifiable two-level circuits

We introduce a new type of delay test set, called a delay-verification test set, which detects the presence of any path delay fault(s) that can affect the timing of the circuit. Such test sets exist even for some circuits that are not completely delay testable. We provide necessary and sufficient conditions for delay-verifiable two-level circuits, which are less stringent than those for complete delay testability. We introduce a new type of test which is not a path delay fault test in the usual sense, but is necessary for verifying the temporal correctness of the circuit under test. A synthesis procedure for delay-verifiable two-level circuits is provided. Experimental data show that delay-verifiable implementations are generally more area-efficient than completely delay testable implementations.<<ETX>>

[1]  Kurt Keutzer,et al.  Synthesis of robust delay-fault-testable circuits: theory , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  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.

[3]  Kurt Keutzer,et al.  Validatable nonrobust delay-fault testable circuits via logic synthesis , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Robert K. Brayton,et al.  Delay Fault Coverage and Performance Tradeoffs , 1993, 30th ACM/IEEE Design Automation Conference.

[5]  Sudhakar M. Reddy,et al.  On Delay Fault Testing in Logic Circuits , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  S. Yang,et al.  Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .