# US 2003/0229862 A1 · Patching technique for correction of minimum area and jog design rule violations

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2003/0229862 A1
- Document ID: US20030229862A1
- Status: Published application
- Kind: A1
- Application number: 10/374,948
- Filed: 2003-02-26
- Published: 2003-12-11
- Earliest claimed: 2002-06-10
- Assignees: Sun Microsystems, Inc.
- Inventors: Mu-Jing Li; Amy Yang
- Web page: https://patentgrep.com/patent/US20030229862A1

## CPC

- G06F 30/398: Design verification or optimisation, e.g. using design rule check [DRC], layout versus schematics [LVS] or finite element methods [FEM] (optical proximity correction [OPC] design processes G03F1/36)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Automated patching techniques to correct certain rule violations are used, simplifying and automating the design layout of an electronic circuit, whether embodied as a design encoding or as a fabricated electronic circuit. A series of patches of predefined orientations are utilized to correct design rule violations. A set of violations are identified, patches of a predefined orientation are attempted to correct one or more violations. Patches of another predefined orientation are attempted to correct remaining violations. Attempted patching is repeated until all patches in the series have been attempted or all violations have been corrected. Patches can be added to a construction layer over the set of violations, and each patch that does not cause a design rule violation can be copied to a metal layer. A series of patches of predefined orientations are used, efficiently correcting design rule violations such as minimum area and jog rule violations.

## Claims

### Claim 1

A method comprising:
identifying a plurality of violations;
attempting to correct the plurality of violations by placing a patch of a predefined orientation over at least one of the plurality of violations; and
repeating the attempting to correct the plurality of violations by placing another patch of another predefined orientation over at least one of the plurality of violations not corrected by the patch of the predefined orientation.

### Claim 2 (depends on 1)

The method, as recited in claims 1, wherein a series of predefined patch orientations are attempted until all of the plurality of violations are corrected or until all of the series of predefined patches have been attempted.

### Claim 3 (depends on 1)

The method, as recited in claim 1, wherein the attempting to correct the plurality of violations comprises:
determining if an added patch overlaps or causes a spacing violation with a previously added patch;
if so and the previously added patch has a marking indicating modified placement, removing the added patch, and
if so and the previously added patch does not have the marking, moving the added patch and the previously added patch in opposite directions and adding the marking to each of the added patch and the previously added patch.

### Claim 4 (depends on 1)

The method, as recited in claim 1, wherein the plurality of violations consists of minimum area violations.

### Claim 5 (depends on 1)

The method, as recited in claim 1, wherein the plurality of violations consists of convex jog rule violations related to lower vias.

### Claim 6 (depends on 5)

The method, as recited in claim 5, wherein a width of the patches is a width of the lower vias plus two times a metal enclosure width and a length of the patches is two times a minimum jog length plus the width of the lower vias plus two times the metal enclosure width.

### Claim 7 (depends on 1)

The method, as recited in claim 1, wherein the plurality of violations consists of convex jog rule violations related to upper vias.

### Claim 8 (depends on 1)

The method, as recited in claim 1, wherein the plurality of violations consists of convex jog rule violations related to contacts.

### Claim 9 (depends on 1)

The method, as recited in claim 1, wherein the predefined orientation is defined according to a routing direction.

### Claim 10 (depends on 1)

The method, as recited in claim 1, further comprising first attempting to correct a plurality of concave jog rule violations by placing an individual patch over each of the plurality of concave jog rule violations.

### Claim 11

A method for creation of a design layout of an electronic circuit, the method comprising:
identifying a set of violations on a layer;
adding patches of a predefined orientation on another layer over the set of violations;
copying each patch that does not cause a design rule violation to the layer;
removing all patches from the another layer; and
repeating the adding, the copying and the removing to remaining violations in the set of violations using patches of another predefined orientation.

### Claim 12 (depends on 11)

The method, as recited in claim 11, wherein the adding the patches comprises:
determining if an added patch overlaps or causes a spacing violation with a previously added patch;
if so and the previously added patch has a marking indicating modified placement, removing the added patch; and
if so and the previously added patch does not have the marking, moving the added patch and the previously added patch in opposite directions and adding the marking to each of the added patch and the previously added patch.

### Claim 13 (depends on 11)

