# US 2017/0255740 A1 · Design rule checking for multiple patterning technology

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

- Number: US 2017/0255740 A1
- Document ID: US20170255740A1
- Status: Published application
- Kind: A1
- Application number: 15/057,999
- Filed: 2016-03-01
- Published: 2017-09-07
- Earliest claimed: 2016-03-01
- Assignees: Taiwan Semiconductor Manufacturing Company, Ltd.
- Applicants: Taiwan Semiconductor Manufacturing Co., Ltd.
- Inventors: Meng-Kai HSU; Yuan-Te HOU; Wen-Hao CHEN
- Web page: https://patentgrep.com/patent/US20170255740A1

## 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 2119/18: Manufacturability analysis or optimisation for manufacturability
- Y02P 90/02: Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y02P: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS

## Abstract

A method is disclosed that includes determining whether there is a conflict graph representing that each spacing between any two of at least five adjacent patterns of multiple-patterning patterns of a layout of an integrated circuit (IC) is less than a threshold spacing, and if there is the conflict graph, modifying the multiple-patterning patterns to exclude patterns represented by the conflict graph, for fabrication of the IC.

## Claims

### Claim 1

A method comprising:
determining whether there is a conflict graph representing that each spacing between any two of at least five adjacent patterns of multiple-patterning patterns of a layout of an integrated circuit (IC) is less than a threshold spacing; and
if there is the conflict graph, modifying the multiple-patterning patterns to exclude patterns represented by the conflict graph, for fabrication of the IC.

### Claim 2 (depends on 1)

The method of claim 1, wherein the multiple-patterning patterns are implemented by quadruple-patterning (QP) patterns to be assigned to four different masks.

### Claim 3 (depends on 1)

The method of claim 1, wherein determining whether there is the conflict graph comprises:
identifying if the conflict graph comprises a sub-graph, wherein the sub-graph represents that each spacing between any two of three adjacent patterns of quadruple-patterning (QP) patterns in at least one of two abutting cells is smaller than the threshold spacing.

### Claim 4 (depends on 3)

The method of claim 3, wherein if the conflict graph comprises the sub-graph, the method further comprises:
identifying if one of edges that connects the three adjacent patterns of QP patterns to one another is constructed along, and/or in parallel with, a boundary between the two abutting cells.

### Claim 5 (depends on 3)

The method of claim 3, wherein if the conflict graph comprises the sub-graph, the method further comprises:
identifying if at least one projection, on a boundary between the two abutting cells, of edges that connects the three adjacent patterns of QP patterns to one another in one of the two abutting cells, is overlapped with at least one projection, on the same boundary, of edges that connects the three adjacent patterns of QP patterns to one another in the other of the two abutting cells.

### Claim 6 (depends on 1)

The method of claim 1, wherein modifying the multiple-patterning patterns comprises:
spacing apart from each other at least two closest patterns, in two abutting cells, of multiple-patterning patterns, for a spacing that is equal to, or greater than, the threshold spacing.

### Claim 7 (depends on 1)

The method of claim 1, wherein modifying the multiple-patterning patterns comprises:
spacing apart from each other two abutting cells each including three adjacent quadruple-patterning (QP) patterns that are connected to one another by edges each having a spacing smaller than the threshold spacing.

### Claim 8

A system, comprising:
a storage device configured to store computer program codes; and
a processor configured to execute the computer program codes in the storage device for:
based on data corresponding to a layout of an integrated circuit (IC), building a graph representing multiple-patterning patterns;
checking whether the graph comprises a sub-graph representing that each spacing between any two of at least five adjacent patterns of the multiple-patterning patterns is smaller than a threshold spacing; and
when the graph comprises the sub-graph, modifying the graph to exclude the sub-graph, for fabrication of the IC.

### Claim 9 (depends on 8)

The system of claim 8, wherein for building the graph, the processor is further configured to execute the computer program codes for: building a graph representing quadruple-patterning (QP) patterns in each cell within the layout, or in abutting cells within the layout.

### Claim 10 (depends on 8)

