Decomposing IC regions and embedding routes
First Claim
Patent Images
1. A method of identifying routes in a region of an integrated circuit (“
- IC”
) design layout, the region containing at least one net with a plurality of routable elements, the method comprising;
a) decomposing the IC design-layout region into a tessellated graph, wherein the tessellated graph includes a plurality of edges and a plurality of nodes, each edge being between a pair of nodes; and
b) specifying a route that connects the net'"'"'s routable elements by specifying a set of edges that the route intersects, the specifying the set of edges comprising;
defining an associated set of edge intersections, each edge intersection representing the intersection of an edge and the route, wherein the tessellated graph includes a plurality of faces, wherein the method further comprises specifying via locations within the faces, wherein specifying the route further comprises specifying a via location that the route uses.
1 Assignment
0 Petitions
Accused Products
Abstract
Some embodiments of the invention provide a method of identifying routes in a region of an integrated circuit (“IC”) design layout. The region contains at least one net with several routable elements. The method decomposes the IC design-layout region into a tessellated graph. The tessellated graph includes a plurality of edges. The method then specifies a route that connects the net'"'"'s routable elements by specifying a set of edges that the route intersects.
-
Citations
16 Claims
-
1. A method of identifying routes in a region of an integrated circuit (“
- IC”
) design layout, the region containing at least one net with a plurality of routable elements, the method comprising;a) decomposing the IC design-layout region into a tessellated graph, wherein the tessellated graph includes a plurality of edges and a plurality of nodes, each edge being between a pair of nodes; and
b) specifying a route that connects the net'"'"'s routable elements by specifying a set of edges that the route intersects, the specifying the set of edges comprising;
defining an associated set of edge intersections, each edge intersection representing the intersection of an edge and the route, wherein the tessellated graph includes a plurality of faces, wherein the method further comprises specifying via locations within the faces, wherein specifying the route further comprises specifying a via location that the route uses. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 15)
- IC”
-
9. A computer readable medium comprising a computer program having executable code, the computer program for identifying routes in a region of an integrated circuit (“
- IC”
) design layout, the region containing at least one net with a plurality of routable elements, the computer program comprising sets of instructions for;a) decomposing the IC design-layout region into a tessellated graph, wherein the tessellated graph includes a plurality of edges and a plurality of nodes, each edge being between a pair of nodes;
ab) specifying a route that connects the net'"'"'s routable elements by specifying a set of edges that the route intersects, the specifying the set of edges comprising;
defining an associated set of edge intersections, each edge intersection representing the intersection of an edge and the route, wherein the tessellated graph includes a plurality of faces, wherein the computer program further comprises instructions for specifying via locations within the faces, wherein the instructions for specifying the route further comprises instructions for specifying a via location that the route uses. - View Dependent Claims (10, 11, 12, 13, 14, 16)
- IC”
Specification