Routing method and apparatus that use diagonal routes
First Claim
Patent Images
1. A method of routing a net within a particular region of an integrated circuit (“
- IC”
) layout, the net having a set of pins, the method comprising;
a) partitioning the particular IC region into a plurality of sub-regions, wherein the sub-regions have the same shape; and
b) identifying a route that connects a set of sub-regions containing the pins of the net, wherein the route has a route edge that is at least partially diagonal.
2 Assignments
0 Petitions
Accused Products
Abstract
The invention is directed towards routing method and apparatus. Some embodiments provide a routing method that uses diagonal routes. This method routes several nets within a region of a circuit layout. Each net includes a set of pins in the region. The method initially partitions the region into several sub-regions. For each particular net in the region, the method then identifies a route that connects the sub-regions that contains a pin from the set of pins of the particular net. Some of the identified routes have edges that are at least partially diagonal.
-
Citations
26 Claims
-
1. A method of routing a net within a particular region of an integrated circuit (“
- IC”
) layout, the net having a set of pins, the method comprising;
a) partitioning the particular IC region into a plurality of sub-regions, wherein the sub-regions have the same shape; and
b) identifying a route that connects a set of sub-regions containing the pins of the net, wherein the route has a route edge that is at least partially diagonal. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
- IC”
-
15. A method of routing a set of nets within a region of an integrated circuit (“
- IC”
) layout, wherein each net includes a set of pins in the region, the method comprising;
partitioning the IC region into several sub-regions;
for each particular net in the region, identifying each sub-region that contains a pin from the set of pins of the particular net, and identifying a route that connects the identified sub-regions for the particular net;
wherein some of the identified routes have route edges that are at least partially diagonal. - View Dependent Claims (16, 17, 18, 19, 20, 21, 22)
- IC”
-
23. A computer readable medium comprising a computer program having executable code, the computer program for routing a net within a particular region of an integrated circuit (“
- IC”
) layout, the net having a plurality of pins, the computer program comprising;
a) a first set of instructions for partitioning the particular IC region into several sub-regions;
b) a second set of instructions for identifying a route that connects a set of sub-regions containing the pins of the net, wherein the route has a route edge that is at least partially diagonal. - View Dependent Claims (24, 25, 26)
- IC”
Specification