Geometric Approach to Array Structure Recognition in Flatten Layout
碩士 === 元智大學 === 資訊工程學系 === 94 === This thesis proposes an algorithm to find out array structures from a layout design. The so-obtained array structures can be employed to reduce DRC processing time. Our algorithm consists of four phases. In the first phase, we build a R-B tree for all the cells with...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/98398496335597744547 |
| Summary: | 碩士 === 元智大學 === 資訊工程學系 === 94 === This thesis proposes an algorithm to find out array structures from a layout design. The so-obtained array structures can be employed to reduce DRC processing time. Our algorithm consists of four phases. In the first phase, we build a R-B tree for all the cells with the same cell template. We then employ R-B trees to find out all scratched arrays. Each of the scratched arrays is treated as a rectangle. The second phase joins the rectangular scratched arrays with the same cell template by performing a geometric union operation. An object after uniting two scratched arrays is called a scratched rabbeted array. The third phase identifies mosaic arrays by intersecting the scratched rabbeted arrays including rectangular scratched array. A mosaic array consists of many mosaic cells, each of which contains more than one cell instance. The last phase removes the noise cell from the (mosaic) arrays and decides the actual shapes of the recognized arrays by removing those cells not useful for reducing DRC processing time. The algorithm has the time complexity , where is the number of scratched rabbeted arrays and is the number of cells for . The space complexity is , where is the number of cells with template .
|
|---|