Combinational circuit ATPG using binary decision diagrams

The increasing size and complexity of current VLSI circuits has brought testing and design for testability into the mainstream of the design process. A significant amount of research has been done in the area of gate-level combinational ATPG using the stuck-at-fault model. The problem has been shown to be NP-complete and most of the current research attempts to find efficient ways to generate tests for hard faults in a reasonable amount of time on the average. Hence, there remains a lot of interest in the testing world for efficient techniques to do combinational ATPG. Use of ordered binary decision diagrams (OBDDs) for function representation has provided significant impetus to algebraic CAD techniques. This paper presents techniques for gate-level ATPG using OBDDs.<<ETX>>

[1]  CATAPULT: concurrent automatic testing allowing parallelization and using limited topology , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[2]  Randal E. Bryant,et al.  Efficient implementation of a BDD package , 1991, DAC '90.

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

[4]  M. Ray Mercer,et al.  The influences of fault type and topology on fault model performance and the implications to test and testable design , 1991, DAC '90.

[5]  Ted Stanion,et al.  TSUNAMI: a path oriented scheme for algebraic test generation , 1991, [1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium.

[6]  Michael L. Bushnell,et al.  EST: The new frontier in automatic test-pattern generation , 1990, DAC '90.

[7]  J. Paul Roth,et al.  Diagnosis of automata failures: a calculus and a method , 1966 .

[8]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[9]  Don E. Ross,et al.  Exact ordered binary decision diagram size when representing classes of symmetric functions , 1991, J. Electron. Test..

[10]  Jacob A. Abraham,et al.  Structured Functional Level Test Generation Using Binary Decision Diagrams , 1986, ITC.

[11]  Prabhakar Goel,et al.  An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits , 1981, IEEE Transactions on Computers.

[12]  Don E. Ross,et al.  Functional approaches to generating orderings for efficient symbolic representations , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.