The method, as recited in claim 11, wherein the set of violations consists of minimum area violations.

### Claim 14 (depends on 11)

The method, as recited in claim 11, wherein the set of violations consists of convex jog rule violations related to lower vias on the layer.

### Claim 15 (depends on 14)

The method, as recited in claim 14, wherein a width of the patches is a width of the lower vias plus two times a metal enclosure width and a length of the patches is two times a minimum jog length plus the width of the lower vias plus two times the metal enclosure width.

### Claim 16 (depends on 11)

The method, as recited in claim 11, wherein the set of violations consists of convex jog rule violations related to upper vias on the layer.

### Claim 17 (depends on 11)

The method, as recited in claim 11, wherein the set of violations consists of convex jog rule violations related to contacts on the layer.

### Claim 18 (depends on 11)

The method, as recited in claim 11, wherein the copying each patch corrects more than one of the violations in the set of violations.

### Claim 19 (depends on 11)

The method, as recited in claim 11, further comprising:
adding individual patches to concave jog rule violations.

### Claim 20 (depends on 11)

The method, as recited in claim 11, wherein the predefined orientation is defined according to a routing direction of the layer.

### Claim 21 (depends on 11)

The method, as recited in claim 11, wherein the layer is a metal layer and the another layer is a construction layer.

### Claim 22 (depends on 11)

The method, as recited in claim 11, further comprising first attempting to correct a plurality of concave jog rule violations by placing an individual patch over each of the plurality of concave jog rule violations.

### Claim 23

A method of processing one or more design files for an electronic circuit, the one or more design files encoding representations of a design layout of the electronic circuit, the method comprising:
identifying a set of violations on a layer;
adding patches of a predefined orientation to another layer over the set of violations;
copying each patch that does not cause a design rule violation to the layer;
removing all patches from the another layer; and
repeating the adding, the copying and the removing to remaining violations in the set of violations using patches of another predefined orientation.

### Claim 24 (depends on 23)

The method, as recited in claim 23, wherein the adding the patches comprises:
determining if an added patch overlays or causes a spacing violation with a previously added patch;
if so and the previously added patch has a marking indicating modified placement, removing the added patch; and
if so and the previously added patch does not have the marking, moving the added patch and the previously added patch in opposite directions and adding the marking to each of the added patch and the previously added patch.

### Claim 25 (depends on 23)

The method, as recited in claim 23, wherein the set of violations consists of minimum area violations.

### Claim 26 (depends on 23)

The method, as recited in claim 23, wherein the set of violations consists of convex jog rule violations related to lower vias on the layer.

### Claim 27 (depends on 23)

The method, as recited in claim 23, wherein the copying each patch corrects more than one of the violations in the set of violations.

### Claim 28 (depends on 23)

The method, as recited in claim 23, further comprising:
adding individual patches to concave jog rule violations.

### Claim 29 (depends on 23)

The method, as recited in claim 23, the predefined orientation is defined according to a routing direction of the layer.

### Claim 30 (depends on 23)

The method, as recited in claim 23, wherein the layer is a metal layer and the another layer is a construction layer.

### Claim 31

A computer readable encoding of an electronic circuit design, the computer readable encoding comprising:
one or more design file media encoding representations of one or more design geometries; and
one or more design file media encoding representations of vias;
wherein the computer readable encoding of the electronic circuit design was generated by:
identifying a plurality of violations;
attempting to correct the plurality of violations by placing a patch of a predefined orientation over at least one of the plurality of violations; and
repeating the attempting to correct the plurality of violations by placing another patch of another predefined orientation over at least one of the plurality of violations not corrected by the patch of the predefined orientation.

### Claim 32 (depends on 31)

The computer readable encoding, as recited in claim 31, wherein a series of predefined patch orientations are attempted until all of the plurality of violations are corrected or until all of the series of predefined patches have been attempted.

### Claim 33 (depends on 31)

The computer readable encoding, as recited in claim 31, wherein attempting to correct the plurality of violations comprises:
determining if an added patch overlaps or causes a spacing violation with a previously added patch;
if so and the previously added patch has a marking indicating modified placement, removing the added patch; and
if so and the previously added patch does not have the marking, moving the added patch and the previously added patch in opposite directions and adding the marking to each of the added patch and the previously added patch.

