Method and apparatus for routing
First Claim
Patent Images
1. A method of routing nets in a region of a layout with multiple layers, the method comprising:
- a) defining a routing graph that has a plurality of nodes on plurality of layers, wherein each node represents a sub-region on a layer, wherein a set of edges exist between the nodes on each layer, wherein a set of edges on one layer are neither orthogonal nor parallel to a set of edges on another layer;
b) using the routing graph to identify routes.
1 Assignment
0 Petitions
Accused Products
Abstract
Some embodiments of the invention provide a method of routing nets in a region of a layout with multiple layers. The method defines a routing graph that has several of nodes on plurality of layers, where each node represents a sub-region on a layer. In the graph, there is a set of edges between the nodes on each layer. On one layer, there is at least one set of edges that are neither orthogonal nor parallel to a set of edges on another layer. The method uses this routing graph to identify routes.
-
Citations
33 Claims
-
1. A method of routing nets in a region of a layout with multiple layers, the method comprising:
-
a) defining a routing graph that has a plurality of nodes on plurality of layers, wherein each node represents a sub-region on a layer, wherein a set of edges exist between the nodes on each layer, wherein a set of edges on one layer are neither orthogonal nor parallel to a set of edges on another layer;
b) using the routing graph to identify routes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 30, 31, 32, 33)
-
-
15. A multi-layer routing graph that represents a region of a multi-layer layout, the routing graph comprising:
-
a) a plurality of nodes on plurality of layers, wherein each node represents a sub-region on a layer, b) a set of edges exist between the nodes on each layer, wherein a set of edges on one layer are neither orthogonal nor parallel to a set of edges on another layer. - View Dependent Claims (16, 17, 18, 19, 20, 21)
-
-
22. A computer readable medium that stores a computer program for routing nets in a region of a layout with multiple layers, the computer program comprising sets of instructions for:
-
a) defining a routing graph that has a plurality of nodes on plurality of layers, wherein each node represents a sub-region on a layer, wherein a set of edges exist between the nodes on each layer, wherein a set of edges on one layer are neither orthogonal nor parallel to a set of edges on another layer;
b) using the routing graph to identify routes. - View Dependent Claims (24, 25, 26, 27, 28, 29)
-
Specification