US5216726A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data compression process
Assignee: UNITED SILICON STRUCTURES Inc 1971 CONCOURSE DR SAN JOSE CA95131 A CORP OF CA
•
Filing: 1990-03-23
•
Granted: 1993-06-01
•
Expires: 2010-03-23
Abstract
Abstract A process for compressing data describing the layout of integrated circuits so that the layout information can be readily communicated over conventional telephone lines at substantially increased speeds and, hence, at substantially reduced cost. As applied to integrated circuits that have been designed with computer-aided design (CAD) methods, the process includes the steps of assigning unique tokens to describe selected geometrical attributes of sets of polygonal shapes, which tokens ordinarily are less than a single byte of binary information. For example, a token can be used to signify that the x-direction coordinates of a second polygon are all spaced from respective ones of the x-direction coordinates of a first polygon by the given distance.
Inventors
- 👤 Robert J. Heaton
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 19:59
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/20
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
115 words
A process for compressing data relating to polygonal shapes within layouts of integrated circuits with the source and uncompressed data being functionally identical, comprising the steps of: receiving input data in the format of polygonal shapes; and assigning unique tokens to describe selected geometrical attributes of successive identical sets of irregular polygonal shapes, which tokens ordinarily serve to compress the data by expressing geometrical distance relationships between identical polygonal shapes within a given set and, ordinarily, are less than a single byte of binary information and less than all of the vertices in the polygonal shapes, wherein the assigning step and, therefore, data compression step is accomplished based upon other polygonal shapes within the set.
Claim 2
Dependent Claim
115 words
A process for compressing data relating to polygonal shapes within layouts of integrated circuits with the source and uncompressed data being functionally identical, comprising the steps of: receiving input data in the format of polygonal shapes; and assigning unique tokens to describe selected geometrical attributes of successive identical sets of irregular polygonal shapes, which tokens ordinarily serve to compress the data by expressing geometrical distance relationships between identical polygonal shapes within a given set and, ordinarily, are less than a single byte of binary information and less than all of the vertices in the polygonal shapes, wherein the assigning step and, therefore, data compression step is accomplished based upon other polygonal shapes within the set.
Claim 3
Dependent Claim
39 words
A process according to claim 1 wherein a token is used to signify that the x-direction coordinates of a second polygon are all spaced from respective ones of the x-direction coordinates of a first polygon by a predetermined distance.
Claim 4
Dependent Claim
35 words
A process according to claim 2 wherein the same token is used to signify that the y-direction coordinates of the second polygon are equal to respective ones of the y-direction coordinates of the first polygon.
Claim 5
Dependent Claim
50 words
A process according to claim 1 further wherein, if there is constant x-direction displacement between corresponding ones of the vertices of a second polygon and the vertices of a first polygon, the location and shape of a third polygon relative to the second polygon is described by a single token.
Claim 6
Dependent Claim
37 words
A process according to claim 4 further wherein the location and shape of the third polygon is described without explicitly designating the distance that separates its vertices from respective ones of the vertices of the second polygon.
Claim 7
Dependent Claim
28 words
A process according to claim 1 further comprising the steps of introducing token values in the sets of numbers that represent the vertices of polygons for eliminating redundancy.
Claim 8
Dependent Claim
35 words
A process according to claim 1 further comprising the step of describing relative distances between vertices of polygonal shapes in integrated circuit layouts rather than the distances between the vertices and a common origin point.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-05-31 | 1996-11-30 | 1997-06-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-05-31 | 2000-11-30 | 2001-06-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-05-31 | 2004-11-30 | 2005-06-01 | $7700.00 | Window Closed / Lapsed |