# US 6,732,351 B2 · Method of forming mask for charged particle beam exposure and processing program of pattern data for forming mask for charged particle beam exposure

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

- Number: US 6,732,351 B2
- Document ID: US6732351B2
- Status: Granted
- Kind: B2
- Application number: 10/084,501
- Filed: 2002-02-28
- Published: 2002-09-05
- Granted: 2004-05-04
- Earliest claimed: 2001-03-05
- Assignees: NEC Electronics Corporation
- Inventors: Hiroshi Yamashita
- Web page: https://patentgrep.com/patent/US6732351B2

## CPC

- G03F 1/20: Masks or mask blanks for imaging by charged particle beam [CPB] radiation, e.g. by electron beam; Preparation thereof
- G03F: PHOTOMECHANICAL PRODUCTION OF TEXTURED OR PATTERNED SURFACES, e.g. FOR PRINTING, FOR PROCESSING OF SEMICONDUCTOR DEVICES; MATERIALS THEREFOR; ORIGINALS THEREFOR; APPARATUS SPECIALLY ADAPTED THEREFOR; (phototypographic composing devices B41B; photosensitive materials or processes for photographic purposes G03C; electrophotography, sensitive layers or processes therefor G03G)

## Abstract

The present invention relates to a method of forming a mask with an opening pattern used for a charged particle beam exposure; which comprises the steps of: outlining a pattern figure represented by prescribed pattern data; descerning whether every polygonal pattern represented by pattern data being obtained through said contouring is a convex polygon or not; splitting every polygonal pattern which is not identified as a convex polygon into a plurality of pattern sections; and distributing a plurality of said pattern sections onto masks which constitute a set of complementary masks. In the present invention, any of singular patterns which may cause a problem in stencil mask formation is, through systematical identification, extracted and then, this singular pattern is split and distributed onto different masks constituting a set of complementary masks so that, while maintaining sufficient mechanical strength, the number of openings can be reduced to a minimum by avoiding superfluous pattern splitting. As a result, a stencil mask capable to improve the reliability of the pattern projection can be provided efficiently.

## Claims

### Claim 1

A method of forming a mask with an opening pattern used for a charged particle beam exposure; which comprises the steps of:
contouring a pattern figure represented by prescribed pattern data;
discerning whether every polygonal pattern represented by said pattern data being obtained through said contouring is a convex polygon or not, a polygon being convex if the interior angles at all vertices are less than 180 degrees;
splitting every said polygonal pattern which is not identified as said convex polygon into a plurality of pattern sections; and
distributing said plurality of pattern sections onto masks which constitute a set of complementary masks, such that adjacent pattern sections are distributed to different masks.

### Claim 2 (depends on 1)

A method of forming a mask used for the charged particle beam exposure according to claim 1, wherein, in said step of discerning, a signed area of triangle Δpi−1pipi+1 composed of three adjacent vertices pi−1, pi and pi+1 is obtained one by one for a vertex pi in the polygonal pattern, and once there are identified vertices for which a signed area Δpi−1pipi+1 becomes opposite to the sign thereof with which an interior angle ∠pi−1pipi+1 satisfies ∠pi−1pipi+1<180°, it is determined that said polygonal pattern is not a convex polygon.

### Claim 3 (depends on 1)

A method of forming a mask used for the charged particle beam exposure according to claim 1, which further comprises a step of:
pattern reversing in which, for every polygonal pattern which is not identified as a convex polygon in said step of discerning, there is set a pattern area for reversing, a boundary of which is composed of four sides of the smallest rectangle containing the whole original pattern figure (a polygon) and each side lying parallel to an orthogonal coordinate axis, and by reversing the pattern in this pattern area for reversing, a complementary pattern is formed; wherein
in said step of pattern splitting, in every said pattern area for reversing, a cutting line is laid down from every vertex of said complementary pattern to run parallel to a coordinate axis, and thereby pattern splitting is carried out.

### Claim 4 (depends on 3)

A method of forming a mask used for the charged particle beam exposure according to claim 3, wherein, in said step of pattern splitting, in every said pattern area for reversing, from every vertex of said complementary pattern, a cutting line to run parallel to an X-axis and a cutting line to run parallel to a Y-axis are laid down, and when, out of two sets, a set of cutting lines parallel to the X-axis and a set of cutting lines parallel to the Y-axis, one set is to be selected, a set having a larger minimum cutting distance is chosen, and if their minimum cutting distances are the same, a set provided with a smaller number of cutting lines is chosen.

