# US 2006/0041851 A1 · Renesting interaction map into design for efficient long range calculations

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

- Number: US 2006/0041851 A1
- Document ID: US20060041851A1
- Status: Published application
- Kind: A1
- Application number: 11/242,723
- Filed: 2005-10-03
- Published: 2006-02-23
- Earliest claimed: 2003-10-27
- Assignees: IBM Corporation
- Inventors: Gregg Gallatin; Emanuel Gofman; Kafai Lai; Mark Lavin; Maharaj Mukherjee; Dov Ramm; Alan Rosenbluth; Shlomo Shlafman
- Web page: https://patentgrep.com/patent/US20060041851A1

## CPC

- G03F 1/36: Masks having proximity correction features; Preparation thereof, e.g. optical proximity correction [OPC] design processes
- G03F 1/68: Preparation processes not covered by groups G03F1/20 - G03F1/50
- G06F 30/39: Circuit design at the physical level (physical level design for reconfigurable circuits G06F30/347)
- 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)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Methods, and program storage devices, for performing model-based optical lithography corrections by partitioning a cell array layout, having a plurality of polygons thereon, into a plurality of cells covering the layout. This layout is representative of a desired design data hierarchy. A density map is then generated corresponding to interactions between the polygons and plurality of cells, and then the densities within each cell are convolved. An interaction map is formed using the convolved densities, followed by truncating the interaction map to form a map of truncated cells. Substantially identical groupings of the truncated cells are then segregated respectively into differing ones of a plurality of buckets, whereby each of these buckets comprise a single set of identical groupings of truncated cells. A hierarchal arrangement is generated using these buckets, and the desired design data hierarchy enforced using the hierarchal arrangement to ultimately correct for optical lithography.

## Claims

### Claim 1

A method of performing model-based optical lithography corrections comprising:
providing a cell array layout of a desired design data hierarchy having a plurality of finite geometrical shapes;
partitioning said cell array layout into a plurality of cells;
generating an interaction map based on a density map corresponding to interactions between said plurality of finite geometrical shapes and said plurality of cells;
truncating said interaction map to generate a map of truncated cells;
grouping substantially identical occurrences of selected ones of said truncated cells into a single bucket selected from a plurality of distinct buckets; and
enforcing said desired design data hierarchy using said plurality of distinct buckets to correct for optical lithography.

### Claim 2 (depends on 1)

The method of claim 1 wherein said desired design data hierarchy comprises a plurality of levels of hierarchy such that said method may occur at any of said plurality of levels of hierarchy.

### Claim 3 (depends on 1)

The method of claim 1 wherein said cell array layout comprises a qausi-image of said determined desired design data hierarchy for enforcing said desired design data hierarchy.

### Claim 4 (depends on 1)

The method of claim 1 wherein said plurality of finite geometrical shapes comprises a plurality of polygons.

### Claim 5 (depends on 4)

The method of claim 4 wherein said plurality of polygons are selected from the group of polygons consisting of a regular polygon, irregular polygon, convex polygon, concave polygon, regular convex polygon, regular concave polygon, irregular convex polygon, irregular concave polygon and combinations thereof.

### Claim 6 (depends on 1)

The method of claim 1 wherein said plurality of cells of said partitioned cell array layout comprise a plurality of finite shapes capable of covering an entire area of said cell array layout.

### Claim 7

(canceled)

### Claim 8 (depends on 1)

The method of claim 1 wherein said interactions between said plurality of finite geometrical shapes and said plurality of cells are selected from a group of density effects consisting of geometries of the finite geometrical shapes, an amount of coverage of said finite geometrical shapes, an area coverage, a computed aerial image coverage, a computed resist image coverage, perimeter coverage and combinations thereof.

### Claim 9

(canceled)

### Claim 10 (depends on 1)

The method of claim 1 wherein said step of grouping said substantially identical occurrences of selected ones of said truncated cells into said buckets further comprises:
determining a density value and all neighboring cells for each of said truncated cells residing within said map of truncated cells;
determining at least one set of substantially identical truncated cells within said map by locating selected ones of said truncated cells have substantially identical said density values and said neighboring cells; and
grouping said at least one set of substantially identical truncated cells into said bucket.

### Claim 11 (depends on 10)

The method of claim 10 further comprising determining a plurality of differing sets of substantially identical truncated cells and grouping each of said plurality of differing sets into a respective differing bucket selected from said plurality of distinct buckets, wherein each said respective differing bucket comprises only substantially identical ones of said truncated cells.

### Claim 12 (depends on 1)

The method of claim 1 wherein said step of grouping said substantially identical occurrences of said selected ones of said truncated cells transforms said selected ones of said truncated cells into a single building block for enforcing said design data hierarchy.

### Claim 13 (depends on 12)

