Yield prediction using critical area analysis with inline defect data

Author(s):  
C. Zhou ◽  
R. Ross ◽  
C. Vickery ◽  
B. Metteer ◽  
S. Gross ◽  
...  
2008 ◽  
Vol 21 (3) ◽  
pp. 337-341 ◽  
Author(s):  
T.S. Barnett ◽  
J.P. Bickford ◽  
A.J. Weger

2001 ◽  
Vol 11 (05) ◽  
pp. 503-528 ◽  
Author(s):  
EVANTHA PAPADOPOULOU ◽  
D. T. LEE

In this paper we address the L∞ Voronoi diagram of polygonal objects and present application in VLSI layout and manufacturing. We show that L∞ Voronoi diagram of polygonal objects consists of straight line segments and thus it is much simpler to compute than its Euclidean counterpart; the degree of the computation is significantly lower. Moreover, it has a natural interpretation. In applications where Euclidean precision is not essential the L∞ Voronoi diagram can provide a better alternative. Using the L∞ Voronoi diagram of polygons we address the problem of calculating the critical area for shorts in a VLSI layout. The critical area computation is the main computational bottleneck in VLSI yield prediction.


2015 ◽  
Vol 25 (02) ◽  
pp. 123-141 ◽  
Author(s):  
Evanthia Papadopoulou ◽  
Jinhui Xu

We revisit the [Formula: see text] Hausdorff Voronoi diagram of clusters of points in the plane and present a simple two-pass plane sweep algorithm to construct it. This problem is motivated by applications in the semiconductor industry, in particular, critical area analysis and yield prediction in VLSI design. We show that the structural complexity of this diagram is [Formula: see text], where [Formula: see text] is the number of given clusters and [Formula: see text] is a number of specially crossing clusters, called essential. Our algorithm runs in [Formula: see text] time and [Formula: see text] space, where [Formula: see text] reflects a slight superset of essential crossings, [Formula: see text], and [Formula: see text] is the total number of crossing clusters. For non-crossing clusters ([Formula: see text]) or clusters with only a small number of crossings ([Formula: see text]) the algorithm is optimal. The latter is the case of interest in the motivating application, where [Formula: see text]. This is achieved by augmenting the wavefront data structure of the plane sweep, and a preprocessing step, based on point dominance, which is interesting in its own right.


Author(s):  
Sujata Mulik

Agriculture sector in India is facing rigorous problem to maximize crop productivity. More than 60 percent of the crop still depends on climatic factors like rainfall, temperature, humidity. This paper discusses the use of various Data Mining applications in agriculture sector. Data Mining is used to solve various problems in agriculture sector. It can be used it to solve yield prediction.  The problem of yield prediction is a major problem that remains to be solved based on available data. Data mining techniques are the better choices for this purpose. Different Data Mining techniques are used and evaluated in agriculture for estimating the future year's crop production. In this paper we have focused on predicting crop yield productivity of kharif & Rabi Crops. 


Sign in / Sign up

Export Citation Format

Share Document