SymFony: a Hybrid Topological-Symbolic ATPG exploiting RT-level Information
IEEE Transactions on Computer-Aided Design, February 1999, Vol. 18, No. 2, pp. 191-202
KEYWORDS: ATPG,
Approximate Methods,
BDD,
Evolutionary Algorithms,
Exact Methods,
Genetic Algorithms
ABSTRACT
Combining different techniques for sequential ATPG can help overcoming their respective limits and exploiting their advantages. In this paper, a hybrid technique resulting from mixing topologic and symbolic approaches to the sequential ATPG problem is presented. Macros are first identified within the circuit (possibly resorting to RT-level knowledge of circuit architecture). Information about macro behavior is then computed and efficiently stored resorting to symbolic techniques. A topological tool exploits this information during the ATPG process to speed-up the propagation task and to early identify unsuccessful choices. Experimental results are reported, demonstrating that the method is able to improve the efficiency of a topological ATPG in terms of required CPU time and attained Fault Coverage, especially on medium-sized control-dominated circuits.
| Related files: | |
|---|---|
| tcad99.pdf | Adobe Acrobat portable document |
| tcad99.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.
[CPSV99] F. Corno, P. Prinetto, M. Sonza Reorda, M. Violante, U. Glaeser, H. T. Vierhaus, "SymFony: a Hybrid Topological-Symbolic ATPG exploiting RT-level Information," IEEE Transactions on Computer-Aided Design, February 1999, Vol. 18, No. 2, pp. 191-202