Data telecommunications system and method for transmitting compressed data

• US 5,027,376 A
• Filed: 05/31/1988
• Issued: 06/25/1991
• Est. Priority Date: 10/30/1985
• Status: Expired due to Term

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Microcom Systems Incorporated
• Inventors: Friedman, Paul, Melhorn, Nathan
• Primary Examiner(s): Safourek, Benedict V.
• Application Number:
  US07/200,626
• Time in Patent Office: 1,120 Days
• Field of Search: 341/65, 341/106, 341/107, 358/133, 358/138, 358/261.1, 358/261.4, 382/56, 370/118, 381/29, 381/31, 375/122
• US Class Current: 375/240
• CPC Class Codes: H03M 7/42 using table look-up for the coding or decoding process, e.g. using read-only memory H03M7/4006 takes precedence

Abstract

Disclosed is a data compressing modem for connection to a decompressing modem over communication lines. The compressing modem receives an input data stream, and each character in the data stream is recodified with a compressed character code, the length of which is dependent on the frequency of the character in the data stream. A frequency table is maintained so that changes in the relative frequency of characters in the data stream will be recognized by the compressing modem and the compressed character codes representing such characters will be exchanged accordingly. A decompressing modem, which is connected over communication lines to the compressing modem, processes the compressed character code in a reverse order from the manner in which the compresing modem processing the codes. The decompressing modem also maintains a relative frequency table and as the relative frequencies of the various characters change, the actual characters represented by the compression codes must also change.

Claims

1. Apparatus for transmitting data in a compressed form between an initiating unit of data terminal equipment and a receiving unit of data terminal equipment connected over communications lines, one of said units having a compressing modem connected between said unit and telephone lines, and the other of said units having a decompressing modem connected between said other unit and telephone lines, said apparatus comprising:

(a) means for fetching a next data character from a data stream to be sent over communication lines;

(b) means for transmitting a compressed character code assigned to said next data character to the decompressing modem;

(c) means for incrementing a relative frequency counter for said next data character;

(d) means for comparing said relative frequency counter for said next data character to a relative frequency counter of a next more frequently occurring character;

(e) means for determining whether the relative frequency of said next data character is greater than the relative frequency of said next more frequently occurring character, and, if so, means for exchanging the compressed character codes assigned to said next data character and to said next more frequently occurring character;

(f) means for repeating the operations of means (d) through (e) until the relative frequency of said next data character is less than the relative frequency of said next more frequently occurring character or said next data character is the most frequent character; and

(g) means for repeating the operations of means (a) through (f) for next data characters and for transmitting said compressed character codes to said decompressing modem.

2. The apparatus for transmitting data in a compressed form of claim 1 further comprising:

(a) means for fetching a next transmitted compressed character code;

(b) means for determining a data character assigned to said next compressed character code;

(c) means for incrementing a relative frequency counter for said determined data character;

(d) means for comparing said relative frequency counter for said data character to a relative frequency counter for a next more frequently occurring data character;

(e) means for determining whether the relative frequency of said data character is greater than the relative frequency of said next more frequently occurring data character, and, if so, means for exchanging said compressed character codes to which said data character and said next more frequently occurring data character are assigned;

(f) means for repeating the operations of means (d) through (e) until the relative frequency of said data character is less than the relative frequency of said next more frequently occurring data character or said data character is the most frequent; and

(g) means for repeating the operations of means (a) through (f) for compressed character codes transmitted to said decompressing modem.

3. The apparatus of claim 1 wherein said compressed character codes are assigned to data characters so that the nth shortest character code is assigned to the nth most frequently occurring data character.

4. The apparatus of claim 1 further comprising:

(a) means for comparing said relative frequency of said next data character to a preset limit; and

(b) means for dividing a relative frequency count of each data character by 2 when said relative frequency of said next data character is greater than said preset limit.

5. The apparatus of claim 1 further comprising:

(a) means for detecting a run of next repeated data characters in said data stream; and

(b) means for transmitting said repeated character and a representation of the number of occurrences in said run of said repeated character.

6. The apparatus of claim 5, wherein said representation is one of said compressed character codes assigned to said data characters.

7. The apparatus of claim 1 herein said compression code has a length indicating header part and a data part and wherein said header part comprises three bits and said data part comprises at least one bit.

8. The apparatus of claim 1 further including memory means for storing a count of the relative frequency of each data character and wherein said memory means comprises a table in a memory storage device, each location in said table corresponding to a unique one of said data characters.

9. The data telecommunications system of claim 1 including memory means for storing a unique compressed character code for each charcter and wherein said memory means comprises a table in a memory storage unit, each location in said table including a unique compressed character code.