Computational geometry: an introduction
Computational geometry: an introduction
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Realistic Fault Extraction for High-Quality Design and Test of VLSI Systems
DFT '97 1997 Workshop on Defect and Fault-Tolerance in VLSI Systems
Hierarchical extraction of critical area for shorts in very large ICs
DFT '95 Proceedings of the IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems
Integrated Approach for Circuit and Fault Extraction of VLSI Circuits
DFT '96 Proceedings of the 1996 Workshop on Defect and Fault-Tolerance in VLSI Systems
Test Challenges in Nanometer Technologies
Journal of Electronic Testing: Theory and Applications
Test Challenges in Nanometer Technologies
ETW '00 Proceedings of the IEEE European Test Workshop
A Scalable and Efficient Methodology to Extract Two Node Bridges from Large Industrial Circuits
ITC '00 Proceedings of the 2000 IEEE International Test Conference
Computer-Aided Fault to Defect Mapping (CAFDM) for Defect Diagnosis
ITC '00 Proceedings of the 2000 IEEE International Test Conference
FedEx - A Fast Bridging Fault Extractor
ITC '01 Proceedings of the 2001 IEEE International Test Conference
Simulating Realistic Bridging and Crosstalk Faults in an Industrial Setting
Journal of Electronic Testing: Theory and Applications
Algorithm to extract two-node bridges
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
IEEE Transactions on Computers
An Experimental Study of N-Detect Scan ATPG Patterns on a Processor
VTS '04 Proceedings of the 22nd IEEE VLSI Test Symposium
Modeling Feedback Bridging Faults with Non-Zero Resistance
Journal of Electronic Testing: Theory and Applications
Hi-index | 0.00 |
Defect based testing is based on the premise that it is possible to extract high probability defects viz. bridges and opens using layout and defect data. We present a very efficient algorithm to extract two-node bridges from layout. Comparison results with a popular tool show that our algorithm is considerably faster and that it has higher capacity.