Efficient generation of fill shapes for chips and packages
AssigneeInternational Business Machines Corporation
InventorsDonald G. Chesebro, Young O. Kim, Mark A. Lavin, Daniel N. Maynard
Life of this patent
Estimating the term…
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.
Claims6
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.
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.
Dependencies are inferred from the claim text.