Synthesis and optimization procedures for robustly delay-fault testable combinational logic circuits

Authors:
Srinivas Devadas;Kurt Keutzer
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA;AT&T Bell Laboratories, Murray Hill, NJ
Venue:
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Year:
1991

Citing 2
Cited 7

DAGON: technology binding and local optimization by DAG matching

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Necessary and sufficient conditions for robust delay-fault testability of combinational logic circuits

AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI

Correlation-reduced scan-path design to improve delay fault coverage

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Robust delay-fault test generation and synthesis for testability under a standard scan design methodology

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
A synthesis-based test generation and compaction algorithm for multifaults

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Design-for-testability for path delay faults in large combinatorial circuits using test-points

DAC '94 Proceedings of the 31st annual Design Automation Conference
On the Number of Tests to Detect All Path Delay Faults in Combinational Logic Circuits

IEEE Transactions on Computers
Functional test generation for path delay faults

ATS '95 Proceedings of the 4th Asian Test Symposium
BiCMOS logic testing

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we apply recently developed necessary and sufficient conditions for robust path-delay-fault testability to develop synthesis procedures which produce two-level and multilevel circuits with high degrees of robust path delay fault testability. For circuits which can be flattened to two levels, we give a covering procedure which optimizes for robust path delay fault testability. These two-level circuits can then be algebraically factored to produce robustly path-delay-fault testable multilevel circuits. For regular structures which cannot be flattened to two levels, we give a composition procedure which allows for the construction of robustly path-delay-fault testable regular structures. Finally, we show how these two techniques can be combined to produce cascaded combinational logic blocks that are robustly path-delay-fault testable. We demonstrate these techniques on a variety of examples. It is possible to produce entire chips that are fully path delay testable using these techniques.