Method and apparatus for producing multi-layer topological routes

• US 6,898,773 B1
• Filed: 08/09/2002
• Issued: 05/24/2005
• Est. Priority Date: 01/22/2002
• Status: Active Grant

• Current Assignee: Cadence Design Systems Incorporated (Cadence Group)
• Original Assignee: Cadence Design Systems Incorporated (Cadence Group)
• Inventors: Teig, Steven, Caldwell, Andrew
• Primary Examiner(s): DO, THUAN V
• Application Number:
  US10/215,896
• Time in Patent Office: 1,019 Days
• Field of Search: 716/1, 716/12, 716/13, 716/14, 716/17
• 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 for identifying topological routes in a multi-layer region of a design layout. The method selects a first net that has several routable elements. For the selected net, it then specifies a first multi-layer topological route that connects the first net'"'"'s routable elements before selecting another net for routing. The first topological route traverses a plurality of layers. In addition, a topological route is a route that represents a set of diffeomorphic geometric routes.

Claims

1. A method of identifying topological routes in a multi-layer region of a design layout, the method comprising:

a) selecting a first net having routable elements;

b) generating a tessellated graph, wherein the tessellated graph is a decomposition of the design layout into a plurality of polygons; and

c) embedding in the tessellated graph a first multi-layer topological route that connects the first net'"'"'s routable elements before selecting another net for routing, wherein the first topological route traverses a plurality of layers, wherein a topological route is a route that represents a set of geometric routes that are morphable into one another through a continuous sequence of perturbations, each geometric route being one geometric realization of the topological route.

2. The multi-layer topological routing method of claim 1 further comprising:

a) selecting a second net, and

b) embedding in the tessellated graph a second topological route that connects the Second nets routable elements before selecting another net for routing.

3. The method of claim 2, wherein the second topological route connects (the second net'"'"'s routable elements on more than one layer.

4. The method of claim 2, wherein the tessellated graph

includes a plurality of topological items for defining topological routes, said topological items including a first set of items that represent the first net'"'"'s rotatable elements;

and

wherein embedding the first topological route comprises;

specifying the first route as an associated set of items in the tessellated graph, wherein the associated set of items includes the first set of items.

5. The method of claim 4, wherein the associated set of items includes at least one item that represents a via.

6. The method of claim 5, wherein the tessellated graph includes a plurality of nodes and a plurality of edges, wherein each edge is between a pair of nodes.

7. The method of claim 6, wherein the layout has a coordinate system with at least two coordinate axes, and the tessellated graph comprises a triangulated graph that includes a plurality of edges wherein at least some of the edges are not aligned with either coordinate axis.

8. The method of claim 6, wherein the via allows the first route to traverse from one layer of the graph to another layer of the graph, the method further comprising:

identifying at least two regions within at least two polygons on two different layers of the tessellated graph;

identifying the intersection of the two regions;

determining that the intersection or the two regions is sufficiently large for containing a via; and

specifying the via in the identified intersection.

9. The method of claim 8, wherein the regions are polygonal regions.

10. The method of claim 8, wherein the regions are convex polygonal regions.

11. The method of claim 8, wherein the method identifies and intersects the two regions and specifics the via within the identified intersection before selecting the first net.

12. The method of claim 8, wherein the method identifies and intersects the two regions and specifies the via within the identified intersection while embedding the first route for the first net.

13. The method of claim 1, wherein the first topological route includes a set of topological paths, wherein embedding the first topological route comprises using a depth first, iterative deepening path search to identify each topological path.

14. The method of claim 1, wherein the first topological route includes a set of topological paths, wherein the tessellated graph

includes a plurality of topological items for defining topological routes, said topological items including a first set of items that represent the first net'"'"'s routable elements;

and

wherein embedding the first topological route comprises;

identifying each topological path 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.

15. The method of claim 1, wherein the design layout is an integrated circuit design layout.

16. A computer readable medium comprising a computer program having executable code, the computer program for identifying topological routes in a multi-layer region of a design layout, the computer program comprising sets of instructions for:

a) selecting a first net having routable elements;

b) generating a tessellated graph, wherein the tessellated graph is a decomposition of the design layout into a plurality of polygons; and

c) embedding in the tessellated graph a first multi-layer topological route that connects the first net'"'"'s routable elements before selecting another net for routing, wherein the first topological route traverses a plurality of layers, wherein a topological route is a route that represents a set of geometric routes that are morphable into one another through a continuous sequence of perturbations, each geometric route being one geometric realization the topological route.

17. The computer-readable medium of claim 16, wherein the computer program further comprises sets of instructions for:

a) selecting a second net; and

b) embedding in the tessellated graph a second topological route that connects the second net'"'"'s routable elements before selecting another net for routing.

18. The computer-readable medium of claim 17, wherein the the tessellated graph

includes a plurality of topological items for defining topological routes, said topological items including a first set of items that represent the first net'"'"'s routable elements;

and

wherein the set of instructions for embedding the first topological route comprises a set of instructions for;

specifying the first route as an associated set of items in the tessellated graph, wherein the associated set of items includes the first set of items.

19. The computer-readable medium of claim 18, wherein the associated set of items includes at least one item that represents a via.

20. The computer-readable medium of claim 19, wherein the tessellated graph includes a plurality of nodes and a plurality of edges, wherein each edge is between a pair of nodes.

21. The computer-readable medium of claim 20, wherein the layout has a coordinate system with at least two coordinate axes, the tessellated graph is a triangulated graph that includes a plurality of edges wherein at least some of the edges are not aligned with either coordinate axis.

22. The computer-readable medium of claim 20, wherein the via allows the first route to traverse from one layer of the graph to another layer of the graph, the computer program further comprising sets of instructions for:

identifying at least two regions within at least two polygons on two different layers of the tessellated graph;

identifying the intersection of the two regions;

determining that the intersection of the two regions is sufficiently large for containing a via; and

specifying the via in the identified intersection.