US5406280A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data retrieval system using compression scheme especially for serial data stream
Assignee: Commerce Clearing House Inc
•
Filing: 1993-08-26
•
Granted: 1995-04-11
•
Expires: 2013-08-26
Abstract
Abstract A data retrieval system using a compression scheme especially for serial transmission, which does not inadvertently generate typical flow control codes, such as ASCII values less than 32. A personal computer with a modem is used to access a remote mainframe database. Retrieved data is compressed according to the scheme and transmitted over telephone lines. Compression is achieved by encoding a compressed byte pair in place of a recurring sequence of data longer than two bytes. The byte pair contains information as to the length and offset into the transmitted packet of a previous occurrence of the recurring sequence, so that it may be copied from previously received bytes. The length and offset are stored in the byte pair such that neither byte has an ASCII value typical of those used for controlling modems.
Inventors
- 👤 Douglas N. Cogan
- 👤 Burkhardt T. Hufnagel
- 👤 Yan Gu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 18:18
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/46; G; G06; G06T; G06T9/00; G06T9/005; H03M7/3084; H03M7/3086
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
141 words
A method for compressing a recurring sequence of three or more text codes in a data packet to be serially transmitted which does not inadvertently generate typical flow control codes, comprising the steps of: obtaining the offset into the packet of a previous occurrence of the recurring sequence, obtaining the length of the recurring sequence, setting the highest bit of a first compressed byte to one, storing the highest seven bits of said offset to the lowest seven bits of said first compressed byte, storing the lowest four bits of said offset to the lowest four bits of a second compressed byte, storing said length in the four highest bits of said second compressed byte, and transmitting in place of the recurring sequence said first and second compressed bytes at an offset into a transmitted serial data stream representing said packet.
Claim 2
Independent Claim
141 words
A method for compressing a recurring sequence of three or more text codes in a data packet to be serially transmitted which does not inadvertently generate typical flow control codes, comprising the steps of: obtaining the offset into the packet of a previous occurrence of the recurring sequence, obtaining the length of the recurring sequence, setting the highest bit of a first compressed byte to one, storing the highest seven bits of said offset to the lowest seven bits of said first compressed byte, storing the lowest four bits of said offset to the lowest four bits of a second compressed byte, storing said length in the four highest bits of said second compressed byte, and transmitting in place of the recurring sequence said first and second compressed bytes at an offset into a transmitted serial data stream representing said packet.
Claim 3
Dependent Claim
23 words
A method according to claim 1, comprising the additional step of subtracting a value of two from said length before storing said length.
Claim 4
Dependent Claim
23 words
A method according to claim 1, comprising the additional step of subtracting a value of one from said length before storing said length.
Claim 5
Dependent Claim
196 words
A data retrieval system for retrieving a packet of compressed data from a remote database via a serial transmission line and decompressing the data, comprising: a serial transceiver for transmitting search requests to and receiving compressed data in packets from a remote computer having a database, a memory buffer for storing decompressed data from one of said received packets, a comparator for testing the highest bit of each byte of data in a packet received by said transceiver, and indicating that a first byte and a second, following byte of data are to be decompressed when the highest bit is one, means disposed to receive said first byte and said second, following byte, when said comparator indicates they are to be decompressed, for decompressing said first and second bytes by concatenating the seven lowest bits of said first byte with the four lowest bits of said second byte to provide an offset address into said buffer, and using the four highest bits of said second byte to provide the number of bytes to be copied from said buffer starting at said offset address, and writing the copied bytes to the next available location in said buffer.
Claim 6
Dependent Claim
196 words
A data retrieval system for retrieving a packet of compressed data from a remote database via a serial transmission line and decompressing the data, comprising: a serial transceiver for transmitting search requests to and receiving compressed data in packets from a remote computer having a database, a memory buffer for storing decompressed data from one of said received packets, a comparator for testing the highest bit of each byte of data in a packet received by said transceiver, and indicating that a first byte and a second, following byte of data are to be decompressed when the highest bit is one, means disposed to receive said first byte and said second, following byte, when said comparator indicates they are to be decompressed, for decompressing said first and second bytes by concatenating the seven lowest bits of said first byte with the four lowest bits of said second byte to provide an offset address into said buffer, and using the four highest bits of said second byte to provide the number of bytes to be copied from said buffer starting at said offset address, and writing the copied bytes to the next available location in said buffer.
Claim 7
Dependent Claim
40 words
A system according to claim 4, wherein said means is further disposed to add the value of two to the four highest bits to provide the number of bytes to be copied from said buffer starting at said offset address.
Claim 8
Dependent Claim
40 words
A system according to claim 4, wherein said means is further disposed to add the value of one to the four highest bits to provide the number of bytes to be copied from said buffer starting at said offset address.
Claim 9
Independent Claim
152 words
A method for decompressing a packet of data received over a serial transmission line, comprising the steps of: decompressing a first byte in conjunction with a second, following byte, comprising a compressed byte pair, if the highest bit of said first byte is one, by: concatenating the lowest seven bits of said first byte with the lowest four bits of said second byte to provide an offset into the memory buffer, adding a length modification value to the highest four bits of said second byte to provide a number of bytes to be copied, and copying said number of bytes starting from the offset in said memory buffer; writing said copied bytes to the next available location in a memory buffer; and writing a received byte without changes to said memory buffer if the highest bit is zero, and the preceding received byte is a first byte of a compressed byte pair.
Claim 10
Independent Claim
152 words
A method for decompressing a packet of data received over a serial transmission line, comprising the steps of: decompressing a first byte in conjunction with a second, following byte, comprising a compressed byte pair, if the highest bit of said first byte is one, by: concatenating the lowest seven bits of said first byte with the lowest four bits of said second byte to provide an offset into the memory buffer, adding a length modification value to the highest four bits of said second byte to provide a number of bytes to be copied, and copying said number of bytes starting from the offset in said memory buffer; writing said copied bytes to the next available location in a memory buffer; and writing a received byte without changes to said memory buffer if the highest bit is zero, and the preceding received byte is a first byte of a compressed byte pair.
Claim 11
Dependent Claim
13 words
A method according to claim 7, wherein said length modification value is two.
Claim 12
Dependent Claim
13 words
A method according to claim 7, wherein said length modification value is one.
Claim 13
Independent Claim
149 words
A method for compressing a recurring sequence of three or more text codes in a data packet to be serially transmitted which does not inadvertently generate typical flow control codes, comprising the steps of: obtaining the offset into the packet of a previous occurrence of the recurring sequence, obtaining the length of the recurring sequence, setting the highest bit of a first compressed data word to one, storing a highest portion of said offset to the lowest corresponding number of bits of said first compressed data word, storing a lowest, remaining portion of said offset to the lowest corresponding number of bits of a second compressed data word, storing said length in the remaining highest bits of said second compressed data word, and transmitting in place of the recurring sequence said first and second compressed data words at an offset into a transmitted serial data stream representing said packet.
Claim 14
Independent Claim
149 words
A method for compressing a recurring sequence of three or more text codes in a data packet to be serially transmitted which does not inadvertently generate typical flow control codes, comprising the steps of: obtaining the offset into the packet of a previous occurrence of the recurring sequence, obtaining the length of the recurring sequence, setting the highest bit of a first compressed data word to one, storing a highest portion of said offset to the lowest corresponding number of bits of said first compressed data word, storing a lowest, remaining portion of said offset to the lowest corresponding number of bits of a second compressed data word, storing said length in the remaining highest bits of said second compressed data word, and transmitting in place of the recurring sequence said first and second compressed data words at an offset into a transmitted serial data stream representing said packet.
Claim 15
Dependent Claim
23 words
A method according to claim 10, comprising the additional step of subtracting a value of two from said length before storing said length.
Claim 16
Dependent Claim
23 words
A method according to claim 10, comprising the additional step of subtracting a value of one from said length before storing said length.
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) | 1998-04-10 | 1998-10-10 | 1999-04-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-04-10 | 2002-10-10 | 2003-04-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-04-10 | 2006-10-10 | 2007-04-11 | $7700.00 | Window Closed / Lapsed |