### Claim 34 (depends on 31)

The computer readable encoding, as recited in claim 31, wherein the plurality of violations consists of minimum area violations.

### Claim 35 (depends on 31)

The computer readable encoding, as recited in claim 31, wherein the plurality of violations consists of convex jog rule violations related to vias on a metal layer.

### Claim 36 (depends on 31)

The computer readable encoding, as recited in claim 31, the predefined orientation is defined according to a routing direction of a metal layer.

### Claim 37 (depends on 31)

The computer readable encoding, as recited in claim 31, wherein the computer readable encoding of the electronic circuit design was further generated by first attempting to correct a plurality of concave jog rule violations by placing an individual patch over each of the plurality of concave jog rule violations.

### Claim 38

An apparatus comprising:
means for processing one or more design files for an electronic circuit, the one or more design files encoding representations of a design layout of the electronic circuit, the means for processing comprising:
means for identifying a set of violations on a layer;
means for adding patches of a predefined orientation on another layer over the set of violations;
means for copying each patch that does not cause a design rule violation to the layer;
means for removing all patches from the another layer; and
means for repeating the means for adding, the means for copying and the means for removing to remaining violations in the set of violations using patches of another predefined orientation.

### Claim 39 (depends on 38)

The apparatus, as recited in claim 38, wherein the means for adding the patches comprises:
means for determining if an added patch overlaps or causes a spacing violation with a previously added patch;
means for removing the added patch if the added patch causes a spacing violation and the previously added patch has a marking indicating modified placement; and
means for moving the added patch and the previously added patch in opposite directions and means for adding the marking to each of the added patch and the previously added patch if the added patch causes a spacing violation and the previously added patch does not have the marking.

### Claim 40 (depends on 38)

The apparatus, as recited in claim 38, wherein the set of violations consists of minimum area violations.

### Claim 41 (depends on 38)

The apparatus, as recited in claim 38, wherein the set of violations consists of convex jog rule violations related to lower vias on the layer.

### Claim 42 (depends on 41)

The apparatus, as recited in claim 41 wherein the means for copying each patch corrects more than one of the violations in the set of violations.

### Claim 43 (depends on 41)

The apparatus, as recited in claim 41, further comprising:
means for adding individual patches to concave jog rule violations.

### Claim 44 (depends on 38)

The apparatus, as recited in claim 38, the predefined orientation is defined according to a routing direction of the layer.

### Claim 45 (depends on 38)

The apparatus, as recited in claim 38, wherein the layer is a metal layer and the another layer is a construction layer.

### Claim 46

A method of making a computer readable media product that encodes a design file representation of an electronic circuit, the method comprising:
identifying a set of violations on a layer;
adding patches of a predefined orientation to another layer over the set of violations;
copying each patch that does not cause a design rule violation to the layer;
removing all patches from the another layer; and
repeating the adding, the copying and the removing to remaining violations in the set of violations using patches of another predefined orientation.

### Claim 47 (depends on 46)

The method, as recited in claim 46, wherein the adding the patches comprises:
determining if an added patch overlaps or causes a spacing violation with a previously added patch;
if so and the previously added patch has a marking indicating modified placement, removing the added patch; and
if so and the previously added patch does not have the marking, moving the added patch and the previously added patch in opposite directions and adding the marking to each of the added patch and the previously added patch.

### Claim 48 (depends on 46)

The method, as recited in claim 46, wherein the set of violations consists of minimum area violations.

### Claim 49 (depends on 46)

The method, as recited in claim 46, wherein the set of violations consists of convex jog rule violations related to vias on the layer.

### Claim 50 (depends on 49)

The method, as recited in claim 49, wherein the copying each patch corrects more than one of the violations in the set of violations.

### Claim 51 (depends on 46)

The method, as recited in claim 46, further comprising:
adding individual patches to concave jog rule violations.

### Claim 52 (depends on 46)

The method, as recited in claim 46, the predefined orientation is defined according to a routing direction of the layer.

### Claim 53 (depends on 46)

The method, as recited in claim 46, wherein the computer readable media product is embodied as one or more media selected from the set of a disk, tape, or other magnetic, optical, semiconductor or electronic stage medium and a network, wire line, wireless or other communications medium.
