Fast analysis of combinatorial netlists correctness rate based on binomial law and partitioning

Abstract

This paper targets fault propagation evaluation in combinational circuits and focuses on netlist-based logic masking prediction. We propose an approach that combines clustering and analytical estimation methods to allow to control the trade-off between accuracy and computation time. The experimental results performed on netlists with large number of gates and complex reconvergent structures show that the proposed solution is better adapted to large combinatorial netlists than the analysis found in the literature.