Automatic generation of phase shift masks using net coloring

Claim 2

A program product comprising: (A) a binary coloring mechanism for assigning a binary property to circuit elements, the binary coloring mechanism including mechanisms for: a) providing a list of intrusion pairs, each of said intrusion pairs comprising a first element and a second element which intrude according to predefined rules; b) checking a net database for elements of one of said list of intrusion pairs and returning a net and a color of elements found in said net database; c) coloring said intrusion pair of elements such that said first element and said second element comprise opposite colors; d) assigning said first element and said second element to a net and adding said net to said net database; and e) performing steps b) through d) until all intrusion pairs in said list of intrusion pairs is operated upon; and (B) signal bearing media bearing the binary coloring mechanism.

Claim 3

The program product of claim 1 wherein the signal bearing media comprises recordable media.

Claim 4

The program product of claim 1 wherein the signal bearing media comprises transmission media.

Claim 5

The program product claim 1 wherein the binary coloring mechanism colors and assigns said first element and said second element to a net by coloring said first element the opposite color of said second element and assigning said first element to the net of said second element.

Claim 6

The program product claim 1 wherein the binary coloring mechanism colors and assigns said first element and said second element to a net by combining a first net containing said first element with a second net containing said second element when said intrusion pair comprises two found elements of different colors and wherein the coloring and assigning comprises reversing the color of said first net and combining said reversed first net with said second net when said intrusion pair comprises two found elements of the same color.

Claim 7

The program product claim 1 wherein said elements comprise mask shapes and wherein said color represents mask shape phase shift.

Claim 8

The program product claim 1 wherein said elements comprise a nested set of mask shapes.

Claim 9

The program product claim 1 wherein said net database comprises a contains-list, wherein said contains-list includes a list of mask shapes and other nets contained in each net in said net database.

Claim 10

The program product of claim 8 wherein said net database comprises a contained-in-list, wherein said contained-in-list includes representation of nets that are part of higher level nets.

Claim 11

The program product of claim 1 wherein the binary coloring mechanism further comprises a mechanism for generating a phase shift mask design from said net database.

Claim 12

A program product comprising: (A) a binary coloring mechanism for coloring a binary property and forming a nested net database of colored VLSI elements with minimal data flattening in a hierarchical CAD dataset, the binary coloring mechanism including mechanisms for: a) providing a nested list of intrusion pairs of elements; b) selecting an intrusion pair of elements from said nested list, said intrusion pair including an element instance and a second element instance; c) checking said nested net database of colored elements for said first element instance and said second element instance and returning a net number and a color of any found element instance; d) coloring said element instances in said selected intrusion pair such that said first element instance has a color opposite said second element instance and adding said first element instance to a net with said second element instance in said nested net database; and e) performing steps b) through d) until all intrusion pairs in said intrusion pair list are operated upon; and (B) signal bearing media bearing the binary coloring mechanism.

Claim 13

A program product comprising: (A) a binary coloring mechanism for coloring a binary property and forming a nested net database of colored VLSI elements with minimal data flattening in a hierarchical CAD dataset, the binary coloring mechanism including mechanisms for: a) providing a nested list of intrusion pairs of elements; b) selecting an intrusion pair of elements from said nested list, said intrusion pair including an element instance and a second element instance; c) checking said nested net database of colored elements for said first element instance and said second element instance and returning a net number and a color of any found element instance; d) coloring said element instances in said selected intrusion pair such that said first element instance has a color opposite said second element instance and adding said first element instance to a net with said second element instance in said nested net database; and e) performing steps b) through d) until all intrusion pairs in said intrusion pair list are operated upon; and (B) signal bearing media bearing the binary coloring mechanism.

Claim 14

The program product of claim 11 wherein the signal bearing media comprises recordable media.

Claim 15

The program product of claim 11 wherein the signal bearing media comprises transmission media.

Claim 16

The program product of claim 11 wherein the binary coloring mechanism colors said element instances by: i) coloring said first element instance a first color and coloring said second element instance a second color and assigning said intrusion pair to a new net when said intrusion pair comprises two unfound elements; ii) coloring said first element instance the opposite color of said second element instance and assigning said first element instance to the net of said second element instance shape when said intrusion pair comprises an unfound element instance and a found element instance; and iii) combining a first net containing said first element instance with a second net containing said second element instance when said intrusion pair comprises two found element instances of different colors and comprises reversing the color of said first net and combining said reversed first net with said second net when said intrusion pair comprises two found element instances of the same color.

Claim 17

The program product of claim 11 wherein said element instances comprise mask shape instances and wherein said color comprises mask shape instance phase shift.

Claim 18

The program product of claim 11 wherein said nested net database comprises a contains-list, wherein said contains-list includes a list of shape instances and other nets contained in each net in said nested database.

Claim 19

