Abstract: Apparatus for parsing and tokenizing a data stream comprises: a storage component to store a history buffer containing an unencoded version of a previously encoded string; a comparison component to compare a string from the input data stream with the unencoded version of at least one previously encoded string; a second storage component store: an indicator that at least two matches were found by the first comparison component, and tokens corresponding to the matches; a summing component to sum potential token lengths to provide total potential token lengths; a second comparison component to compare total potential token lengths; a selection component to select a match corresponding to a shortest total token length to represent the string from said input data stream; and an emitting component for emitting tokens representing the match corresponding to the shortest total token length. The tokens may be used in, for example, compression or encryption.

Abstract: A method (300) and arrangement for LZ1 compression of a data string where multiple input symbols are compared in parallel with the history buffer by: holding in an input buffer (140) a first sequence of bytes of the data string; holding in a history buffer (110, 120) a second sequence of bytes of the data string; comparing (170), in matrix comparison means coupled to the input buffer and the history buffer and having a plurality of rows and columns of comparison units (200), bytes held in the input buffer with bytes held in the history buffer, bytes of the history buffer being coupled to diagonally displaced comparison units in the matrix comparison means; detecting (150) in each of the rows the column in which a largest number of consecutive byte matches has occurred at the comparison unit in that row and preceding comparison units in the same column; and encoding (160) as a token a sequence of matched bytes detected in the step of detecting (150).

Abstract: An apparatus for performing data compression is disclosed. A circuit (640) within a comparison unit (400) of a comparison matrix (170) performs LZ1 compression of a data string by comparing bytes held in an input buffer (140) with bytes held in a history buffer (110, 120). A group of logic gate stages (720, 730, 740, 750) is connected in series with each other. Each of the logic gate stages produces a carry value that is passed to one of the output of the comparison unit and another logic gate stages. The product of the number stages in the logic gate stages and the number logic gates in each of the logic gate stages is less than the number of logic gates required for an equivalent circuit having a single logic circuit stage.

Abstract: Apparatus for parsing and tokenizing a data stream comprises: a storage component to store a history buffer containing an unencoded version of a previously encoded string; a comparison component to compare a string from the input data stream with the unencoded version of at least one previously encoded string; a second storage component store: an indicator that at least two matches were found by the first comparison component, and tokens corresponding to the matches; a summing component to sum potential token lengths to provide total potential token lengths; a second comparison component to compare total potential token lengths; a selection component to select a match corresponding to a shortest total token length to represent the string from said input data stream; and an emitting component for emitting tokens representing the match corresponding to the shortest total token length. The tokens may be used in, for example, compression or encryption.

Abstract: A method and arrangement are described for decompressing three or more bytes per processor cycle from a stream of compressed data using a processing pipeline, in which the compressed data is represented by tokens of varying and unknown length by accepting as input the stream of token data, partially decoding a token from the token data to determine a boundary position of the token; and priming the processing pipeline with the token and a length marker indicating the boundary position. Literal data is detected and output directly, copy pointers are checked to find their targets and resolved either from the history buffer or from the in-process contents of the pipeline.

Abstract: A method and arrangement are described for decompressing three or more bytes per processor cycle from a stream of compressed data using a processing pipeline, in which the compressed data is represented by tokens of varying and unknown length by accepting as input the stream of token data, partially decoding a token from the token data to determine a boundary position of the token; and priming the processing pipeline with the token and a length marker indicating the boundary position. Literal data is detected and output directly, copy pointers are checked to find their targets and resolved either from the history buffer or from the in-process contents of the pipeline.

Abstract: A video subsystem for a computer system comprising a video adapter and a video monitor electrically communicating over a display cable having at least two monitor identification lines. The three system components are designed such that after the video adapter reads the monitor identification from the monitor identification lines, the adapter and monitor reuse the monitor identification lines as a bidirectional serial link, over which large amounts and types of data may be transferred.