loading...
Progressive Bridge Identification
Charlotte, NC, USA September 30-October 02
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TEST.2003.1270853International Test Conference 2003 (I ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Thomas J. Vogels, Carnegie Mellon University, Pittsburgh, PA
Wojciech Maly, Carnegie Mellon University, Pittsburgh, PA
R.D. (Shawn) Blanton, Carnegie Mellon University, Pittsburgh, PA
We present an efficient algorithm for identification of two-line bridges in combinational CMOS logic that narrows down the two-line bridge candidates based on tester responses for voltage tests. Due to the implicit enumeration of bridge sites, no layout extraction or pre-computed stuck-at fault dictionaries are required. The bridge identification is easily refined using additional test pattern results when necessary. We present results for benchmark circuits and four common fault models (wired-AND, wired-OR, dominant, and composite), evaluate the diagnosis against other possible fault types, and summarize the quality of our results.
Citation:
Thomas J. Vogels, Wojciech Maly, R.D. (Shawn) Blanton, "Progressive Bridge Identification," itc, pp.309, International Test Conference 2003 (ITC'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.