Fault simulation of I/sub DDQ/ tests for bridging faults in sequential circuits
Paul J. Thadikaran, Sourish Chakravarty, Janak H. Patel · 2002
The notion of indistinguishable pairs is introduced. Two methods to compute such pairs-an explicit scheme and an implicit scheme-are presented. The resulting fault simulation algorithms, list-based scheme and tree-based scheme are compared using a variety of faultlists and test sets. The performance of the tree-based scheme is found to be superior to the list-based scheme. Applications where the list-based scheme perform better are discussed.>