Improving Topological ATPG with Symbolic Techniques
IEEE VLSI Test Symposium, Princeton (USA), April 1995
ABSTRACT
This paper presents a new approach to Automatic Test Pattern Generation for sequential circuits. Traditional topological algorithms nowadays are able to deal with very large circuits, but often fail when highly sequential subnetworks are found. On the other hand, symbolic techniques based on Binary Decision Diagrams proved themselves very efficient on small or medium circuits, no matter their sequential complexity. A state-of-the-art structural ATPG is extended by identifying some critical areas in the circuit and resorting to symbolic techniques when such areas need to be considered. Experimental results prove that the combined approach considerably enhances fault coverage while reducing CPU time when compared to a purely topological approach.
| Related files: | |
|---|---|
| vts95b.pdf | Adobe Acrobat portable document |
| vts95b.ps.gz | postscript document, compressed (with gzip) |
Copyright note for papers published by the IEEE Computer Society:
Copyright IEEE. Personal use of this material is permitted. However,
permission to reprint/republish this material for advertising or
promotional purposes or for creating new collective works for resale
or redistribution to servers or lists, or to reuse any copyrighted
component of this work in other works, must be obtained from the IEEE.
[CGPR95] F. Corno, U. Glaeser, P. Prinetto, M. Rebaudengo, M. Sonza Reorda, H. T. Vierhaus, "Improving Topological ATPG with Symbolic Techniques," IEEE VLSI Test Symposium, Princeton (USA), April 1995