Design of scan-based path delay testable sequential circuits

Several techniques that produce robust path delay testable designs for arbitrary combinational logic functions have been recently proposed. Unfortunately, these often results in circuits with longer delays. Moreover, such designs also assume extra hardware in the form of "holding" latches in the scan-chain in order to apply arbitrary vector-pairs, as required for high coverage delay testing. This results in high area overheads. In this paper, we present a scan-based design for testability technique for arbitrary sequential circuits. This new scheme allows a delay vs. area tradeoff while enforcing delay fault testability. At one end of the spectrum, a fully robust path delay testable circuit is guaranteed with very low additional hardware overheads in the form of extra latches. At the other end, full robust path delay testability is ensured without compromising the overall circuit delay, and with hardware overheads.<<ETX>>

[1]  Janusz Rajski,et al.  Testability preserving transformations in multi-level logic synthesis , 1990, Proceedings. International Test Conference 1990.

[2]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[3]  Edward McCluskey,et al.  Designing CMOS Circuits for Switch-Level Testability , 1987, IEEE Design & Test of Computers.

[4]  David Hung-Chang Du,et al.  Circuit enhancement by eliminating long false paths , 1992, [1992] Proceedings 29th 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]  Sudhakar M. Reddy,et al.  Complete Test Sets for Logic Functions , 1973, IEEE Transactions on Computers.

[7]  S. M. Reddy,et al.  On the design of path delay fault testable combinational circuits , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.

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

[9]  Premachandran R. Menon,et al.  ROBUSTLY SCAN-TESTABLE CMOS SEQUENTIAL CIRCUITS , 1991, 1991, Proceedings. International Test Conference.

[10]  Sudhakar M. Reddy,et al.  On Multiple Path Propagating Tests for Path Delay Faults , 1991, 1991, Proceedings. International Test Conference.

[11]  James Edward Smith The design of totally self-checking combinational circuits. , 1976 .

[12]  Sudhakar M. Reddy,et al.  On the computation of the ranges of detected delay fault sizes , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[13]  T.W. Williams,et al.  AN ENHANCEMENT TO LSSD AND SOME APPLICATIONS OF LSSD IN RELIABILITY, AVAILABILITY, AND SERVICEABILIT , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'..

[14]  Sudhakar M. Reddy,et al.  Design of robustly testable combinational logic circuits , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Sreejit Chakravarty A testable realization of CMOS combinational circuits , 1989, Proceedings. 'Meeting the Tests of Time'., International Test Conference.

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

[17]  Thomas W. Williams,et al.  A logic design structure for LSI testability , 1977, DAC '77.

[18]  Bertrand Serlet,et al.  ALPS: a generator of static CMOS layout from Boolean expressions , 1986 .

[19]  S. Kundu,et al.  Synthesis of fully testable sequential machines , 1991, Proceedings of the European Conference on Design Automation..