US5731986A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of downsizing graphic data of a mask pattern stored in a hierarchical graphic database
Assignee: Winbond Electronics Corp
•
Filing: 1996-05-06
•
Granted: 1998-03-24
•
Expires: 2016-05-06
Abstract
Abstract A method for downsizing graphic data of a mask pattern stored in a hierarchical graphic database so that the mask pattern can be used in fabrication of integrated circuits (ICs) having a reduced feature size. The method includes filling gaps formed between abutting graphic elements with supplementary graphic elements, without disturbing or modifying the overall hierarchical structure for recording and relating all the graphic elements in the mask pattern. Further, the method downsizes the graphic data of a mask pattern without greatly increasing the amount of required data storage in the hierarchical graphic database, which would burden the storage, transmission, and modification capacities of the mask pattern. The method includes the steps of: (1) downsizing the hierarchical graphic database; (2) flattening the downsized hierarchical graphic database; (3) oversizing the flattened hierarchical graphic database; (4) undersizing the oversized hierarchical graphic database; (5) performing a logical-NOT operation on the undersized hierarchical graphic database and the flattened hierarchical graphic database so as to obtain a gap-filling graphic element; and (6) incorporating the gap-filling graphic element in the downsized hierarchical graphic database.
Inventors
- 👤 Shy-Lun Yang
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 15:51
CPC Classifications
G; G06; G06T; G06T3/00; G06T3/40; G06T3/4007; G06F; G06F30/00; G06F30/30; G06F30/39
Claims Analysis
Total Claims: 31
Claim 1
Independent Claim
109 words
A method for downsizing a graphic image including a plurality of graphic elements stored in a hierarchical graphic database wherein at least two individual graphic elements abut, comprising the steps of: (1) downsizing the hierarchical graphic database; (2) flattening the downsized hierarchical graphic database; (3) oversizing the flattened hierarchical graphic database so as to form an integral graphic element of individual abutting graphic elements; (4) undersizing the oversized hierarchical graphic database; (5) performing a logical-NOT operation on the undersized hierarchical graphic database and the flattened hierarchical graphic database so as to obtain a gap-filling graphic element; and (6) incorporating the gap-filling graphic dement into the downsized hierarchical graphic database.
Claim 2
Independent Claim
109 words
A method for downsizing a graphic image including a plurality of graphic elements stored in a hierarchical graphic database wherein at least two individual graphic elements abut, comprising the steps of: (1) downsizing the hierarchical graphic database; (2) flattening the downsized hierarchical graphic database; (3) oversizing the flattened hierarchical graphic database so as to form an integral graphic element of individual abutting graphic elements; (4) undersizing the oversized hierarchical graphic database; (5) performing a logical-NOT operation on the undersized hierarchical graphic database and the flattened hierarchical graphic database so as to obtain a gap-filling graphic element; and (6) incorporating the gap-filling graphic dement into the downsized hierarchical graphic database.
Claim 3
Dependent Claim
60 words
A method as claimed in claim 1, wherein in said step (1) the hierarchical graphic database is based on an N-level hierarchical structure consisting of a plurality of groups in the N levels and having at least a first level group serving as a root group, coordinates of the first level group serving as absolute coordinates for the graphic image.
Claim 4
Dependent Claim
46 words
A method as claimed in claim 2, wherein in said step (1) the root group serves as a parent group and any group referenced to the parent group serves as a child group, each child group being the parent group of any next lower level group.
Claim 5
Dependent Claim
43 words
A method as claimed in claim 3, wherein in said step (1) at least a parent group at a specific level is selected as a target group which is downsized by multiplication with a downsizing factor to obtain the downsized hierarchical graphic database.
Claim 6
Dependent Claim
23 words
A method as claimed in claim 4, wherein in said step (2) the flattened hierarchical graphic database is flattened within the target group.
Claim 7
Dependent Claim
27 words
A method as claimed in claim 5, wherein in said step (2) a gap is formed between at least a pair of abutting graphic elements after downsizing.
Claim 8
Dependent Claim
42 words
A method as claimed in claim 6, wherein said step (3) includes enlarging the pair of graphic elements to include additional expanded areas and merging the pair of graphic elements into an integral graphic element, the expanded areas making the gap disappear.
Claim 9
Dependent Claim
25 words
A method as claimed in claim 7, wherein in said step (3) the merging of the abutting graphic elements is achieved through a combination operation.
Claim 10
Dependent Claim
24 words
A method as claimed in claim 7, wherein in said step (3) an oversizing factor is used to oversize the flattened hierarchical graphic database.
Claim 11
Dependent Claim
71 words
A method as claimed in claim 9, wherein in said step (3) the oversizing factor is limited by the following restriction: (coordinate unit×N)/4≦(oversizing distance) ≦(length of the space between two separated graphic elements)/2-(coordinate unit), wherein the "oversizing distance" is an amount of increase in dimension of each graphic element, corresponding to the oversizing factor, and wherein the "coordinate unit" means the unit of the coordinates of the elements of the database.
Claim 12
Dependent Claim
25 words
A method as claimed in claim 9, wherein in said step (4) an undersizing factor is used to undersize the oversized flattened hierarchical graphic database.
Claim 13
Dependent Claim
21 words
A method as claimed in claim 11, wherein in said step (4) the undersizing factor is equal to the oversizing factor.
Claim 14
Dependent Claim
38 words
A method as claimed in claim 12, wherein in said step (5) the gap-filling graphic element is of a size identical to that of the gap and is referenced to absolute coordinates identical to those of the gap.
Claim 15
Dependent Claim
32 words
A method as claimed in claim 13, wherein in said step (6) the gap-filling graphic element is put into the target group and referenced to the same absolute coordinates as the gap.
Claim 16
Dependent Claim
46 words
A method as claimed in claim 13, wherein said step (6) includes the step of adding a group as a child group of the target group and incorporating the gap-filling graphic element via the child group, so that the target group references the gap-filling graphic element.
Claim 17
Independent Claim
138 words
A method for downsizing a mask pattern stored in a hierarchical graphic database including of a plurality of groups in corresponding levels, for use in a semiconductor fabrication process, a specific group serving as a target group, wherein at least two individual graphic elements abut, comprising the steps of: (1) multiplying the target group by a downsizing factor so as to downsize the hierarchical graphic database; (2) flattening the downsized hierarchical graphic database; (3) oversizing the flattened hierarchical graphic database so as to form an integral graphic element of individual abutting graphic elements; (4) undersizing the oversized hierarchical graphic database; (5) performing a logical-NOT operation on the undersized hierarchical graphic database and the flattened hierarchical graphic database so as to obtain a gap-filling graphic element; and (6) incorporating the gap-filling graphic element into the downsized hierarchical graphic database.
Claim 18
Independent Claim
138 words
A method for downsizing a mask pattern stored in a hierarchical graphic database including of a plurality of groups in corresponding levels, for use in a semiconductor fabrication process, a specific group serving as a target group, wherein at least two individual graphic elements abut, comprising the steps of: (1) multiplying the target group by a downsizing factor so as to downsize the hierarchical graphic database; (2) flattening the downsized hierarchical graphic database; (3) oversizing the flattened hierarchical graphic database so as to form an integral graphic element of individual abutting graphic elements; (4) undersizing the oversized hierarchical graphic database; (5) performing a logical-NOT operation on the undersized hierarchical graphic database and the flattened hierarchical graphic database so as to obtain a gap-filling graphic element; and (6) incorporating the gap-filling graphic element into the downsized hierarchical graphic database.
Claim 19
Dependent Claim
50 words
A method as claimed in claim 16, wherein in said step (1) the plurality of groups are in an N-level hierarchical structure and includes at least a first level group serving as a root group, the coordinates of the first level group serving as absolute coordinates for a graphic image.
Claim 20
Dependent Claim
46 words
A method as claimed in claim 17, wherein in said step (1) the root group serves as a parent group and any group referenced to the parent group serves as a child group, each child group being the parent group of any next lower level group.
Claim 21
Dependent Claim
23 words
A method as claimed in claim 18, wherein in said step (1) the downsizing factor is in a range from 0 to 1.
Claim 22
Dependent Claim
25 words
A method as claimed in claim 18, wherein in said step (2) a gap is formed between at least a pair of abutting graphic elements.
Claim 23
Dependent Claim
42 words
A method as claimed in claim 20, wherein said step (3) includes enlarging the pair of graphic elements to include additional expanded areas, and merging the pair of graphic elements into an integral graphic element, the expanded areas making the gap disappear.
Claim 24
Dependent Claim
25 words
A method as claimed in claim 21, wherein in said step (3) the merging of the abutting graphic elements is achieved through a combination operation.
Claim 25
Dependent Claim
24 words
A method as claimed in claim 21, wherein in said step (3) an oversizing factor is used to oversize the flattened hierarchical graphic database.
Claim 26
Dependent Claim
72 words
A method as claimed in claim 23, wherein groups contain graphic elements and wherein in said step (3) the oversizing factor is limited by the following restriction: (coordinate unit×N)/4≦(oversizing distance) ≦(length of the space between two separated graphic elements)/2-(coordinate unit), wherein the "oversizing distance" is an amount of increase in dimension of each graphic element, corresponding to the oversizing factor, and wherein "coordinate unit" means the unit of coordinates of graphic elements.
Claim 27
Dependent Claim
25 words
A method as claimed in claim 23, wherein in said step (4) an undersizing factor is used to undersize the oversized flattened hierarchical graphic database.
Claim 28
Dependent Claim
21 words
A method as claimed in claim 25, wherein in said step (4) the undersizing factor is equal to the oversizing factor.
Claim 29
Dependent Claim
30 words
A method as claimed in claim 26, wherein in said step (5) the gap-filling graphic element is of the same size and referenced to identical absolute coordinates as the gap.
Claim 30
Dependent Claim
32 words
A method as claimed in claim 27, wherein in said step (6) the gap-filling graphic element is put into the target group and referenced to the same absolute coordinates as the gap.
Claim 31
Dependent Claim
46 words
A method as claimed in claim 27, wherein said step (6) includes the step of adding a group as a child group of the target group and incorporating the gap-filling graphic element via the child group so that the target group references the gap-filling graphic element.
References Cited (Backward Citations)
US5416720A
Cited
US5448494A
Cited
US5253182A
Cited
US5283746A
Cited
US5598344A
Cited
US5441834A
Cited
US5493510A
Cited
US5416722A
Cited
US5553274A
Cited
US5629861A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-03-23 | 2001-09-22 | 2002-03-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-03-23 | 2005-09-22 | 2006-03-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-03-23 | 2009-09-22 | 2010-03-24 | $7700.00 | Window Closed / Lapsed |