Method and apparatus for searching for a global path
First Claim
1. A method of defining a global route connecting first and second sets of routable elements of a net in a region of an integrated circuit (IC) layout, the method comprising:
- a) partitioning the region into a plurality of rectangular sub-regions;
b) identifying a set of sub-regions that contain the two sets of routable elements;
c) performing a path search to identify a set of path expansions between a sub-region that contains a first-set routable element and a sub-region that contains a second-set routable element, wherein performing the path search comprises identifying path expansions along non-Manhattan directions between the sub-regions;
d) embedding at least a segment of the global route along the identified set of path expansions.
1 Assignment
0 Petitions
Accused Products
Abstract
Some embodiments of the invention provide a method of searching for a global path between first and second sets of routable elements in a region of a layout. The method partitions the region into several rectangular sub-regions. It then identifies a set of sub-regions that contain the two sets of elements. Next, it performs a path search to identify a set of path expansions between a sub-region that contains a first-set element and a sub-region that contains a second-set element. When the method performs the path search, it explores expansions along non-Manhattan directions between the sub-regions.
-
Citations
20 Claims
-
1. A method of defining a global route connecting first and second sets of routable elements of a net in a region of an integrated circuit (IC) layout, the method comprising:
-
a) partitioning the region into a plurality of rectangular sub-regions; b) identifying a set of sub-regions that contain the two sets of routable elements; c) performing a path search to identify a set of path expansions between a sub-region that contains a first-set routable element and a sub-region that contains a second-set routable element, wherein performing the path search comprises identifying path expansions along non-Manhattan directions between the sub-regions; d) embedding at least a segment of the global route along the identified set of path expansions. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. A computer readable medium storing a computer program for defining a global route connecting first and second sets of routable elements of a net in a region of an integrated circuit (IC) layout, the computer program comprising sets of instructions for:
-
a) partitioning the region into a plurality of rectangular sub-regions; b) identifying a set of sub-regions that contain the two sets of routable elements; c) performing a path search to identify a set of path expansions between a sub-region that contains a first-set routable element and a sub-region that contains a second-set routable element, wherein performing the path-search comprises identifying path expansions along non-Manhattan directions between the sub-regions; d) embedding at least a segment of the global route along the identified set of path expansions. - View Dependent Claims (14, 15, 16, 17, 18, 19, 20)
-
Specification