The system of claim 8, wherein for checking whether the graph comprises the sub-graph, the processor is further configured to execute the computer program codes for:
checking whether the graph comprises the sub-graph in each cell within the layout, or in two abutting cells within the layout.

### Claim 11 (depends on 10)

The system of claim 10, wherein for checking whether the graph comprises the sub-graph in two abutting cells within the layout, the processor is further configured to execute the computer program codes for:
identifying if the graph comprises a first sub-graph, wherein the first sub-graph represents that each spacing between any two of three adjacent patterns of quadruple-patterning (QP) patterns in at least one of the two abutting cells is smaller than the threshold spacing.

### Claim 12 (depends on 11)

The system of claim 11, wherein when the graph comprises the first sub-graph, the processor is further configured to execute the computer program codes for:
identifying if one of edges that connects the three adjacent patterns of QP patterns to one another is constructed along, and/or in parallel with, a boundary between the two abutting cells.

### Claim 13 (depends on 11)

The system of claim 11, wherein when the graph comprises the first sub-graph, the processor is further configured to execute the computer program codes for:
identifying if any projection, on a boundary between the two abutting cells, of edges that connects the three adjacent patterns of QP patterns to one another in one of the two abutting cells, is overlapped with any projection, on the same boundary, of edges that connects the three adjacent patterns of QP patterns to one another in the other of the two abutting cells.

### Claim 14 (depends on 8)

The system of claim 8, wherein for modifying the graph, the processor is further configured to execute the computer program codes for:
spacing two abutting cells in the graph apart from each other, wherein each one of the two abutting cells includes three adjacent multiple-patterning patterns that are connected to one another by edges.

### Claim 15

A non-transitory computer readable medium comprising computer executable instructions which, when executed by a processor, cause the processor to carry out a method, the method comprising:
grouping multiple-patterning patterns of a layout of an integrated circuit (IC), into a plurality of subsets of patterns to be assigned to various numbers of different masks;
for each one of the subsets of patterns to be assigned to masks including four different masks, building a graph including quadruple-patterning (QP) patterns;
checking whether the graph comprises a conflict graph in which each spacing between any two of adjacent five patterns of the QP patterns is smaller than a threshold spacing; and
when the graph comprises the conflict graph, modifying the layout to exclude the conflict graph, for fabricating the IC.

### Claim 16 (depends on 15)

The non-transitory computer readable medium of claim 15, wherein checking whether the graph comprises the conflict graph comprises:
checking whether the graph comprises the conflict graph in each cell within the layout, or in two abutting cells within the layout.

### Claim 17 (depends on 16)

The non-transitory computer readable medium of claim 16, wherein checking whether the graph comprises the conflict graph in two abutting cells within the layout comprises:
identifying if the graph comprises a first conflict graph, wherein the first conflict graph represents that each spacing between any two of three adjacent patterns of the QP patterns in at least one of the two abutting cells is less than the threshold spacing.

### Claim 18 (depends on 17)

The non-transitory computer readable medium of claim 17, wherein when the graph comprises the first conflict graph, checking whether the graph comprises the conflict graph in two abutting cells within the layout further comprises:
identifying if one of edges that connects the three adjacent patterns of the QP patterns to one another is constructed along, and/or in parallel with, a boundary between the two abutting cells.

### Claim 19 (depends on 17)

The non-transitory computer readable medium of claim 17, wherein when the graph comprises the first conflict graph, checking whether the graph comprises the conflict graph in two abutting cells within the layout further comprises:
identifying if any projection, on a boundary between the two abutting cells, of edges that connects the three adjacent patterns of QP patterns to one another in one of the two abutting cells, is overlapped with any projection, on the same boundary, of edges that connects the three adjacent patterns of QP patterns to one another in the other of the two abutting cells.

### Claim 20 (depends on 15)

The non-transitory computer readable medium of claim 15, wherein modifying the layout comprises:
spacing two abutting cells in the layout apart from each other, wherein each one of the two abutting cells includes three adjacent QP patterns that are connected to one another by edges each having a spacing smaller than the threshold spacing.
