Data compression apparatus and method

• US 5,126,739 A
• Filed: 11/27/1990
• Issued: 06/30/1992
• Est. Priority Date: 01/13/1989
• Status: Expired due to Fees

• Current Assignee: Hifn, Inc. (Maxlinear Incorporated)
• Original Assignee: Stac Electronics
• Inventors: Whiting, Douglas L., Ivey, Glen E., George, Glen A.
• Primary Examiner(s): Deboer, Todd E.
• Assistant Examiner(s): Logan, Sharon D.
• Application Number:
  US07/619,295
• Time in Patent Office: 581 Days
• Field of Search: 341/106, 341/67, 341/51, 364/200
• US Class Current: 341/106
• CPC Class Codes: G06T 9/005 Statistical coding, e.g. Huffman, run length coding
• CPC Class Codes: H03M 7/3086 employing a sliding window, e.g. LZ77
• CPC Class Codes: H03M 7/40 Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
• CPC Class Codes: H03M 7/46 Conversion to or from run-length codes, i.e. by representing the number of consecutive digits, or groups of digits, of the same kind by a code word and a digit indicative of that kind

Abstract

An apparatus and method as disclosed for converting an input data character stream into a variable length encoded data stream in a data compression system. The data compression system includes a history array means. The history array means has a plurality of entries and each entry of the history array means is for storing a portion of the input data stream. The method for converting the input data character stream includes the following steps. Performing a search in a history array means for the longest data string which matches the input data string. If the matching data string is found within the history buffer means, the next step includes encoding the longest matching data string found by appending to the encoded data stream a tag indicating the longest matching data string was found and a string substitution code. If the matching data string is not found within the history array means, the next step includes encoding the first character of the input data string by appending to the encoded data stream a raw data tag indicating that no matching data string was found and the first character of the input data string.

Claims

1. A data compression system comprising:

a history array means, said history array means having a plurality of entries, said entries of said history array means for storing an input data stream,

a history array pointer, said history array pointer pointing to one of said entries in said history array means,

a hash table means having a plurality of entries, each entry of said hash table means for storing a pointer indicating one of said entries of said history array means, and

an offset array means, said offset array means having a plurality of entries, and each entry of said offset array means providing a link, if any, from one of said entries in said history array means to one or more other entries of said history array means.

2. The apparatus of claim 1 further including means for incrementing said history array pointer to the next entry in said history array means and means for hashing the next data characters of said input data stream.

3. The apparatus of claim 1 or 2 wherein said apparatus further includes means for periodically examining the pointer stored at each said hash table entry for determining whether said pointer at said hash table entry differs from said history array pointer by a predetermined amount.

4. The apparatus of claim 3 wherein said means further includes means for replacing said entry in said hash table by an invalid value, thereby reinitializing said entry.

5. The apparatus of claim 4 further including:

means for initializing said hash table by replacing all entries of said hash table by invalid values.

6. A method for compressing data in a data compression system which includes a history array means, said history array means having a plurality of entries, a history array pointer, a hash table means, said hash table means having a plurality of entries, and an offset array means, said offset array means having a plurality of entries, said method comprising the steps of:

storing an input data stream in said entries of said history array means,

pointing to one of said entries in said history array means by said history array pointer,

storing a pointer indicating one of said entries of said history array means in each entry of said hash table means, and

providing a link by each entry of said offset array means from one of said entries in said history array means to one or more other entries of said history array means.

7. The method of claim 6 further including the steps of incrementing said history array pointer to the next entry in said history array means and hashing the next data characters of said input data stream.

8. The method of claim 6 or 7 further including the step of periodically examining the pointer stored at each said hash table entry for determining whether said pointer at said hash table entry differs from said history array pointer by a predetermined pointer.

9. The method of claim 8 further including the step of replacing said entry in said hash table by an invalid value, thereby reinitializing said entry.

10. The method of claim 9 further including the step of:

initializing said hash table by replacing all entries of said hash table by invalid values.