Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design
Reexamination Certificate
2001-03-30
2003-07-22
Lam, Tuan T. (Department: 2816)
Computer-aided design and analysis of circuits and semiconductor
Nanotechnology related integrated circuit design
C716S030000
Reexamination Certificate
active
06598211
ABSTRACT:
BACKGROUND
1. Field
An embodiment of the present invention relates to the field of analysis of defects in integrated circuits and, more particularly, to extracting likely bridge sites.
2. Discussion of Related Art
A component of defect analysis is a process used to identify areas of an integrated circuit that are more likely to be adversely affected by a manufacturing defect. The output of this process is used to design manufacturing tests targeted at detecting failures that may result from such defects.
A list of bridges, for example, may be identified during defect analysis. A bridge occurs due to a point defect that extends across two or more conductive lines or nets to cause an electrical short between them.
The likelihood of occurrence of a particular bridge may be measured by its weighted critical area (WCA). The critical area for a two net bridge for a given defect size, as the term is used herein, is the area over which the center of the defect can lie and cause the two nets to bridge. The WCA of two nets is defined as the sum of the critical areas for a particular defect size weighted by the probability of occurrence of that defect size.
Carafe, developed at the University of California, Santa Cruz, is an example of such a tool that may be used to extract potential bridges. For each layer and each adjacent layer pair in a flattened layout of an integrated circuit, Carafe generates fault primitives referred to as “length-widths.” Then, for each defect size to be analyzed, Carafe calculates corresponding critical areas from each of the length-widths. These critical areas are merged or intersected for an entire layer or layer pair to produce the critical area contribution of two-net bridges for the layer or layer pair for the particular defect size. The critical areas for each layer and layer pair for that defect size are then added together to find the overall critical area for the defect size. This overall critical area is then weighted with corresponding defect data to produce the WCA for the defect size. The above-described method is repeated for each defect size.
LOBS is another example of a prior fault extraction tool. LOBS uses a sliding window algorithm to identify critical areas. LOBS places a “window” at one corner of a flattened layout in a layer or layer pair. A small set of rules is then used to calculate the critical area contributions from the region of the layout within the window. The window is then shifted to an adjacent area and the process is repeated until the entire layout has been covered.
Both Carafe and LOBS rely on a flattened version of a layout (i.e. a layout that is represented geometrically), wherein the features are annotated with the names of the nets to which they belong. This limits the size of circuits that can be handled due to memory constraints. For some of today's integrated circuits, for example, it may not be possible to produce a flattened layout representing an entire chip and/or a flattened layout may be so large that it may not be possible with current tools to calculate weighted critical areas.
CREST, developed at Carnegie Mellon University, is another example of a prior fault extraction tool. CREST calculates the WCA of bridges from a hierarchical layout description. By using a hierarchical layout description instead of a flattened layout as used by Carafe, CREST may potentially be able to handle larger layout databases. In doing so, however, CREST may sacrifice accuracy in computing WCA values and may fail to identify important bridges that could be identified using the flattened layout. CREST may also compromise accuracy of WCA calculations by assuming that the layout does not contain “over the cell” or “through the cell” routing. Further, CREST does not provide for layouts in which features are only partially labeled and/or some features may have multiple names depending on which area of the chip the feature is traversing.
Thus, the particular extraction tool used to identify likely bridges can have a significant impact on the accuracy and efficiency of the fault extraction process. Inaccurate fault extraction may compromise the quality of integrated circuit tests developed based on the output of the fault extraction. Inefficient fault extraction may take an excessive amount of time such that it is not feasible to completely analyze larger, more complex circuits.
As integrated circuits continue to increase in complexity, fault extraction using prior fault extraction tools may become increasingly difficult.
REFERENCES:
patent: 5987240 (1999-11-01), Kay
patent: 6009251 (1999-12-01), Ho et al.
patent: 6011911 (2000-01-01), Ho et al.
patent: 6230299 (2001-05-01), McSherry et al.
patent: 6289412 (2001-09-01), Yuan et al.
patent: 6223329 (2002-04-01), Ling et al.
patent: 6418551 (2002-07-01), Mckay et al.
F. M. Goncalves, I.C. Teixeira, J.P. Teixeira, “Integrated Approach for Circuit and Fault Extraction of VLSI Circuits,” IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, Nov. 6-8, 1996, Boston, Massachusetts, pp. 96-104.
F.M. Goncalves, I.C. Teixeira, J.P. Teixeira, “Realistic Fault Extraction for High-Quality Design and Test of VLSI Systems,” IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, Oct. 20-22, 1997, pp. 29-37.
F. Joel Ferguson, John P. Shen, Extraction and Simulation of Realistic CMOS Faults using Inductive Fault Analysis, IEEE International Test Conference, 1988, pp. 475-484.
Alvin Jee and F. Joel Ferguson, “Carafe: An Inductive Fault Analysis Tool for CMOS VLSI Circuits,” IEEE VLSI Test Symposuim, 1992, pp. 92-98.
Alvin Jee, David Dahle, Cyrus Baseghi and F. Joel Ferguson, “Carafe Users Manual Release Alpha.5”, http://sctest.cse.ucsc.edu/carafe/user5/user.html, Jan. 24, 1996, 18 pages.
F. Preparata, M.I. Shamos, “Computational Geometry: An Introduction,” Springer-Verlag, 1985, pp. 352-355.
S.T. Zachariah, S. Chakravarty, C.D. Roth, “A Novel Algorithm to Extract Two-Node Bridges,” Design Automation Conference, Jun. 2000, pp. 790-793.
R.E. Tarjan, “Data Structures and Network Algorithms,” Society for Industrial and Applied Mathematics, 1983.
John T. Chen, “Improved Usability of Contamination-Detect-Fault-Simulation,” Carnegie Mellon University Theisis, 1998.
J. Khare, W. Maly, “Inductive Contamination Analysis (ICA) with SRAM Application,” International Test Conference, 1995, pp. 552-560.
E.M. McCreight, “Efficient Algorithms for Enumerating Intersecting Intervals and Rectangles,” Report CSL-80-9, Xerox Palo Alto Research Center, Palo Alto, 1980.
Pranab K. Nag and Wojcieh Maly, “Hierarchical Extraction of Critical Area for Shorts in Very Large ICs, ”IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems, Nov. 13-15, 1995, pp. 19-27.
M. De Berg, M. Van Kreveld, M. Overmars, O. Schwarzkopf, “Computional Geometry,” Springer, pp. 209-217.
Chakravarty Sreejit
Zachariah Sujit T.
Faatz Cynthia T.
Intel Corporation
Lam Tuan T.
Nguyen Hai L.
LandOfFree
Scaleable approach to extracting bridges from a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Scaleable approach to extracting bridges from a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scaleable approach to extracting bridges from a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3033072