Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
275 words
A method of locating and resolving three way intersection design conflicts in computer-generated patterns formed of a collection of geometric shapes, comprising the steps of: (1) forming a first set of edge projections having projection shapes which are located outside and bordering each major border edge of geometric shapes in an original pattern, wherein each edge projection shape in said first set is longer than a length of a bordering major edge by a distance equal to a width of a widest feature in a corresponding one of said geometric shapes requiring phase shifting; (2) forming a second set of edge projections having projection shapes on said geometric shapes, wherein said second set of edge projections are formed in side and bordering each of said major border edge, wherein each edge projection shape in second set is shorter than a bordering major edge by a distance equal to a width of a widest feature in a corresponding one of said geometric shape requiring phase shifting; (3) locating all of said first set of edge projections from step (1) that intersect an edge projection from step (2); (4) locating all edge projections among those identified from step (3) that are parallel and spaced at a distance no wider than a widest feature requiring phase shifting; (5) forming a third set of edge projections from among the projections identified from step (4) that are exactly a length of a major border edge and at least as wide as half the difference between a feature width and a minimum feature size not requiring phase shifting; and (6) merging the projections identified in step (5) with the original pattern.
Claim 2
Independent Claim
275 words
A method of locating and resolving three way intersection design conflicts in computer-generated patterns formed of a collection of geometric shapes, comprising the steps of: (1) forming a first set of edge projections having projection shapes which are located outside and bordering each major border edge of geometric shapes in an original pattern, wherein each edge projection shape in said first set is longer than a length of a bordering major edge by a distance equal to a width of a widest feature in a corresponding one of said geometric shapes requiring phase shifting; (2) forming a second set of edge projections having projection shapes on said geometric shapes, wherein said second set of edge projections are formed in side and bordering each of said major border edge, wherein each edge projection shape in second set is shorter than a bordering major edge by a distance equal to a width of a widest feature in a corresponding one of said geometric shape requiring phase shifting; (3) locating all of said first set of edge projections from step (1) that intersect an edge projection from step (2); (4) locating all edge projections among those identified from step (3) that are parallel and spaced at a distance no wider than a widest feature requiring phase shifting; (5) forming a third set of edge projections from among the projections identified from step (4) that are exactly a length of a major border edge and at least as wide as half the difference between a feature width and a minimum feature size not requiring phase shifting; and (6) merging the projections identified in step (5) with the original pattern.
Claim 3
Dependent Claim
285 words
A computer implemented method of locating and resolving three way intersection design conflicts in computer-generated patterns formed of a collection of interconnected geometric shapes, said shapes defined by major border edges and ends that intersect said major border edges, comprising the steps of: forming a first set of edge projections "A" having projection shapes outside and bordering each of said major border edges of geometric shapes in an original pattern, wherein each edge projection shape in said first set is longer than a length of a bordering major edge by a distance equal to a width of a widest feature in a corresponding one of said geometirc shapes requiring phase shifting; forming a second set of edge projections "B" having projection shapes on said geometric shapes, wherein said second set of edge projections "B" are formed inside and bordering each of said major border edges, wherein each edge projection shape in said second set is shorter than a bordering major edge by a distance equal to a width of a widest feature in a corresponding one of said geometric shapes requiring phase shifting; locating all of said first set of edge projections "A" that intersect an edge projection "B" resulting in projections "C"; locating all edge projections "C" that are parallel and spaced at a distance no wider than a widest feature requiring phase shifting resulting in projections "D"; forming a third set of set of edge projections fro projections "D" that are exactly a length of a major border edge and at least as wide as half the difference between a feature width and a minimum feature size not requiring phase shifting resulting in projections "E"; and merging projections "E" with the original pattern.
Claim 4
Dependent Claim
285 words
A computer implemented method of locating and resolving three way intersection design conflicts in computer-generated patterns formed of a collection of interconnected geometric shapes, said shapes defined by major border edges and ends that intersect said major border edges, comprising the steps of: forming a first set of edge projections "A" having projection shapes outside and bordering each of said major border edges of geometric shapes in an original pattern, wherein each edge projection shape in said first set is longer than a length of a bordering major edge by a distance equal to a width of a widest feature in a corresponding one of said geometirc shapes requiring phase shifting; forming a second set of edge projections "B" having projection shapes on said geometric shapes, wherein said second set of edge projections "B" are formed inside and bordering each of said major border edges, wherein each edge projection shape in said second set is shorter than a bordering major edge by a distance equal to a width of a widest feature in a corresponding one of said geometric shapes requiring phase shifting; locating all of said first set of edge projections "A" that intersect an edge projection "B" resulting in projections "C"; locating all edge projections "C" that are parallel and spaced at a distance no wider than a widest feature requiring phase shifting resulting in projections "D"; forming a third set of set of edge projections fro projections "D" that are exactly a length of a major border edge and at least as wide as half the difference between a feature width and a minimum feature size not requiring phase shifting resulting in projections "E"; and merging projections "E" with the original pattern.
Claim 5
Independent Claim
291 words
A method of locating and resolving three way intersection design conflicts in phase edge phase shifted mask designs used in the manufacture of VLSI circuits, comprising the steps of: decomposing an original circuit design into a collection of geometric shapes at an arbitrary critical dimension, said geometric shapes being defined by major edges and ends that intersect said major border edges; forming a first set of edge projections "A" having projection shapes outside and bordering each of said major edges of said geometric shapes, wherein each edge projection shape of said first set of projections "A" is longer than the length of the bordering major edge by a distance equal to width of a widest feature in said geometric shape requiring phase shifting; forming a second set of edge projections "B" having projection shapes on said geometric shapes, where said second set of edge projections "B" are formed inside and bordering each of said major edges and wherein said edge projection shapes of said edge projections "B" are shorter than the bordering major edge by a distance equal to the width of the widest feature in said geometric shape requiring phase shifting; locating all of said first set of edge projections "A" that intersect an edge projection "B" resulting in "C"; locating all edge projections "C" that are parallel and spaced at a distance no wider than a widest feature requiring phase shifting resulting in projections "D"; forming a third set of edge projections from projections "D" that are exactly the length of a major edge and at least as wide as half the difference between a feature width and a minimum feature size not requiring phase shifting resulting in projections "E"; and merging projections "E" with the original circuit design.
Claim 6
Independent Claim
291 words
A method of locating and resolving three way intersection design conflicts in phase edge phase shifted mask designs used in the manufacture of VLSI circuits, comprising the steps of: decomposing an original circuit design into a collection of geometric shapes at an arbitrary critical dimension, said geometric shapes being defined by major edges and ends that intersect said major border edges; forming a first set of edge projections "A" having projection shapes outside and bordering each of said major edges of said geometric shapes, wherein each edge projection shape of said first set of projections "A" is longer than the length of the bordering major edge by a distance equal to width of a widest feature in said geometric shape requiring phase shifting; forming a second set of edge projections "B" having projection shapes on said geometric shapes, where said second set of edge projections "B" are formed inside and bordering each of said major edges and wherein said edge projection shapes of said edge projections "B" are shorter than the bordering major edge by a distance equal to the width of the widest feature in said geometric shape requiring phase shifting; locating all of said first set of edge projections "A" that intersect an edge projection "B" resulting in "C"; locating all edge projections "C" that are parallel and spaced at a distance no wider than a widest feature requiring phase shifting resulting in projections "D"; forming a third set of edge projections from projections "D" that are exactly the length of a major edge and at least as wide as half the difference between a feature width and a minimum feature size not requiring phase shifting resulting in projections "E"; and merging projections "E" with the original circuit design.
Claim 7
Dependent Claim
19 words
The method of claim 3, wherein said ends of said geometric shapes intersect said major edges at right angles.
Claim 8
Dependent Claim
13 words
The method of claim 3, wherein said geometric shapes include a T shape.
Claim 9
Dependent Claim
14 words
The method of claim 3, wherein said long edge projections "A" comprise rectangular shapes.
Claim 10
Dependent Claim
14 words
The method of claim 3, wherein said short edge projections "B" comprise rectangular shapes.
Claim 11
Dependent Claim
17 words
The method of claim 3, wherein said three way intersections are located using CAD and DRC techniques.
Claim 12
Dependent Claim
19 words
The method of claim 3, further comprising using an advanced DRC deck to verify correctness of a given design.
Claim 13
Dependent Claim
30 words
The method of claim 3, wherein said shapes are generated as part of a routine further including display means to visually display errors and assist in locating three way intersections.
Claim 14
Dependent Claim
16 words
The method of claim 3, wherein said pattern is used in a light field mask design.