Data structures and network algorithms
Data structures and network algorithms
Computational geometry: an introduction
Computational geometry: an introduction
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
A novel algorithm to extract two-node bridges
Proceedings of the 37th Annual Design Automation Conference
FedEx - a fast bridging fault extractor
Proceedings of the IEEE International Test Conference 2001
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
A Scalable and Efficient Methodology to Extract Two Node Bridges from Large Industrial Circuits
ITC '00 Proceedings of the 2000 IEEE International Test Conference
Layout-based defect-driven diagnosis for intracell bridging defects
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Short critical area computational method using mathematical morphology
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
| Hi-index | 0.00 |
Current bridge fault extraction techniques are limited by performance and capacity constraints. In this paper, we present a fast and accurate algorithm to extract and rank two-node bridges based on the computation of their weighted critical area. Experimental results showing the algorithm's performance are presented.