The program product of claim 11 wherein said nested net database comprises a contained-in-list, wherein said contained-in-list includes representation of net instances that are part of higher level nets, and wherein said contained-in-list includes the number of instances of the net that could be represented at an associated node and the number of instances of the net that are represented at an associated node.

Claim 20

The program product of claim 11 wherein the binary coloring mechanism checks said nested net database for said first element instance and said second element instance by determining if the whole path to said first element instance and said second element instance is located in said nested net database.

Claim 21

The program product claim 11 wherein the binary coloring mechanism further comprises a mechanism for generating a phase shift mask design from said nested net database.

Claim 22

A program product comprising: (A) a binary coloring mechanism for phase coloring mask shapes and forming a nested database of colored mask shapes with minimal data flattening in a hierarchical CAD dataset, the binary coloring mechanism including mechanisms for: a) providing a nested list of intrusion pairs of shapes; b) selecting an intrusion pair of shapes from said nested list, said intrusion pair including a first shape instance and a second shape instance; c) checking said nested database of colored shapes for said first shape instance and said second shape instance and returning a net number and a color of any found shape instance; d) coloring said shape instances in said selected intrusion pair and assigning said shape instances to a net in said nested database, and wherein i) the binary coloring mechanism colors the shape instances and assigns the shape instances to a net by coloring said first shape instance a first color and coloring said second shape instance a second color and assigning said intrusion pair to a new net when said intrusion pair comprises two unfound shapes; ii) the binary coloring mechanism colors the shape instances and assigns the shape instances to a net by coloring said first shape instance the opposite color of said second shape instance and assigning said first shape instance to the net of said second shape instance shape when said intrusion pair comprises an unfound shape instance and a found shape instance; iii) the binary coloring mechanism colors the shape instances and assigns the shape instances to a net by combining a first net containing said first shape with a second net containing said second shape when said intrusion pair comprises two found shapes of different colors and wherein the step of coloring and assigning shape instances to a net comprises reversing the color of said first net and combining said reversed first net with said second net when said intrusion pair comprises two found shapes of the same color; and e) performing steps b) through d) until all intrusion pairs in said intrusion pair list are operated upon; (B) signal bearing media bearing the binary coloring mechanism.

Claim 23

A program product comprising: (A) a binary coloring mechanism for phase coloring mask shapes and forming a nested database of colored mask shapes with minimal data flattening in a hierarchical CAD dataset, the binary coloring mechanism including mechanisms for: a) providing a nested list of intrusion pairs of shapes; b) selecting an intrusion pair of shapes from said nested list, said intrusion pair including a first shape instance and a second shape instance; c) checking said nested database of colored shapes for said first shape instance and said second shape instance and returning a net number and a color of any found shape instance; d) coloring said shape instances in said selected intrusion pair and assigning said shape instances to a net in said nested database, and wherein i) the binary coloring mechanism colors the shape instances and assigns the shape instances to a net by coloring said first shape instance a first color and coloring said second shape instance a second color and assigning said intrusion pair to a new net when said intrusion pair comprises two unfound shapes; ii) the binary coloring mechanism colors the shape instances and assigns the shape instances to a net by coloring said first shape instance the opposite color of said second shape instance and assigning said first shape instance to the net of said second shape instance shape when said intrusion pair comprises an unfound shape instance and a found shape instance; iii) the binary coloring mechanism colors the shape instances and assigns the shape instances to a net by combining a first net containing said first shape with a second net containing said second shape when said intrusion pair comprises two found shapes of different colors and wherein the step of coloring and assigning shape instances to a net comprises reversing the color of said first net and combining said reversed first net with said second net when said intrusion pair comprises two found shapes of the same color; and e) performing steps b) through d) until all intrusion pairs in said intrusion pair list are operated upon; (B) signal bearing media bearing the binary coloring mechanism.

Claim 24

The program product of claim 20 wherein the signal bearing media comprises recordable media.

Claim 25

The program product of claim 20 wherein the signal bearing media comprises transmission media.

Claim 26

The program product of claim 20 wherein said nested database comprises a contains-list, wherein said contains-list includes a list of shape instances and other nets contained in each net in said nested database and wherein the step of coloring said shape instances in said selected intrusion pair and assigning said shape instances to a net in said nested database comprises updating said contains-list.

Claim 27

The program product of claim 20 wherein said nested database comprises a contained-in-list, wherein said contained-in-list includes representation of net instances that are part of higher level nets, and wherein said contained-in-list includes the number of instances of the net that could be represented at an associated node and the number of instances of the net that are represented at an associated node and wherein the step of coloring said shape instances in said selected intrusion pair and assigning said shape instances to a net in said nested database comprises updating said contained-in-list.

Claim 28

The program product of claim 20 wherein the binary coloring mechanism checks said nested database of colored shapes for said first shape instance and said second shape instance by determining if the whole path to said first shape instance and said second shape instance is located in said nested database.

Claim 29

The program product of claim 20 where the binary coloring mechanism further comprises a mechanism for generating a phase shifted mask from said nested database.