Testing interconnects: a pin adjacency approach

This paper looks at a new fault model used for shorts between nets on a PCB, the pin-adjacency fault model, and the implementation of two algorithms. The pin-adjacency detection and diagnosis algorithms for detecting and diagnosing these bridging faults. The authors represent the nets and their likelihood to short as a graph, and in conjunction with the new algorithms are able to generate reduced test sets. This represents a huge saving over existing algorithms which assume that any two nets are likely to short, as opposed to the new more realistic pin-adjacency fault model.<<ETX>>

[1]  Robin Wilson,et al.  Graphs an Introductory Approach , 1990, The Mathematical Gazette.

[2]  William H. Kautz,et al.  Testing for Faults in Wiring Networks , 1974, IEEE Transactions on Computers.

[3]  Najmi T. Jarwala,et al.  A unified theory for designing optimal test generation and diagnosis algorithms for board interconnects , 1989, Proceedings. 'Meeting the Tests of Time'., International Test Conference.

[4]  Najmi T. Jarwala,et al.  A new framework for analyzing test generation and diagnosis algorithms for wiring interconnects , 1989, Proceedings. 'Meeting the Tests of Time'., International Test Conference.

[5]  Wu-Tung Cheng,et al.  Diagnosis for wiring interconnects , 1990, Proceedings. International Test Conference 1990.

[6]  Vinod K. Agarwal,et al.  Testing and diagnosis of interconnects using boundary scan architecture , 1988, International Test Conference 1988 Proceeding@m_New Frontiers in Testing.

[7]  Frans P. M. Beenker Systematic and Structured Methods for Digital Board Testing , 1985, ITC.