Fault detection in VLSI circuits
Bassam Shaer · 2000
In this paper, an algorithm for fault detection in VLSI circuits is presented. This algorithm is based on partitioning combinational and sequential circuits for pseudo-exhaustive testing. The partitioning algorithm is based on an analysis of a circuit's primary input cones and fanout values. Once a circuit has been partitioned, its primary outputs and partitioned points are tested exhaustively. By exhaustively testing individual blocks, faults within these blocks are detected and located. The results show that the partitioning algorithm offers significant reductions in overhead and test time when compared to previous partitioning algorithms. In addition, the algorithm is based upon pseudo-exhaustive testing methods where fault simulation is not required for test pattern generation and grading; hence, engineering design time and cost are further reduced.