Method and apparatus for defining vias

• US 6,938,234 B1
• Filed: 08/26/2002
• Issued: 08/30/2005
• Est. Priority Date: 01/22/2002
• Status: Expired due to Fees

• Current Assignee: Cadence Design Systems Incorporated (Cadence Group)
• Original Assignee: Cadence Design Systems Incorporated (Cadence Group)
• Inventors: Teig, Steven, Caldwell, Andrew, Jacques, Etienne
• Primary Examiner(s): Siek, Vuthe
• Application Number:
  US10/229,196
• Time in Patent Office: 1,100 Days
• Field of Search: 716/2, 716 8- 15
• US Class Current: 716/129
• CPC Class Codes: G06F 30/394 Routing G06F30/396 takes precedence

Abstract

Some embodiments of the invention provide a method of routing nets in a region of a design layout. The region contains a plurality of nets and has multiple interconnect layers. The method identifies routes for a set of nets in the region, where some of the routes utilize vias to traverse multiple interconnect layers. The method then moves at least one via to improve the routing.

Claims

1. A method of routing nets in a region of a design layout, the region containing a plurality of nets and having multiple interconnect layers, the method comprising:

a) decomposing the region into a tessellated graph that includes a plurality of faces;

b) identifying topological routes for a set of nets in the region, wherein some of the topological routes utilize vias to traverse multiple interconnect layers, wherein the vias are specified within the faces, wherein each via traverses two faces on two different layers; and

c) moving at least one via to improve a metric score that quantifies the quality of the routing.

2. The method of claim 1 further comprising:

specifying an initial position for each via; and

wherein moving the via comprises redefining the position of the via.

3. The method of claim 1, wherein the metric score quantifies the congestion about the via.

4. The method of claim 1 further comprising moving a plurality of vias to improve the routing.

5. The method of claim 1 further comprising:

examining each via to determine whether moving the via would improve the routing, and

moving each via when the move would improve the routing.

6. The method of claim 1 further comprising defining a geometric embedding of each topological route after moving the via.

7. The method of claim 1, wherein the topological route for each net includes a set of topological paths, wherein identifying a topological route for a net comprises using an IDA* path search to identify each topological path of the topological route for the net.

8. The method of claim 1, wherein the topological route for each net includes a set of topological paths, wherein identifying the topological routes comprises:

defining a topological graph to represent the IC layout region topologically, wherein the topological graph includes a plurality of topological items including a first set of items for the net that represent the net'"'"'s routable elements; and

identifying each topological path of a topological route for a net by using a best first search that expresses the cost of a path that reaches a topological item in the graph in terms of a function that is defined over the topological item.

9. A method of routing nets in a region, the region having multiple interconnect layers, the method comprising:

a) decomposing the region into a tessellated graph that includes a plurality of faces;

b) identifying a topological route for each net in a set of nets, wherein at least one topological route utilizes a topological via to traverse multiple interconnect layers, wherein the topological vias are specified within the faces, wherein each topological via traverses two faces on two different layers;

c) selecting the topological via;

d) measuring the congestion of topological routes around the selected topological via; and

e) moving the topological via to reduce the congestion around the selected topological via.

10. The method of claim 9 further comprising:

measuring the congestion about a plurality of topological vias; and

moving a plurality of vias to reduce congestion about the topological vias.

11. A computer readable medium storing a computer program for routing nets in a region of a design layout, the region containing a plurality of nets and having multiple interconnect layers, the computer program comprising instructions for:

a) decomposing the region into a tessellated graph that includes a plurality of faces;

b) identifying topological routes for a set of nets in the region, wherein some of the topological routes utilize vias to traverse multiple interconnect layers, wherein the vias are specified within the faces, wherein each via traverses two faces on two different layers; and

c) moving at least one via to improve a metric score that quantifies the quality of the routing.

12. The computer readable medium of claim 11, wherein the computer program further comprises instructions for:

specifying an initial position for each via; and

wherein moving the via comprising redefining the position of the via.

13. The computer readable medium of claim 11, wherein the metric score quantifies the congestion about the via.

14. The computer readable medium of claim 11 further comprising instructions for moving a plurality of vias to improve the routing.

15. The computer readable medium of claim 11 further comprising instructions for:

examining each via to determine whether moving the via would improve the routing, and

moving each via when the move would improve the routing.

16. The computer readable medium of claim 11, the program further comprising instructions for defining a geometric embedding of each topological route after moving the via.

17. A method of routing nets in a region of a design layout, the region containing a plurality of nets and having multiple interconnect layers, the method comprising:

a) decomposing the region into a tessellated graph that includes a plurality of faces;

b) defining topological routes for nets in the layout, wherein a set of topological routes contain a set of vias, wherein the vias are identified within the faces, wherein each via traverses two faces on two different layers;

c) determining whether moving at least one via would improve the congestion of the topological routes in the layout; and

d) moving at least one via when said determining will improve the congestion of the topological routes in the layout.

18. The method of claim 17 further comprising specifying a geometric embedding of each topological route after moving the via.

19. A computer readable medium storing a computer program for routing nets in a region of a design layout, the region containing a plurality of nets and having multiple interconnect layers, the computer program comprising instructions for:

a) decomposing the region into a tessellated graph that includes a plurality of faces;

b) defining topological routes for nets in the layout, wherein a set of topological routes contain a set of vias, wherein the vias are identified within the faces, wherein each via traverses two faces on two different layers;

c) determining whether moving at least one via would improve the congestion of the topological routes in the layout; and

d) moving at least one via when said determining will improve the congestion of the topological routes in the layout.