Importance

Loading Importance Indicators...

Abstract

A new LZW compressor implementation architecture utilizes a plurality of prefix tables corresponding to respective prefix codes. A string is stored by storing the code associated with the string in a prefix table corresponding to the code of the string prefix at a prefix table location corresponding to the extension character of the string. A search for the longest matching string is performed by determining if the prefix table location is empty corresponding to the currently fetched character in the prefix table associated with the code of the currently matched string. If the location is not empty, it is storing the code of the string comprising the currently matched string extended by the currently fetched character. This string code is used as the next match with which to continue the search with the next fetched character. When the location is empty, the longest match has been determined to be the currently matched string. The stored strings are updated by storing the next available string code in the empty location.

Loading the Abstract Image...

First Claim