Method and apparatus for routing
First Claim
Patent Images
1. A method of identifying global routes for nets in a region of a layout with multiple layers, wherein each net has a set of routable elements, the method comprising:
- a) partitioning each layer of the region into a plurality of sub-regions;
b) for each net, identifying a route that connects the sub-regions that contain the net'"'"'s set of routable elements, wherein some of the routes have at least one non-Manhattan edge and traverse sub-regions on multiple layers.
1 Assignment
0 Petitions
Accused Products
Abstract
Some embodiments of the invention provide a method of identifying global routes for nets in a region of a layout with multiple layers, where each net has a set of routable elements. The method partitions each layer of the region into several sub-regions. For each net, the method then identifies a route that connects the sub-regions that contain the net'"'"'s set of routable elements. Some of the identified routes have at least one non-Manhattan edge and traverse sub-regions on multiple layers.
112 Citations
23 Claims
-
1. A method of identifying global routes for nets in a region of a layout with multiple layers, wherein each net has a set of routable elements, the method comprising:
-
a) partitioning each layer of the region into a plurality of sub-regions;
b) for each net, identifying a route that connects the sub-regions that contain the net'"'"'s set of routable elements, wherein some of the routes have at least one non-Manhattan edge and traverse sub-regions on multiple layers. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A method of defining a global route for a net in a region of a layout with multiple layers, wherein each net has a set of routable elements, the method comprising:
-
a) partitioning the region into a plurality of sub-regions on each layer;
b) identifying a set of sub-regions that contain the routable elements of the net;
c) performing at least one path search to identify a set of paths that connect the identified set of sub-region, wherein performing the path-search comprises exploring expansions in non-Manhattan directions and non-planar directions between identified subregions;
d) defining the global route based on the set of paths. - View Dependent Claims (12)
-
-
13. A method of identifying global routes for nets in a region of a layout with multiple layers, wherein each net has a set of routable elements, the method comprising:
-
a) partitioning each layer of the region into a plurality of sub-regions;
b) for each net, identifying a route that connect the sub-regions that contain the net'"'"'s set of routable elements, wherein some of the routes have at least one non-Manhattan edge between sub-regions on the same layer and one non-planar edge between sub-regions on different layers.
-
-
14. A computer readable medium storing a computer program that identifies global routes for nets in a region of a layout with multiple layers, wherein each net has a set of routable elements, the computer program comprising sets of instructions for:
-
a) partitioning each layer of the region into a plurality of sub-regions;
b) identifying, for each net, a route that connects the sub-regions that contain the net'"'"'s set of routable elements, wherein some of the routes have at least one non-Manhattan edge and traverse sub-regions on multiple layers. - View Dependent Claims (15, 16, 17, 18, 19, 20, 21, 22, 23)
-
Specification