Name
Abstract | ||
|---|---|---|
Double patterning lithography is the most likely solution for 32nm and below process nodes due to its cost effectiveness. To enable this technique, layout decomposition is applied to split a layout into two non-conflicting patterns. Nevertheless, this problem is NP-hard in general, especially for layouts with random logic. Thus, high quality results are hard to be achieved in reasonable time. Previously, several graph partitioning techniques have been presented in order to speed up the process, with the tradeoff of the quality of results (QoR). We propose a graph division method that does not have this deficiency. First, we start with a conflict graph derived from a layout. Based on a data structure named SPQR-tree, the graph is divided into its triconnected components in linear time. The solutions of these components are then combined in a way that no QoR is lost. Thus, we call this method a ”lossless” method. Experimental results show that the proposed method can achieve 5X speedup without sacrificing any QoR. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ICCAD.2010.5654108 | ICCAD |
Keywords | Field | DocType |
cost effectiveness,double patterning lithography,np-hard,trees (mathematics),linear time,tree searching,lossless graph division method,layout decomposition,circuit optimisation,data structure,random logic,reasonable time,nonconflicting pattern,high quality result,lithography,graph partitioning technique,graph division method,conflict graph,integrated circuit layout,spqr-tree,design automation,graph partitioning,color,layout,np hard,skeleton,spqr tree,error detection,data structures | Integrated circuit layout,Data structure,Computer science,Algorithm,Real-time computing,Theoretical computer science,SPQR tree,Graph bandwidth,Random logic,Graph partition,Time complexity,Speedup | Conference |
Volume | Issue | ISSN |
null | null | 1092-3152 |
ISBN | Citations | PageRank |
978-1-4244-8193-4 | 9 | 0.62 |
References | Authors | |
12 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wai-Shing Luk | 1 | 187 | 15.13 |
| Huiping Huang | 2 | 9 | 2.31 |