### Claim 5 (depends on 1)

A method of forming a mask used for the charged particle beam exposure according to claim 1, wherein, for every polygonal pattern which is not identified as a convex polygon in said step of discerning, setting a pattern area for reversing, a boundary of which is composed of four sides of the smallest rectangle containing the whole original pattern figure (a polygon) and each side lying parallel to an orthogonal coordinate axis, and
with the exception of any polygonal pattern having the outline which, in shape, is a polygon containing another polygon inside, with the inside polygon free from internally touching the perimeter of the outside polygon, the polygonal pattern in said pattern area for reversing is not subjected to said pattern splitting, when the length of every side of the pattern area for reversing is less than a prescribed standard value.

### Claim 6 (depends on 1)

A method of forming a mask used for the charged particle beam exposure according to claim 1, which further comprises a step of:
pattern reversing in which, for every polygonal pattern which is not identified as a convex polygon in said step of discerning, there is set a pattern area for reversing, a boundary of which is composed of four sides of the smallest rectangle containing the whole original pattern figure (a polygon) and each side lying parallel to an orthogonal coordinate axis, and by reversing the pattern in this pattern area for reversing, a complementary pattern is formed; wherein
in said pattern area for reversing having a complementary pattern which has, at least, one side in common with the boundary of the pattern area for reversing and, at least, two sides independent of the pattern area boundary, if, for the mask that is to be fabricated, a force applied onto a line segment joining two vertices on the boundary of said pattern area for reversing (excepting vertices of the pattern area) out of vertices of said complementary pattern, is less than a prescribed standard value, said pattern splitting is not to be applied thereto.

### Claim 7 (depends on 1)

A method of forming a mask used for the charged particle beam exposure according to claim 1, wherein, in said step of distributing, a polygonal pattern that is undivided without having received the pattern splitting is distributed to one of the complementary masks so as to equalize, at the end, an area density of pattern figures assigned thereto with the one assigned to every other complementary masks.

### Claim 8 (depends on 1)

A method of forming a mask used for the charged particle beam exposure according to claim 1, which further comprises a step of rectangular pattern correction, for a rectangular pattern, being one of said polygonal patterns, identified as a convex polygon in said step of discerning, wherein an area of the pattern figure exceeds a prescribed reference area; wherein pattern correction is carried out in such a way that with four corners being cut off within a permissible range of accuracy of dimension for the opening pattern, the original rectangular pattern is made to take the form of an octagon.

### Claim 9 (depends on 1)

A method of forming a mask used for the charged particle beam exposure according to claim 1, which further comprises a step of rectangular pattern splitting for a rectangular pattern, being one of said polygonal patterns, identified as a convex polygon in said step of discerning, wherein an area of the pattern figure exceeds a prescribed reference area; wherein the original rectangular pattern is split into an octagon from which four corners have been cut off and four triangles corresponding to the four corners which have been cut off; and said octagonal pattern and four triangle patterns are distributed onto different masks.

### Claim 10 (depends on 1)

A method of forming a mask used for the charged particle beam exposure according to claim 1, wherein said prescribed pattern data is data for LSI patterns arrayed parallel to an X-axis or a Y-axis in the orthogonal coordinate system.

### Claim 11

A program for processing pattern data to form a mask with an opening pattern used for charged particle beam exposure, comprising:
first computer code for contouring a pattern figure represented by prescribed pattern data;
second computer code for discerning whether every polygonal pattern represented by said pattern data being obtained through said contouring is a convex polygon or not, a polygon being convex if the interior angles at all vertices are less than 180 degrees;
third computer code for splitting every said polygonal pattern which is not identified as said convex polygon into a plurality of pattern sections; and
fourth computer code for distributing said plurality of said pattern sections onto masks which constitute a set of complementary masks, such that adjacent pattern sections are distributed to different masks.

### Claim 12 (depends on 11)

