Patent US5530645A successfully refreshed from Google Patents.
US5530645A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Composite dictionary compression system
Assignee: Apple Inc
•
Filing: 1993-06-30
•
Granted: 1996-06-25
•
Expires: 2013-06-30
Abstract
Abstract A composite dictionary data compression process for use with a computer system comprising the steps of: receiving into the computer system an uncompressed input data string; searching a composite dictionary to detect for a dictionary data string matching the uncompressed input data string, the composite dictionary comprising a fixed dictionary and an adaptive dictionary; and modifying the adaptive dictionary in response to whether a matching dictionary data string is detected.
Inventors
- 👤 Ke-Chiang Chu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 05:24
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/3084; H03M7/3088; G; G06; G06T; G06T9/00; G06T9/005; H03M7/3086
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
69 words
A composite dictionary data compression process for use with a computer system comprising the steps of: receiving into the computer system an uncompressed input data string; searching a composite dictionary to detect a dictionary data string matching the uncompressed input data string, the composite dictionary comprising a fixed dictionary and an adaptive dictionary; and modifying the adaptive dictionary in response to whether a matching dictionary data string is detected.
Claim 2
Dependent Claim
69 words
A composite dictionary data compression process for use with a computer system comprising the steps of: receiving into the computer system an uncompressed input data string; searching a composite dictionary to detect a dictionary data string matching the uncompressed input data string, the composite dictionary comprising a fixed dictionary and an adaptive dictionary; and modifying the adaptive dictionary in response to whether a matching dictionary data string is detected.
Claim 3
Dependent Claim
41 words
A composite dictionary data compression process of claim 1 wherein the step of modifying the adaptive dictionary further comprises adding a new dictionary entry to the adaptive dictionary if a matching dictionary data string is not detected in the composite dictionary.
Claim 4
Dependent Claim
35 words
A composite dictionary data compression process of claim 2, wherein if a matching dictionary data string is not detected, the uncompressed input data string is inserted into an output data buffer as a literal string.
Claim 5
Dependent Claim
29 words
A composite dictionary data compression process of claim 2, wherein if a matching dictionary data string is detected, a corresponding address locator is inserted into an output data buffer.
Claim 6
Dependent Claim
89 words
A composite dictionary data compression process of claim 1 further comprising a decompression process, the decompression process comprising the steps of: loading the computer system with the fixed dictionary; initializing the adaptive dictionary; detecting a compressed input data entry to decompress in a compressed input data buffer; detecting if the compressed input data entry corresponds to stored data in the composite dictionary, and if the compressed input data entry is detected to correspond to stored data in the composite dictionary, then retrieving the stored data from the composite dictionary.
Claim 7
Dependent Claim
41 words
A composite dictionary data compression process of claim 5 wherein the step of retrieving the stored data from the composite dictionary further comprises using the compressed data entry as an address locator to find the stored data in the composite dictionary.
Claim 8
Dependent Claim
52 words
A composite dictionary data compression process of claim 5 wherein in response to detecting that the compressed data entry does not correspond to stored data from the composite dictionary, then the decompression process further comprises copying a literal data string from the compressed input data buffer to a decompressed output data buffer.
Claim 9
Dependent Claim
37 words
A composite dictionary data compression process of claim 7 further comprising the step of updating the composite dictionary in response to detecting that the compressed data entry does not correspond to stored data from the composite dictionary.
Claim 10
Dependent Claim
34 words
A composite dictionary data compression process of claim 8 wherein the step of updating the composite dictionary further comprises copying the literal data string from the compressed input data buffer to the composite dictionary.
Claim 11
Dependent Claim
101 words
A composite dictionary data compression process for use with a computer system, the compression process comprising the steps of: initiating a composite dictionary, the composite dictionary comprising a fixed dictionary and an adaptive dictionary, wherein the step of initiating the composite dictionary comprises loading the fixed dictionary with a set of predefined data entries and resetting the adaptive dictionary; receiving into the computer system an uncompressed input data string; searching the composite dictionary to detect a dictionary data string matching the uncompressed input data string; and modifying the composite dictionary in response to whether a matching dictionary data string is detected.
Claim 12
Dependent Claim
101 words
A composite dictionary data compression process for use with a computer system, the compression process comprising the steps of: initiating a composite dictionary, the composite dictionary comprising a fixed dictionary and an adaptive dictionary, wherein the step of initiating the composite dictionary comprises loading the fixed dictionary with a set of predefined data entries and resetting the adaptive dictionary; receiving into the computer system an uncompressed input data string; searching the composite dictionary to detect a dictionary data string matching the uncompressed input data string; and modifying the composite dictionary in response to whether a matching dictionary data string is detected.
Claim 13
Dependent Claim
43 words
A composite dictionary data compression process of claim 10 wherein modifying the composite dictionary further comprises: creating a dictionary entry in the adaptive dictionary for the uncompressed input data string in response to not detecting a matching data string in the composite dictionary.
Claim 14
Dependent Claim
72 words
A composite dictionary data compression process of claim 10 further comprising a composite dictionary data decompression process, the data decompression process comprising the steps of: loading a plurality of application dependent dictionary entries into the fixed dictionary; resetting the adaptive dictionary; detecting whether an input data buffer contains at least one compressed input data entry; decompressing the contents of the input data buffer in response to detecting a compressed input data entry.
Claim 15
Dependent Claim
71 words
A composite dictionary data compression process of claim 12 wherein the step of decompressing further comprises: detecting whether the compressed input data entry comprises a literal data string; wherein in response to not detecting a literal data string, then retrieving a matching dictionary data string from the composite dictionary, and wherein in response to detecting a literal data string, then storing the literal data string into the decompressed data output buffer.
Claim 16
Dependent Claim
23 words
A composite dictionary data compression process of claim 13 further comprising updating the composite dictionary in response to detecting the literal data string.
Claim 17
Dependent Claim
52 words
A composite dictionary data compression process of claim 14 wherein the step of updating the composite dictionary in response to detecting the literal data string further comprises: detecting whether the adaptive dictionary is full; wherein if the adaptive dictionary is not full, then storing the literal data string in the adaptive dictionary.
Claim 18
Dependent Claim
30 words
A composite dictionary data compression of claim 15 wherein if the adaptive dictionary is full, then replacing an old dictionary entry from the adaptive dictionary with the literal data string.
Claim 19
Independent Claim
137 words
A method for compressing data in a computer system, the method comprising the steps of: retrieving a plurality of stored dictionary entries into a fixed dictionary; performing the following steps for each input data string in a stream of input data strings: searching a composite dictionary for a dictionary entry that matches the input data string, the composite dictionary comprising the fixed dictionary and an adaptive dictionary; if a dictionary entry that corresponds to the input data string is found, then transmitting an address locator that identifies the dictionary entry that corresponds to the input data string; if a dictionary entry that corresponds to the input data string is not found, then transmitting the input data string as a literal string; and adding a dictionary entry that corresponds to the input data string to the adaptive dictionary.
Claim 20
Independent Claim
137 words
A method for compressing data in a computer system, the method comprising the steps of: retrieving a plurality of stored dictionary entries into a fixed dictionary; performing the following steps for each input data string in a stream of input data strings: searching a composite dictionary for a dictionary entry that matches the input data string, the composite dictionary comprising the fixed dictionary and an adaptive dictionary; if a dictionary entry that corresponds to the input data string is found, then transmitting an address locator that identifies the dictionary entry that corresponds to the input data string; if a dictionary entry that corresponds to the input data string is not found, then transmitting the input data string as a literal string; and adding a dictionary entry that corresponds to the input data string to the adaptive dictionary.
Claim 21
Dependent Claim
35 words
The method for compressing data of claim 17 wherein said step of retrieving a plurality of stored dictionary entries comprises retrieving a plurality of stored dictionary entries that are associated with a particular software application.
References Cited (Backward Citations)
US4588302A
Cited
US4843389A
Cited
US4876541A
Cited
US4881075A
Cited
US5016009A
Cited
US5109433A
Cited
US5298895A
Cited
US5410671A
Cited
US5333313A
Cited
US5179378A
Cited
US5155484A
Cited
US5175543A
Cited
US5373290A
Cited
US5243341A
Cited
US5442350A
Cited
US5323155A
Cited
US5455576A
Cited
US5389922A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-06-25 | 1999-12-25 | 2000-06-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-06-25 | 2003-12-25 | 2004-06-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-06-25 | 2007-12-25 | 2008-06-25 | $7700.00 | Window Closed / Lapsed |