A resizing algorithm for LSI layout with diagonal edges
| Autor: | Takashi Kambe, Akira Nagao |
|---|---|
| Rok vydání: | 2001 |
| Předmět: | |
| Zdroj: | Electronics and Communications in Japan (Part III: Fundamental Electronic Science). 84:62-74 |
| ISSN: | 1520-6440 1042-0967 |
| DOI: | 10.1002/1520-6440(200105)84:5<62::aid-ecjc7>3.0.co;2-p |
| Popis: | Resizing is an operation where expansion or contraction of the pattern is performed. Large numbers of patterns that compose the mask pattern of ICs have closed regions confined by edges which are parallel to the x- or y-axis; but to increase the density of integration and improve the circuit performance, we sometimes have to use diagonal edges. For resizing of such mask patterns, we here propose a resizing algorithm in which a group of patterns containing some diagonal edges is processed in a calculation time of O(N log N ) for N vertices. In this algorithm, intermediate sequences of vertices, known as provisional figures, are generated from the input figures, and the output figures are obtained by ORing these provisional figures. This method has the merit that the algorithm can be simplified and faster processing is possible with the help of provisional figures. © 2001 Scripta Technica, Electron Comm Jpn Pt 3, 84(5): 62–74, 2001 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|