US5636133A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Efficient generation of fill shapes for chips and packages
Assignee: International Business Machines Corp
•
Filing: 1995-05-19
•
Granted: 1997-06-03
•
Expires: 2015-05-19
Abstract
Abstract An efficient method for modifying a chip or package design allows for the creation of small shapes without excessive expansion of design data. A computer program takes a physical design, represented in a computer data file, and generates a modified version of the design in which fill shapes have been added. Subsequently, when the modified design is processed, the resulting semiconductor chip or package will contain physical images of the added fill shapes, with the effect of making local pattern density more uniform and hence reducing process-induced variations in feature size and shape.
Inventors
- 👤 Donald G. Chesebro
- 👤 Young O. Kim
- 👤 Mark A. Lavin
- 👤 Daniel N. Maynard
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 02:47
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/39; G06F30/398
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
141 words
A computer-implemented method for modifying an integrated circuit chip or package design by adding fill shapes to the design comprising the steps of: inputting an original design as a data file; for each level of the original design, generating an area-not-to-fill as a function of set backs from features of the original design; computing an areas-not-to-fill as a union of generated area-not-to-fill for all levels; operating on the computed areas-not-to-fill to generate a complement as areas-to-fill and eliminating portions of the areas-to-fill that are narrower than a fill pattern unit cell; breaking remaining areas-to-fill into geometric shapes; populating resulting geometric shapes with a fill pattern comprised of multiple placements of the fill pattern unit cell; and combining the generated fill shapes with the original design to make local pattern density more uniform and reduce process-induced variations in feature size and shape.
Claim 2
Dependent Claim
141 words
A computer-implemented method for modifying an integrated circuit chip or package design by adding fill shapes to the design comprising the steps of: inputting an original design as a data file; for each level of the original design, generating an area-not-to-fill as a function of set backs from features of the original design; computing an areas-not-to-fill as a union of generated area-not-to-fill for all levels; operating on the computed areas-not-to-fill to generate a complement as areas-to-fill and eliminating portions of the areas-to-fill that are narrower than a fill pattern unit cell; breaking remaining areas-to-fill into geometric shapes; populating resulting geometric shapes with a fill pattern comprised of multiple placements of the fill pattern unit cell; and combining the generated fill shapes with the original design to make local pattern density more uniform and reduce process-induced variations in feature size and shape.
Claim 3
Dependent Claim
25 words
The computer-implemented method for modifying an integrated circuit chip or package design recited in claim 1 wherein the geometric shapes are rectangles, quadrilaterals and triangles.
Claim 4
Dependent Claim
45 words
The computer-implemented method for modifying an integrated circuit chip or package design recited in claim 1 further comprising the step of determining placements of the fill pattern unit cell by generating a repetitive array of unit cells and selecting those completely covered by the areas-to-fill.
Claim 5
Dependent Claim
54 words
The computer-implemented method for modifying an integrated circuit chip or package design recited in claim 1 further comprising the steps of: determining placements of the fill pattern unit cell by shrinking the areas-to-be-filled; determining which of an infinite regular array of grid points fall in the areas-to-be-filled; and generating a placement for each point.
Claim 6
Dependent Claim
68 words
The computer-implemented method for modifying an integrated circuit chip or package design recited in claim 1 further comprising the steps of: determining placements of the fill pattern unit cell by shrinking the rectangular area-to-be-filled; determining a rectangular subset of an infinite regular array of grid points that fall in the areas- to-be-filled; and generating a step-and-repeat placement of the fill pattern unit cell corresponding to that rectangular subset.
Claim 7
Dependent Claim
159 words
A programmed computer system for modifying an integrated circuit chip or package design represented by a data file, comprising: generating means for accessing said data file and, for each level of an original design, generating an area-not-to-fill as a function of set backs from features of the original design; computing means responsive each area-not-to-fill generated by said generating means for computing an areas-not-to-fill as a union of all generated area-not-to-fill, said computing means then complementing the computed areas-not-to-fill to generate a complement as an areas-to-fill; comparison means for eliminating portions of the areas-to-fill that are narrower than a fib pattern unit cell; geometric means for breaking remaining areas-to-fill into geometric shapes and populating resulting geometric shapes with a fill pattern comprised of multiple placements of the fill pattern unit cell; and combining means for combining the generated fill shapes with the original design to make local pattern density more uniform and reduce process-induced variations in feature size and shape.
Claim 8
Dependent Claim
159 words
A programmed computer system for modifying an integrated circuit chip or package design represented by a data file, comprising: generating means for accessing said data file and, for each level of an original design, generating an area-not-to-fill as a function of set backs from features of the original design; computing means responsive each area-not-to-fill generated by said generating means for computing an areas-not-to-fill as a union of all generated area-not-to-fill, said computing means then complementing the computed areas-not-to-fill to generate a complement as an areas-to-fill; comparison means for eliminating portions of the areas-to-fill that are narrower than a fib pattern unit cell; geometric means for breaking remaining areas-to-fill into geometric shapes and populating resulting geometric shapes with a fill pattern comprised of multiple placements of the fill pattern unit cell; and combining means for combining the generated fill shapes with the original design to make local pattern density more uniform and reduce process-induced variations in feature size and shape.
References Cited (Backward Citations)
US4789944A
Cited
US4809201A
Cited
US5062054A
Cited
US5319570A
Cited
US5278105A
Cited
US5481473A
Cited
US5519628A
Cited
US5528508A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-06-02 | 2000-12-02 | 2001-06-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-06-02 | 2004-12-02 | 2005-06-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-06-02 | 2008-12-02 | 2009-06-03 | $7700.00 | Window Closed / Lapsed |