The method of claim 12 further including the steps of:
providing a plurality of differing single building blocks;
generating a hierarchal arrangement of said plurality of differing single building blocks; and
enforcing said desired design data hierarchy using said hierarchal arrangement.

### Claim 14 (depends on 1)

The method of claim 1 wherein said desired design data hierarchy is enforced by maintaining said desired design data hierarchy.

### Claim 15 (depends on 1)

The method of claim 1 wherein said desired design data hierarchy is enforced by building a new design data hierarchy upon at least partial destruction of said desired design data hierarchy.

### Claim 16

A method of performing model-based optical lithography corrections comprising:
providing a cell array layout representative of a desired design data hierarchy having a plurality of polygons thereon;
partitioning said cell array layout into a plurality of cells;
providing a density map corresponding to interactions between said polygons and said plurality of cells;
generating an interaction map based on said density map;
truncating said interaction map to generate a map of truncated cells;
segregating substantially identical groupings of said truncated cells respectively into differing ones of a plurality of buckets, whereby each of said plurality of buckets comprises a single set of said identical groupings of said truncated cells,
generating a hierarchal arrangement using said plurality of buckets; and
enforcing said desired design data hierarchy using said hierarchal arrangement to correct for optical lithography.

### Claim 17 (depends on 16)

The method of claim 16 wherein said density map comprises a plurality of densities, one for each of said plurality of cells.

### Claim 18

(canceled)

### Claim 19 (depends on 16)

The method of claim 16 wherein said interactions between said polygons and said plurality of cells are selected from a group of density effects consisting of geometries of the polygons, an amount of coverage of said polygons, an area coverage, a computed aerial image coverage, a computed resist image coverage, perimeter coverage and combinations thereof.

### Claim 20

(canceled)

### Claim 21 (depends on 16)

The method of claim 16 wherein said step of grouping said substantially identical occurrences of selected ones of said truncated cells into said buckets further comprises:
determining a density value and all neighboring cells for each of said truncated cells residing within said map of truncated cells;
determining at least one set of substantially identical truncated cells within said map by locating selected ones of said truncated cells have substantially identical said density values and said neighboring cells; and
grouping said at least one set of substantially identical truncated cells into said single bucket.

### Claim 22 (depends on 16)

The method of claim 16 wherein said step of segregating said substantially identical groupings of said truncated cells transforms said groupings of said truncated cells into a single building block for enforcing said design data hierarchy.

### Claim 23 (depends on 22)

The method of claim 22 wherein said hierarchal arrangement comprises a plurality of said single building blocks.

### Claim 24 (depends on 23)

The method of claim 23 wherein said plurality of said single building blocks occur at numerous locations across said map of truncated cells selected from a group of building block occurrences consisting of exact duplicates, rotated versions, mirrored versions, rotated-mirrored versions and combinations thereof.

### Claim 25 (depends on 16)

The method of claim 16 wherein said desired design data hierarchy is enforced by maintaining said desired design data hierarchy.

### Claim 26 (depends on 16)

The method of claim 16 wherein said desired design data hierarchy is enforced by rebuilding a new design data hierarchy upon at least partial destruction of said desired design data hierarchy.

### Claim 27 (depends on 26)

The method of claim 26 wherein said desired design data hierarchy and said new design data hierarchy are identical to each other.

### Claim 28 (depends on 26)

The method of claim 26 wherein said desired design data hierarchy and said new design data hierarchy are different from each other.

### Claim 29

A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform method steps for performing model-based optical proximity correction, said method steps comprising:
providing a cell array layout of a desired design data hierarchy having a plurality of finite geometrical shapes;
partitioning said cell array layout into a plurality of cells;
generating an interaction map based on a density map corresponding to interactions between said plurality of finite geometrical shapes and said plurality of cells;
truncating said interaction map to generate a map of truncated cells;
grouping substantially identical occurrences of selected ones of said truncated cells into a single bucket selected from a plurality of distinct buckets; and
enforcing said desired design data hierarchy using said plurality of distinct buckets to correct for optical lithography.

### Claim 30

A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform method steps for performing model-based optical proximity correction, said method steps comprising:
providing a cell array layout representative of a desired design data hierarchy having a plurality of polygons thereon;
partitioning said cell array layout into a plurality of cells;
providing a density map corresponding to interactions between said polygons and said plurality of cells;
generating an interaction map based on said density map;
truncating said interaction map to generate a map of truncated cells;
segregating substantially identical groupings of said truncated cells respectively into differing ones of a plurality of buckets, whereby each of said plurality of buckets comprises a single set of said identical groupings of said truncated cells,
generating a hierarchal arrangement using said plurality of buckets; and
enforcing said desired design data hierarchy using said hierarchal arrangement to correct for optical lithography.
