Filling vacant areas of an integrated circuit design

• US 8,458,636 B1
• Filed: 03/18/2010
• Issued: 06/04/2013
• Est. Priority Date: 03/18/2009
• Status: Expired due to Fees

• Current Assignee: Pulsic Limited
• Original Assignee: Pulsic Limited
• Inventors: Balsdon, Graham
• Primary Examiner(s): Chiang, Jack
• Assistant Examiner(s): Bowers, Brandon
• Application Number:
  US12/727,227
• Time in Patent Office: 1,174 Days
• Field of Search: 716118-120
• US Class Current: 716/119
• CPC Class Codes: G06F 2119/18 Manufacturability analysis or optimisation for manufacturability
• CPC Class Codes: G06F 30/39 Circuit design at the physical level physical level design for reconfigurable circuits G06F30/347
• CPC Class Codes: G06F 30/392 Floor-planning or layout, e.g. partitioning or placement
• CPC Class Codes: G06F 30/394 Routing G06F30/396 takes precedence
• CPC Class Codes: Y02P 90/02 Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]

Abstract

Vacant areas of a layer of an integrated circuit design are filled with shapes connected to the appropriate nets.

Claims

1. A method comprising:

for a first layer of an integrated circuit design, creating a first rectangle to cover a region of the integrated circuit design;

determining where the first rectangle overlaps a previously drawn second rectangle on the first layer;

using at least one computer processor, oversizing the second rectangle to obtain a third rectangle;

using at least one computer processor, subtracting the third rectangle from the first rectangle to form a fourth rectangle, fifth rectangle, and sixth rectangle, wherein the fourth, fifth, and sixth rectangles each have a smaller area than the first rectangle and the fourth, fifth, and sixth rectangles overlap;

if the sixth rectangle has a smaller width than a first minimum width, discarding the sixth rectangle while keeping the fourth and fifth rectangles;

starting with an edge of the fourth rectangle, growing an island that extends from the edge to a limit line at a second minimum width;

discarding portions of the fourth and fifth rectangles beyond the limit line to obtain a first shape comprising rectangles; and

finding a second shape on a second layer, different from the first layer, that overlaps the first shape.

2. The method of claim 1 comprising:

creating a via shape on a third layer, different from the first and second layers, that overlaps both the first and second shapes.

3. The method of claim 1 comprising:

finding a third shape on the second layer overlaps the first shape, wherein the second shape is coupled to a first power net and the third shape is coupled to a second power net, different from the first power net;

permitting specifying of a first target percentage for the first power net and a second target percentage for the second power net;

determining a third percentage of shapes added the free space of the first layer that are coupled to the first power net and a fourth percentage of shapes added the free space of the first layer that are coupled to the second power net;

when the third percentage is less than the first target percentage by more than the fourth percentage is less than the second target percentage, adding a via shape to a third layer that overlaps the first and second shapes; and

when the fourth percentage is less than the second target percentage by more than the third percentage is less than the first target percentage, adding a via shape to the third layer that overlaps the first and third shapes.

4. The method of claim 1 comprising:

discarding a rectangle of the first shape that has a width less than a third minimum width.

5. The method of claim 1 comprising:

removing a portion of a rectangle of the first shape that has a greater than a first maximum distance beyond a via shape coupling the first and second shapes.

6. The method of claim 1 wherein the second shape was automatically generated by at least one computer processor on the second layer.

7. The method of claim 1 comprising:

forming a coupling of the second shape to the first shape using a via shape;

determining whether the second shape has a further coupling to a third shape on a third layer, different from the first and second shapes; and

if the second shape does not have a further coupling to a third shape, discarding the second shape and the via shape.

8. The method of claim 1 comprising:

forming a coupling of the second shape to the first shape using a via shape;

determining whether the second shape has a further coupling to a third shape on the second third layer; and

if the second shape does not have a further coupling to a third shape, discarding the second shape and the via shape.

9. The method of claim 1 comprising:

finding a third shape on a first layer that is identified as a power net; and

adding a seventh rectangle to couple the first and third shapes directly together.

10. The method of claim 1 wherein the fourth, fifth, and sixth rectangles overlap comprises the fourth rectangle overlapping with the fifth rectangle, and the fourth rectangle overlapping with the sixth rectangle.

11. A computer program product stored using a nontransitory computer-readable medium, the computer program product comprising:

code for, for a first layer of an integrated circuit design, creating a first rectangle to cover a region of the integrated circuit design;

code for determining where the first rectangle overlaps a previously drawn second rectangle on the first layer;

code for oversizing the second rectangle to obtain a third rectangle;

code for subtracting the third rectangle from the first rectangle to form a fourth rectangle, fifth rectangle, and sixth rectangle, wherein the fourth, fifth, and sixth rectangles each have a smaller area than the first rectangle;

code for, if the sixth rectangle has a smaller width than a first minimum width, discarding the sixth rectangle while keeping the fourth and fifth rectangles;

code for, starting with an edge of the fourth rectangle, growing an island that extends from the edge to a limit line at a second minimum width;

code for discarding portions of the fourth and fifth rectangles beyond the limit line to obtain a first shape comprising rectangles; and

code for finding a second shape on a second layer, different from the first layer, that overlaps the first shape.

12. The computer program product of claim 11 comprising:

code for creating a via shape on a third layer, different from the first and second layers, that overlaps both the first and second shapes.

13. The computer program product of claim 11 comprising:

code for finding a third shape on the second layer overlaps the first shape, wherein the second shape is coupled to a first power net and the third shape is coupled to a second power net, different from the first power net;

code for permitting specifying of a first target percentage for the first power net and a second target percentage for the second power net;

code for determining a third percentage of shapes added the free space of the first layer that are coupled to the first power net and a fourth percentage of shapes added the free space of the first layer that are coupled to the second power net;

code for, when the third percentage is less than the first target percentage by more than the fourth percentage is less than the second target percentage, adding a via shape to a third layer that overlaps the first and second shapes; and

code for, when the fourth percentage is less than the second target percentage by more than the third percentage is less than the first target percentage, adding a via shape to the third layer that overlaps the first and third shapes.

14. The computer program product of claim 11 comprising:

code for discarding a rectangle of the first shape that has a width less than a third minimum width.

15. The computer program product of claim 11 comprising:

code for removing a portion of a rectangle of the first shape that has a greater than a first maximum distance beyond a via shape coupling the first and second shapes.

16. The computer program product of claim 11 wherein the second shape was automatically generated on the second layer.

17. The computer program product of claim 11 comprising:

code for forming a coupling of the second shape to the first shape using a via shape;

code for determining whether the second shape has a further coupling to a third shape on a third layer, different from the first and second shapes; and

code for, if the second shape does not have a further coupling to a third shape, discarding the second shape and the via shape.

18. The computer program product of claim 11 comprising:

code for forming a coupling of the second shape to the first shape using a via shape;

code for determining whether the second shape has a further coupling to a third shape on the second third layer; and

code for, if the second shape does not have a further coupling to a third shape, discarding the second shape and the via shape.

19. The computer program product of claim 11 comprising:

code for finding a third shape on a first layer that is identified as a power net; and

code for adding a seventh rectangle to couple the first and third shapes directly together.

20. The computer program product of claim 11 wherein the fourth and fifth rectangles overlap.