Fast fault simulation in combinational circuits: an efficient data structure, dynamic dominators and refined check-up

Several methods accelerating fault simulation for combinational circuits using parallel pattern evaluation are presented. All methods make use of a very efficient data structure which allows the easy recognition of special situations that can be used to avoid a lot of gate evaluations during explicit fault simulation. An implementation of the concepts shows that the resulting fault simulation algorithm is very fast. The proposals and the improved data structure considerably enhance the performance of the standard algorithm.<<ETX>>

[1]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[2]  Kurt Antreich,et al.  Accelerated Fault Simulation and Fault Grading in Combinational Circuits , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Franc Brglez,et al.  A Fast Fault Grader: Analysis and Applications , 1985, International Test Conference.

[4]  Bernd Becker,et al.  Structure based methods for parallel pattern fault simulation in combinational circuits , 1991, Proceedings of the European Conference on Design Automation..

[5]  John A. Waicukauski,et al.  What is the path to fast fault simulation? , 1988, International Test Conference 1988 Proceeding@m_New Frontiers in Testing.