A program as in claim 11, wherein, in said second computer code for discerning, a signed area of triangle Δpi−1pipi+1 composed of three adjacent vertices pi−1, pi and pi+1 is obtained one by one for a vertex pi in the polygonal pattern, and once there are identified vertices for which a signed area Δpi−1pipi+1 becomes opposite to the sign thereof with which an interior angle ∠pi−1pipi+1 satisfies ∠p−1pipi+1<180°, it is determined that said polygonal pattern is not a convex polygon.

### Claim 13 (depends on 11)

A program as in claim 11, further comprising fifth computer code for pattern reversing in which, for every polygonal pattern which is not identified as a convex polygon in said step of discerning, there is set a pattern area for reversing, a boundary of which is composed of four sides of the smallest rectangle containing the whole original pattern figure (a polygon) and each side lying parallel to an orthogonal coordinate axis, and by reversing the pattern in this pattern area for reversing, a complementary pattern is formed;
wherein in said third computer code for pattern splitting, in every said pattern area for reversing, a cutting line is laid down from every vertex of said complementary pattern to run parallel to a coordinate axis, and thereby pattern splitting is carried out.

### Claim 14 (depends on 13)

A program as in claim 13, wherein, in said third computer code for pattern splitting, in every said pattern area for reversing, from every vertex of said complementary pattern, a cutting line to run parallel to an X-axis and a cutting line to run parallel to a Y-axis are laid down, and when, out of two sets, a set of cutting lines parallel to the X-axis and a set of cutting lines parallel to the Y-axis, one set is to be selected, a set having a larger minimum cutting distance is chosen, and if their minimum cutting distances are the same, a set provided with a smaller number of cutting lines is chosen.

### Claim 15 (depends on 11)

A program as in claim 11, wherein, for every polygonal pattern which is not identified as a convex polygon in said second computer code for discerning, setting a pattern area for reversing, a boundary of which is composed of four sides of the smallest rectangle containing the whole original pattern figure (a polygon) and each side lying parallel to an orthogonal coordinate axis, and
with the exception of any polygonal pattern having the outline which, in shape, is a polygon containing another polygon inside, with the inside polygon free from internally touching the perimeter of the outside polygon, the polygonal pattern in said pattern area for reversing is not subjected to said pattern splitting, when the length of every side of the pattern area for reversing is less than a prescribed standard value.

### Claim 16 (depends on 11)

A program as in claim 11, further comprising sixth computer code for pattern reversing in which, for every polygonal pattern which is not identified as a convex polygon in said step of discerning, there is set a pattern area for reversing, a boundary of which is composed of four sides of the smallest rectangle containing the whole original pattern figure (a polygon) and each side lying parallel to an orthogonal coordinate axis, and by reversing the pattern in this pattern area for reversing, a complementary pattern is formed;
wherein in said pattern area for reversing having a complementary pattern which has, at least, one side in common with the boundary of the pattern area for reversing and, at least, two sides independent of the pattern area boundary, if, for the mask that is to be fabricated, a force applied onto a line segment joining two vertices on the boundary of said pattern area for reversing (excepting vertices of the pattern area) out of vertices of said complementary pattern, is less than a prescribed standard value, said pattern splitting is not to be applied thereto.

### Claim 17 (depends on 11)

A program as in claim 11, wherein, in said fourth computer code for distributing, a polygonal pattern that is undivided without having received the pattern splitting is distributed to one of the complementary masks so as to equalize, at the end, an area density of pattern figures assigned thereto with the one assigned to every other complementary masks.

### Claim 18 (depends on 11)

A program as in claim 11, further comprising seventh computer code for rectangular pattern correction, for a rectangular pattern, being one of said polygonal patterns, identified as a convex polygon by said second computer code for discerning, wherein an area of the pattern figure exceeds a prescribed reference area; wherein pattern correction is carried out in such a way that with four corners being cut off within a permissible range of accuracy of dimension for the opening pattern, the original rectangular pattern is made to take the form of an octagon.

### Claim 19 (depends on 11)

A program as in claim 11, further comprising eighth computer code for rectangular pattern splitting for a rectangular pattern, being one of said polygonal patterns, identified as a convex polygon in said step of discerning, wherein an area of the pattern figure exceeds a prescribed reference area;
wherein the original rectangular pattern is split into an octagon from which four corners have been cut off and four triangles corresponding to the four corners which have been cut off; and said octagonal pattern and four triangle patterns are distributed onto different masks.
