Apparatus for compressing data using a Lempel-Ziv-type algorithm
First Claim
1. A data compression apparatus for identifying repeated data element strings in a data stream having a plurality of data elements comprising:
- a history buffer for concurrently storing a plurality of the data elements in separately addressable locations, each data element being stored at an addressable location;
an input means for inputting a current data element;
a plurality of comparison means, each for comparing said current data element with the content of a stored data element then stored in a corresponding addressable location in said history buffer, said plurality of comparison means being operative to generate an output identifying all existing matches between said current data element and all stored data elements;
a plurality of logic means, each for receiving the corresponding output of one of said comparison means and for generating a signal identifying the existence of a string of at least two data elements; and
an encoder responsive to said signals from said plurality of logic means for generating a first output comprising an address identifying a repeated data element string and a second output indicating the existence of a repeated data element string within said history buffer.
0 Assignments
0 Petitions
Accused Products
Abstract
A data processing system having a compression and decompression apparatus based on the Lempel-Ziv algorithm. The compression apparatus includes an array section having a circular history CAM unit for receiving and storing one or more data elements and a coding unit for determining whether received data elements previously have been stored in the history CAM unit and are a candidate for compression. If a received data element matches at least one of the stored data elements, a PS logic section determines whether there is the presence of a string. An encoding section identifies the address of the matching stored data element in a string and the length of the string. The compression apparatus generates a compression token comprising an identification of whether a data element is compressed, the length of the coded data within a plurality of predetermined data length categories and an address. The compression apparatus uses a particular hardware implementation of the PS logic section.
-
Citations
11 Claims
-
1. A data compression apparatus for identifying repeated data element strings in a data stream having a plurality of data elements comprising:
-
a history buffer for concurrently storing a plurality of the data elements in separately addressable locations, each data element being stored at an addressable location; an input means for inputting a current data element; a plurality of comparison means, each for comparing said current data element with the content of a stored data element then stored in a corresponding addressable location in said history buffer, said plurality of comparison means being operative to generate an output identifying all existing matches between said current data element and all stored data elements; a plurality of logic means, each for receiving the corresponding output of one of said comparison means and for generating a signal identifying the existence of a string of at least two data elements; and an encoder responsive to said signals from said plurality of logic means for generating a first output comprising an address identifying a repeated data element string and a second output indicating the existence of a repeated data element string within said history buffer. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
Specification