ACM Home Page
Please provide us with feedback. Feedback
A novel algorithm to extract two-node bridges
Full text PdfPdf (374 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 37th Annual Design Automation Conference table of contents
Los Angeles, California, United States
Pages: 790 - 793  
Year of Publication: 2000
ISBN:1-58113-187-9
Authors
Sujit T. Zachariah  Microprocessor Products Group, Intel Corporation, Santa Clara, CA
Sreejit Chakravarty  Microprocessor Products Group, Intel Corporation, Santa Clara, CA
Carl D. Roth  Microprocessor Products Group, Intel Corporation, Santa Clara, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 13,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/337292.337780
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
J. F. Ferguson and J. P. Shen. Extraction and simulation of realistic faults using inductive fault analysis. IEEE International Test Conference, pages 475-484, 1988.
 
3
 
4
 
5
A. L. Jee and F. J. Ferguson. Carafe: An inductive fault analysis tool for cmos vlsi circuit. IEEE VLSI Test Symposium, 1992.
 
6
E. M. McCreight. Efficient algorithms for enumerating intersecting intervals and rectangles. Report CSL-80-9, Xerox Palo Alto Research Center, Palo Alto, CA, 1980.
 
7
 
8


Collaborative Colleagues:
Sujit T. Zachariah: colleagues
Sreejit Chakravarty: colleagues
Carl D. Roth: colleagues