Name
Abstract | ||
|---|---|---|
In this paper we present a new approach for computing the critical area for shorts in a circuit layout. The critical area calculation is the main computational problem in VLSI yield prediction. The method is based on the concept of Voronoi diagrams and computes the critical area for shorts (for all possible defect radii, assuming square defects) accurately in O(n log n) time, where n is the size of the input. The method is presented for rectilinear layouts but it is extendible to general layouts. As a byproduct we briefly sketch how to speed up the grid method of Wagner and Koren [16]. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1145/274535.274548 | ISPD |
Keywords | Field | DocType |
main computational problem,general layout,critical area computation,circuit layout,grid method,n log n,critical area calculation,critical area,new approach,vlsi yield prediction,voronoi diagram | Computational problem,Computer science,Grid method multiplication,Algorithm,Critical area,Voronoi diagram,Time complexity,Very-large-scale integration,Computation,Speedup | Conference |
ISBN | Citations | PageRank |
1-58113-021-X | 2 | 0.40 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Evanthia Papadopoulou | 1 | 110 | 18.37 |
| D. T. Lee | 2 | 2418 | 1083.30 |