Method and system for implementing efficient trim data representation for an electronic design
US-10192018-B1 · Jan 29, 2019 · US
US2020104449A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2020104449-A1 |
| Application number | US-201816143697-A |
| Country | US |
| Kind code | A1 |
| Filing date | Sep 27, 2018 |
| Priority date | Sep 27, 2018 |
| Publication date | Apr 2, 2020 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method of generating a routing result to manufacture an integrated circuit using self-aligned double patterning includes generating an initial routing result that indicates a location and length of connections between components, and generating an initial constraint graph with trim shapes indicating gaps in the connections being represented as nodes and with arcs indicating relative position constraints between a pair of the nodes. The method also includes subdividing the initial constraint graph into two or more subgraphs, determining a final position of each of the nodes in the two or more subgraphs, and generating a routed design with the trim shapes having the final position of corresponding ones of the nodes relative to the connections and with extents filling in spaces between one or more of the trim shapes and associated connections. The routed design is provided for manufacture of the integrated circuit.
Opening claim text (preview).
What is claimed is: 1 . A computer-implemented method of generating a routing result to manufacture an integrated circuit using self-aligned double patterning, the method comprising: generating, using a processor, an initial routing result that indicates a location and length of connections between components; generating, using the processor, an initial constraint graph with trim shapes indicating gaps in the connections being represented as nodes and with arcs indicating relative position constraints between a pair of the nodes; subdividing, using the processor, the initial constraint graph into two or more subgraphs; determining, using the processor, a final position of each of the nodes in the two or more subgraphs; generating, using the processor, a routed design with the trim shapes having the final position of corresponding ones of the nodes relative to the connections and with extents filling in spaces between one or more of the trim shapes and associated connections; and providing the routed design for manufacture of the integrated circuit. 2 . The computer-implemented method according to claim 1 , wherein the subdividing the initial constraint graph is based on constraining movement of two or more of the nodes and pruning one or more arcs between the two or more of the nodes. 3 . The computer-implemented method according to claim 1 , wherein the determining the final position of each of the nodes is based on an iterative process of positioning one of the nodes per iteration. 4 . The computer-implemented method according to claim 3 , wherein the positioning one of the nodes is based on a type of the arc between the one of the nodes and a previously positioned one of the nodes. 5 . The computer-implemented method according to claim 4 , wherein the positioning the one of the nodes includes maintaining a relative lateral position of the one of the nodes with respect to the previously positioned one of the nodes, changing the relative lateral position of the one of the nodes with respect to the previously positioned one of the nodes, or merging the one of the nodes with the previously positioned one of the nodes based on the type of the arc. 6 . The computer-implemented method according to claim 1 , further comprising improving the routed design prior to providing the routed design for manufacture. 7 . The computer-implemented method according to claim 6 , wherein the improving the routed design includes removing and re-routing connections or extents. 8 . A system to generate a routing result to manufacture an integrated circuit using self-aligned double patterning, the system comprising: a memory device configured to store an integrated circuit design; and a processor configured to generate an initial routing result that indicates a location and length of connections between components of the integrated circuit design, to generate an initial constraint graph with trim shapes indicating gaps in the connections being represented as nodes and with arcs indicating relative position constraints between a pair of the nodes, to subdivide the initial constraint graph into two or more subgraphs, to determine a final position of each of the nodes in the two or more subgraphs, to generate a routed design with the trim shapes having the final position of corresponding ones of the nodes relative to the connections and with extents filling in spaces between one or more of the trim shapes and associated connections, and to provide the routed design for manufacture of the integrated circuit. 9 . The system according to claim 8 , wherein the processor is configured to subdivide the initial constraint graph based on constraining movement of two or more of the nodes and pruning one or more arcs between the two or more of the nodes. 10 . The system according to claim 8 , wherein the processor is configured to determine the final position of each of the nodes based on an iterative process of positioning one of the nodes per iteration. 11 . The system according to claim 10 , wherein the processor is configured to position one of the nodes during an iteration based on a type of the arc between the one of the nodes and a previously positioned one of the nodes. 12 . The system according to claim 11 , wherein the processor is configured to position the one of the nodes during the iteration by maintaining a relative lateral position of the one of the nodes with respect to the previously positioned one of the nodes, changing the relative lateral position of the one of the nodes with respect to the previously positioned one of the nodes, or merging the one of the nodes with the previously positioned one of the nodes based on the type of the arc. 13 . The system according to claim 8 , wherein the processor is further configured to improve the routed design prior to providing the routed design for manufacture. 14 . The system according to claim 8 , wherein the processor is configured to improve the routed design based on removing and re-routing connections or extents. 15 . A computer program product for generating a routing result to manufacture an integrated circuit using self-aligned double patterning, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to perform a method comprising: generating an initial routing result that indicates a location and length of connections between components; generating an initial constraint graph with trim shapes indicating gaps in the connections being represented as nodes and with arcs indicating relative position constraints between a pair of the nodes; subdividing the initial constraint graph into two or more subgraphs; determining a final position of each of the nodes in the two or more subgraphs; and generating a routed design with the trim shapes having the final position of corresponding ones of the nodes relative to the connections and with extents filling in spaces between one or more of the trim shapes and associated connections, wherein the routed design is provided for manufacture of the integrated circuit. 16 . The computer program product according to claim 15 , wherein the subdividing the initial constraint graph is based on constraining movement of two or more of the nodes and pruning one or more arcs between the two or more of the nodes. 17 . The computer program product according to claim 15 , wherein the determining the final position of each of the nodes is based on an iterative process of positioning one of the nodes per iteration. 18 . The computer program product according to claim 17 , wherein the positioning one of the nodes is based on a type of the arc between the one of the nodes and a previously positioned one of the nodes. 19 . The computer program product according to claim 18 , wherein the positioning the one of the nodes includes maintaining a relative lateral position of the one of the nodes with respect to the previously positioned one of the nodes, changing the relative lateral position of the one of the nodes with respect to the previously positioned one of the nodes, or merging the one of the nodes with the previously positioned one of the nodes based on the type of the arc. 20 . The computer program product according to claim 15 , further comprising improving the routed design prior to providing the routed design for manufacture, wherein the improving the routed design includes removing and re-routing connect
Manufacturability analysis or optimisation for manufacturability · CPC title
Design verification or optimisation, e.g. using design rule check [DRC], layout versus schematics [LVS] or finite element methods [FEM] (optical proximity correction [OPC] design processes G03F1/36) · CPC title
Routing (G06F30/396 takes precedence) · CPC title
Physics · mapped topic
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.