US5249134A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of layout processing including layout data verification
Assignee: Panasonic Holdings Corp
•
Filing: 1991-12-18
•
Granted: 1993-09-28
•
Expires: 2011-12-18
Abstract
Abstract A method of processing layout data of an integrated circuit including several circuit blocks and inter-block routing among the circuit blocks on data verification. The method includes the steps of processing layout data within at least one of the circuit blocks and replacing the layout data within that circuit block with layout data in a peripheral neighborhood region of that circuit block to process the replaced layout data.
Inventors
- 👤 Akihisa Oka
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 08:43
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/39; G06F30/398; H; H10; H10D; H10D89/00; H10D89/10
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
149 words
A computer implemented method requiring reduced data storage capacity for processing layout data of an integrated circuit, the circuit including a plurality of circuit blocks and inter-block routing among said plurality of circuit blocks, comprising the steps of: using a computer to perform a design rule check for layout data for at least one but not all of said plurality of circuit blocks; using a computer to replace the layout data for said at least one circuit block by replacement internal routing layout data for a peripheral neighborhood region of said at least one circuit block; and using a computer to process said inter-block routing and said replacement internal routing layout data by performing said design rule check thereon, whereby a smaller amount of memory is required in the computer than required for performing the design rule check for layout data for all of said plurality of circuit blocks.
Claim 2
Dependent Claim
149 words
A computer implemented method requiring reduced data storage capacity for processing layout data of an integrated circuit, the circuit including a plurality of circuit blocks and inter-block routing among said plurality of circuit blocks, comprising the steps of: using a computer to perform a design rule check for layout data for at least one but not all of said plurality of circuit blocks; using a computer to replace the layout data for said at least one circuit block by replacement internal routing layout data for a peripheral neighborhood region of said at least one circuit block; and using a computer to process said inter-block routing and said replacement internal routing layout data by performing said design rule check thereon, whereby a smaller amount of memory is required in the computer than required for performing the design rule check for layout data for all of said plurality of circuit blocks.
Claim 3
Dependent Claim
73 words
A computer implemented method of processing layout data as claimed in claim 1, wherein said step of using a computer to process said inter-block routing and said replacement internal routing layout data comprises using the computer to perform a layout design rule check for said inter-block routing data and for said replacement internal routing layout data, thereby reducing an amount of memory required for the layout design rule check for the integrated circuit.
Claim 4
Dependent Claim
118 words
A computer implemented method of processing layout data as claimed in claim 1, comprising the further step of performing a frame-cut operation after said step of using the computer to perform a design rule check for the layout data of said at least one of said plurality of circuit blocks, and wherein said step of using the computer to replace the layout data for said at least one circuit block by replacement internal routing layout data for a peripheral neighborhood region comprises replacing the layout data for said at least one circuit block by frame data corresponding to the layout data in peripheral regions within a minimum line-width of a periphery of said at least one circuit block.
Claim 5
Dependent Claim
73 words
A computer implemented method of processing layout data as claimed in claim 3, wherein said step of using a computer to process said inter-block routing and said replacement internal routing layout data comprises using the computer to perform a layout design rule check for said inter-block routing data and for said replacement internal routing layout data, thereby reducing an amount of memory required for the layout design rule check for the integrated circuit.
Claim 6
Dependent Claim
36 words
A computer implemented method of processing layout data as claimed in claim 1, wherein said replacement internal routing layout data for the peripheral neighborhood region is data within a minimum line width from said inter-block routing.
Claim 7
Dependent Claim
88 words
A computer implemented method of processing layout data as claimed in claim 1, comprising the further steps of: using a computer to perform a design rule check for layout data for another of said plurality of circuit blocks; using a computer to replace the layout data for said another circuit block by replacement internal routing layout data for a peripheral neighborhood region of said another circuit block; and using a computer to process said inter-block routing and said replacement internal routing layout data for said another circuit block.
Claim 8
Dependent Claim
144 words
A computer implemented method requiring reduced data storage capacity for processing layout data of an integrated circuit, the circuit including a plurality of circuit blocks and inter-block routing among said plurality of circuit blocks, comprising the steps of: using a computer to perform a design rule check for layout data for said plurality of circuit blocks; then using a computer to replace the layout data for at least one of said plurality of circuit blocks by replacement internal routing layout data for only a peripheral neighborhood region of said at least one circuit block; and using a computer to process said inter-block routing and said replacement internal routing layout data, whereby a smaller amount of memory is required in the computer than required for performing the design rule check for layout data for all of said plurality of circuit blocks and said inter-block routing.
Claim 9
Dependent Claim
144 words
A computer implemented method requiring reduced data storage capacity for processing layout data of an integrated circuit, the circuit including a plurality of circuit blocks and inter-block routing among said plurality of circuit blocks, comprising the steps of: using a computer to perform a design rule check for layout data for said plurality of circuit blocks; then using a computer to replace the layout data for at least one of said plurality of circuit blocks by replacement internal routing layout data for only a peripheral neighborhood region of said at least one circuit block; and using a computer to process said inter-block routing and said replacement internal routing layout data, whereby a smaller amount of memory is required in the computer than required for performing the design rule check for layout data for all of said plurality of circuit blocks and said inter-block routing.
Claim 10
Dependent Claim
73 words
A computer implemented method of processing layout data as claimed in claim 7, wherein said step of using a computer to process said inter-block routing and said replacement internal routing layout data comprises using the computer to perform a layout design rule check for said inter-block routing data and for said replacement internal routing layout data, thereby reducing an amount of memory required for the layout design rule check for the integrated circuit.
Claim 11
Dependent Claim
107 words
A computer implemented method of processing layout data as claimed in claim 7, comprising the further step of performing a frame-cut operation after said step of using the computer to perform a design rule check for the layout data for said plurality of circuit blocks, and wherein said step of using the computer to replace the layout data for said at least one circuit block by replacement internal routing layout data for a peripheral neighborhood region comprises replacing the layout data for said at least one circuit block by frame data corresponding to the layout data in peripheral neighborhood regions of said at least one circuit block.
Claim 12
Dependent Claim
73 words
A computer implemented method of processing layout data as claimed in claim 9, wherein said step of using a computer to process said inter-block routing and said replacement internal routing layout data comprises using the computer to perform a layout design rule check for said inter-block routing data and for said replacement internal routing layout data, thereby reducing an amount of memory required for the layout design rule check for the integrated circuit.
Claim 13
Dependent Claim
36 words
A computer implemented method of processing layout data as claimed in claim 7, wherein said replacement internal routing layout data for the peripheral neighborhood region is data within a minimum line width from said inter-block routing.
Claim 14
Dependent Claim
71 words
A computer implemented method of processing layout data as claimed in claim 7, comprising the further steps of: using a computer to replace the layout data for another of said plurality of circuit blocks by replacement internal routing layout data for a peripheral neighborhood region of said another circuit block; and using a computer to process said inter-block routing and said replacement internal routing layout data for said another circuit block.
Claim 15
Dependent Claim
157 words
A computer implemented method requiring reduced data storage capacity for layout design rule check of an integrated circuit, said circuit including a plurality of circuit blocks and inter-block routing among said plurality of circuit blocks, comprising the steps of: using a computer to perform a layout design rule check for layout data for at least one but not all of said plurality of circuit blocks; using a computer to replace the layout data for said at least one circuit block by replacement internal routing layout data for a peripheral neighborhood region of said at least one circuit block within a minimum line width from said inter-block routing; and using a computer to perform the layout design rule check for said inter-block routing and said replacement internal routing layout data, thereby reducing an amount of memory required for performing the layout design rule check for all of said circuit blocks of the integrated circuit and the inter-block routing.
Claim 16
Dependent Claim
157 words
A computer implemented method requiring reduced data storage capacity for layout design rule check of an integrated circuit, said circuit including a plurality of circuit blocks and inter-block routing among said plurality of circuit blocks, comprising the steps of: using a computer to perform a layout design rule check for layout data for at least one but not all of said plurality of circuit blocks; using a computer to replace the layout data for said at least one circuit block by replacement internal routing layout data for a peripheral neighborhood region of said at least one circuit block within a minimum line width from said inter-block routing; and using a computer to perform the layout design rule check for said inter-block routing and said replacement internal routing layout data, thereby reducing an amount of memory required for performing the layout design rule check for all of said circuit blocks of the integrated circuit and the inter-block routing.
Claim 17
Dependent Claim
113 words
A computer implemented method of processing layout data as claimed in claim 13, comprising the further step of performing a frame-cut operation after said step of using the computer to perform a layout design rule check for the layout data for said at least one of said plurality of circuit blocks, and wherein said step of using the computer to replace the layout data for said at least one circuit block by replacement internal routing layout data for a peripheral neighborhood region comprises replacing the layout data for said at least one circuit block by frame data corresponding to the layout data in peripheral neighborhood regions of said at least one circuit block.
Claim 18
Dependent Claim
112 words
A computer implemented method of processing layout data as claimed in claim 13, comprising the further steps of: using a computer to perform a layout design rule check for layout data for another of said plurality of circuit blocks; using a computer to replace the layout data for said another circuit block by replacement internal routing layout data for a peripheral neighborhood region of said another circuit block within a minimum line width of said inter-block routing from a periphery of said another circuit block; and using a computer to perform a layout design rule check for said inter-block routing and said replacement internal routing layout data of said another circuit block.
References Cited (Backward Citations)
US4613940A
Cited
US4600995A
Cited
US4630219A
Cited
US4635208A
Cited
US4829446A
Cited
US4910680A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-09-27 | 1997-03-29 | 1997-09-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-09-27 | 2001-03-29 | 2001-09-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-09-27 | 2005-03-29 | 2005-09-28 | $7700.00 | Window Closed / Lapsed |