Method and apparatus for identifying optimized via locations

• US 7,080,329 B1
• Filed: 11/06/2002
• Issued: 07/18/2006
• Est. Priority Date: 01/22/2002
• Status: Expired due to Fees

• Current Assignee: Cadence Design Systems Incorporated (Cadence Group)
• Original Assignee: Cadence Design Systems Incorporated (Cadence Group)
• Inventors: Teig, Steven, Caldwell, Andrew
• Primary Examiner(s): Dinh, Paul
• Application Number:
  US10/288,870
• Time in Patent Office: 1,350 Days
• Field of Search: 716/2, 716 10- 15
• US Class Current: 716/122
• CPC Class Codes: G06F 30/39 Circuit design at the physical level physical level design for reconfigurable circuits G06F30/347

Abstract

Some embodiments of the invention provide a method of identifying a via between at least two layers of a multi-layer design layout. The method identifies a region within which the via should be located. It then formulates an optimization problem for identifying a location of the via in the region. It then solves the optimization problem to find an optimized location for the via.

Claims

1. For a design layout that has multiple layers, a method of identifying a via between at least two layers, the method comprising:

a) identifying a region within which the via is to be located;

b) formulating an optimization problem for identifying a location of the via in the region;

c) solving the optimization problem to find an optimized location for the via;

wherein solving said optimization problem comprises searching through said region in order to identify said optimized location for said via in said region.

2. The method of claim 1, wherein formulating the optimization problem comprises identifying a plurality of constraints.

3. The method of claim 2, wherein the constraints include a set of point constraints, wherein each particular point constraint specifies that the via has to be a particular distance from a particular point.

4. The method of claim 3, wherein the constraints include a set of line constraints, wherein each particular line constraint in said set of line constraints specifies that the via has to be a particular distance from a particular line segment.

5. The method of claim 4 further comprising:

using the set of line constraints to identify the region.

6. The method of claim 5, wherein the region is a subset of an overlapping intersection of two regions within first and second faces on the two layers, wherein each line segment is an edge of one of said faces.

7. The method of claim 6, wherein the region is a first region, wherein using the set of line constraints to identify the first region comprises:

for each particular edge of the first face, defining an edge that is parallel to the particular edge and is offset, towards the center of the first face, from the particular edge by the line constraint specified for the particular edge;

for each particular edge of each second face, defining an edge that is parallel to the particular edge and is offset, towards the center of the second face, from the particular edge by the line constraint specified for the particular edge;

specifying a second region as the region that the defined edges for the first face encompass;

specifying a third region as the region that the defined edges for the second face encompass;

identifying the first region as the overlapping intersection of the second and third regions.

8. The method of claim 6, wherein the faces have vertices, and the points for which the first set of distance constraints are identified are the vertices of the faces.

9. The method of claim 8, wherein the via is a first via, wherein the constraints further include a repulsion constraint between the first via and a second via, wherein the repulsion constraint specifies a minimum required distance between the two vias.

10. The method of claim 9, wherein formulating the optimization problem further comprises specifying a formula that includes at least one component for each identified point and repulsion constraint.

11. The method of claim 10, wherein solving the optimization problem comprises specifying the via location as a location, within the region, that results in an optimal value for the formula.

12. The method of claim 11, wherein specifying said via location comprises:

computing values for the formula at a plurality of locations within the region;

specifying the via location as the location that resulted in the best formula value.

13. The method of claim 11 further comprising:

ensuring that the specified via location satisfies each of the point constraints.

14. A computer readable medium that stores a computer program having executable code, the computer program for identifying a via between at least two layers of a multi-layer design layout, the computer program comprising sets of instructions for

a) formulating an optimization problem for identifying a location of the via in a region;

b) solving the optimization problem to find an optimized location for the vial wherein solving said optimization problem comprises searching through said region in order to identify said optimized location for said via in said region.

15. The computer readable medium of claim 14, wherein the set of instructions for formulating the optimization problem comprises a set of instructions for identifying a plurality of constraints.

16. The computer readable medium of claim 15, wherein the constraints include a set of point constraints, wherein each particular point constraint specifies that the via has to be a particular distance from a particular point.

17. The computer readable medium of claim 16, wherein the constraints include a set of line constraints, wherein each particular line constraint in the said set of line constraints specifies that the via has to be a particular distance from a particular line segment.

18. The computer readable medium of claim 17, wherein the computer program further comprises a set of instructions for using the set of line constraints to identify the region.

19. The computer readable medium of claim 18, wherein the region is a subset of an overlapping intersection of two regions within first and second faces on the two layers, wherein each line segment is an edge of one of said faces.

20. The computer readable medium of claim 19, wherein the region is a first region, wherein the set of instructions for using the set of line constraints to identify the first region comprises sets of instructions for:

defining, for each particular edge of the first face, an edge that is parallel to the particular edge and is offset, towards the center of the first face, from the particular edge by the line constraint specified for the particular edge;

defining, for each particular edge of each second face, an edge that is parallel to the particular edge and is offset, towards the center of the second face, from the particular edge by the line constraint specified for the particular edge;

specifying a second region as the region that the defined edges for the first face encompass;

specifying a third region as the region that the defined edges for the second face encompass;

identifying the first region as the overlapping intersection of the second and third regions.