US4706264A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Digital data compression method and means
Assignee: CHUNG TELECOMMINCATIONS A CA CORP
•
Filing: 1983-06-22
•
Granted: 1987-11-10
•
Expires: 2003-06-22
Abstract
Abstract A system for compressing digital data maintains a code table of plaintext symbols at a transmitting location. Blocks of plaintext symbols in a message are encoded using the code table which table is updated using an update algorithm. The codes for those blocks are transmitted to a receiving location where a second code table is maintained. At the receiving location, the transmitted symbols are decoded using that second code table. That code table is also updated by applying to the plaintext symbols recovered during the decoding process the same update algorithm used at the transmitting location so that the two code tables are the same at any given point in the transmission.
Inventors
- 👤 David Cung
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 14:58
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
182 words
The method of compressing a digital data stream composed of plaintext symbols comprising the steps of A. maintaining a code table of plaintext symbols at a transmitting location; B. encoding blocks of plaintext symbols in the stream using said code table to produce codes for said blocks; C. updating said code table according to an update algorithm; D. transmitting the codes for said blocks plus only plaintext symbols in blocks not previously encoded to a receiving location; E. maintaining a code table at the receiving location; F. decoding the transmitted codes for said blocks using the code table at the receiving location to recover plaintext symbols in the data stream; and G. updating the receiving location code table by applying to the plaintext symbols received from the transmitting location the same update algorithm used at the transmitting location so that the two code tables remain identical whereby the coded symbol blocks in the transmission can be decoded continuously at the receiving location without requiring the separate transmission of codes for said not previously encoded blocks to update the receiving location code table.
Claim 2
Independent Claim
182 words
The method of compressing a digital data stream composed of plaintext symbols comprising the steps of A. maintaining a code table of plaintext symbols at a transmitting location; B. encoding blocks of plaintext symbols in the stream using said code table to produce codes for said blocks; C. updating said code table according to an update algorithm; D. transmitting the codes for said blocks plus only plaintext symbols in blocks not previously encoded to a receiving location; E. maintaining a code table at the receiving location; F. decoding the transmitted codes for said blocks using the code table at the receiving location to recover plaintext symbols in the data stream; and G. updating the receiving location code table by applying to the plaintext symbols received from the transmitting location the same update algorithm used at the transmitting location so that the two code tables remain identical whereby the coded symbol blocks in the transmission can be decoded continuously at the receiving location without requiring the separate transmission of codes for said not previously encoded blocks to update the receiving location code table.
Claim 3
Dependent Claim
33 words
The method defined in claim 1 and including the additional step of updating the code tables in accordance with the frequencies of occurrence of the various plaintext symbol blocks in the data stream.
Claim 4
Dependent Claim
39 words
The method defined in claim 1 wherein the maintaining of each code table is accomplished by storing said plaintext symbol blocks in a memory whose memory locations are defined by said codes and plaintext symbols representing the data stream.
Claim 5
Dependent Claim
148 words
The method defined in claim 3 wherein the transmitting step is controlled so that A. if a plaintext symbol in the data stream is transmitted, the next block of plaintext symbols in the data stream is transmitted in code if that block is found in a memory location whose address comprises that plaintext symbol; otherwise the next plaintext symbol in the data stream is transmitted; B. if a plaintext symbol in the data stream is at the end of a block of plaintext symbols transmitted in code, the next block is transmitted in code if it is found in a memory location adressed by that plaintext symbol; otherwise the next plaintext symbol in the data stream is transmitted; and C. if a plaintext symbol in the data stream is in a block transmitted in code but it is not at the end of that block, nothing is transmitted.
Claim 6
Dependent Claim
26 words
The method defined in claim 1 and including the additional step of preloading both code tables with identical plaintext symbols prior to commencement of the transmission.
Claim 7
Independent Claim
190 words
A system for compressing a digital data stream composed of plaintext symbols comprising A. means defining a code table of plaintext symbols at a transmitting location; B. means for encoding blocks of plaintext symbols in the stream using said code table to produce codes for said blocks; C. means for updating said table according to an update algorithm; D. means for transmitting the codes for said blocks plus only plaintext symbols in blocks not previously encoded to a receiving location; E. means defining a code table at the receiving location; F. means for decoding the transmitted codes for said blocks using the code table at the receiving location to recover plaintext symbols in the data stream; and G. means for updating the receiving location code table by applying to the plaintext symbols received from the transmitting location the same update algorithm used at the transmitting location so that the two code tables remain identical whereby the coded symbol blocks in the transmission can be decoded continuously at the receiving location without requiring the separate transmission of codes for said not previously encoded blocks to update the receiving location code table.
Claim 8
Independent Claim
190 words
A system for compressing a digital data stream composed of plaintext symbols comprising A. means defining a code table of plaintext symbols at a transmitting location; B. means for encoding blocks of plaintext symbols in the stream using said code table to produce codes for said blocks; C. means for updating said table according to an update algorithm; D. means for transmitting the codes for said blocks plus only plaintext symbols in blocks not previously encoded to a receiving location; E. means defining a code table at the receiving location; F. means for decoding the transmitted codes for said blocks using the code table at the receiving location to recover plaintext symbols in the data stream; and G. means for updating the receiving location code table by applying to the plaintext symbols received from the transmitting location the same update algorithm used at the transmitting location so that the two code tables remain identical whereby the coded symbol blocks in the transmission can be decoded continuously at the receiving location without requiring the separate transmission of codes for said not previously encoded blocks to update the receiving location code table.
Claim 9
Dependent Claim
33 words
The system defined in claim 6 and further including means for controlling the updating means so that the code tables contain the more commonly occurring blocks of plaintext symbols in the data stream.
Claim 10
Dependent Claim
23 words
The system defined in claim 6 wherein both said code tables have identical plaintext symbol contents prior to the beginning of the transmission.
Claim 11
Dependent Claim
25 words
The system defined in claim 6 wherein each code table defining means comprise a memory addressed by codes and plaintext symbols representing the data stream.
Claim 12
Dependent Claim
156 words
The system defined in claim 9 wherein the transmitting means transmit said codes in accordance with the following algorithm: A. if the pIaintext symbol in the data stream is transmitted, the next block of plaintext symbols in the data stream is transmitted in code if that block is found in a memory location whose address comprises that plaintext symbol; otherwise the next plaintext symbol in the data stream is transmitted; B. if a plaintext symbol in the data stream is at the end of a block of plaintext symbols transmitted in code, the next block is transmitted in code if it is found in a memory location addressed by that plaintext symbol; otherwise the next plaintext symbol in the data stream is transmitted; and C. if a plaintext symbol in the data stream is in a block of plaintext symbols transmitted in code but it is not at the end of a block, nothing is transmitted.
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) | 1990-11-09 | 1991-05-11 | 1991-11-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-11-09 | 1995-05-11 | 1995-11-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-11-09 | 1999-05-11 | 1999-11-10 | $7700.00 | Window Closed / Lapsed |