Abstract: A feature coordination interface between the Operating System (OS) and a Special Purpose Processor (SPP) in a computer system. Both the OS and SPP maintain a list of bit masks, identified by word numbers, where an associated bit is set in an associated bit mask if the OS or SPP supports a feature identified by the bit. During initialization, the OS transfers each of its bit masks to the SPP whereat features are compared. In response, the SPP sends each of its corresponding bit masks back to the OS together with an error indication if the OS does not support a feature required by the SPP. The OS compares its features with those of the SPP and enters an error shutdown process if the OS has received an error indication from the SPP or if the SPP does not support a feature required by the OS.

Abstract: A matrix of single input OR-gates correspond to respective codes to be assigned to strings. The inputs of the OR-gates are coupled to respective outputs of a code decoder that is responsive to a fetched input code. The locations of a character and level table, respectively accessible by the code decoder outputs, store the extension characters of extended strings recorded in the decompressor. Outputs of OR-gates are selectively coupled to code decoder outputs through a matrix switch to sequentially couple OR-gate outputs to OR-gate inputs so that the characters of a string corresponding to the input code are provided from accessed locations of the table. An update extended string is recorded by coupling the output of the OR-gate corresponding to the next assignable code to the code decoder output corresponding to the previously received code. The first character of the string corresponding to the current code is stored in the table location accessible by the next assignable code.

Abstract: A matrix of AND-gates correspond to respective codes to be assigned to strings. The outputs of the AND-gates are selectively coupled to prefix code inputs of the AND-gates through a prefix code matrix switch. A plurality of characters from the input stream are fetched into an input character buffer and applied through respective character decoders and selectively through a character matrix switch to character inputs of the AND-gates. An AND-gate-corresponding to a code assigned to a string that is the longest match to the plurality of fetched characters is thereby enabled. Update extended strings are recorded in the AND-gates, an extended string comprising a longest matching string extended by the data character following the longest matching string. A virtual level is assigned to an AND-gate indicative of the number of characters of the string recorded thereby, the virtual level being one greater than the level that had been assigned to the AND-gate corresponding to the longest match.

Abstract: A matrix of AND-gates correspond to respective codes to be assigned to strings. The outputs of the AND-gates are selectively coupled to prefix code inputs of the AND-gates through a prefix code matrix switch. A plurality of characters from the input stream are fetched into an input character buffer and applied through respective character decoders and selectively through a character matrix switch to character inputs of the AND-gates. An AND-gate corresponding to a code assigned to a string that is the longest match to the plurality of fetched characters is thereby enabled. An update extended string is recorded in the AND-gate corresponding to the next code to be assigned by coupling, through the prefix code matrix switch, the output of the AND-gate corresponding to the longest matching string to the prefix code input of the AND-gate corresponding to the next code to be assigned.

Abstract: The disclosed compressor 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. The input data character stream is searched by comparing the input stream to the stored strings to determine the longest match therewith. The code associated with the longest match is outputted so as to provide the output stream of compressed codes. The stored strings are updated by inserting an extended string into the prefix tables, the extended string comprising the longest match extended by the next data character in the input stream following the longest match, the extended string being stored in the prefix table corresponding to the code of the longest match, a code being assigned to the extended string.

Abstract: A data compressor for compressing an input stream of data characters into an output stream of compressed codes includes a plurality of AND-gates corresponding to a respective plurality of codes to be assigned to strings. Each string comprises a prefix string, having an associated prefix code, and an extension character. An AND-gate has a prefix code input and a character input for enabling the AND-gate, the energized output of an AND-gate providing a representation of the code corresponding thereto. The compressor includes a first matrix switch for selectively coupling the provided representations of codes corresponding to the AND-gates to the prefix code inputs of the AND-gates and a second matrix switch for selectively coupling representations of data characters fetched from the input stream to the character inputs of the AND-gates.

Abstract: A data compressor includes a plurality of tandem coupled stages, each stage comprising a matrix of AND-gates and a matrix switch. An AND-gate has inputs responsive, respectively, to a representation of a prefix code and a representation of a character for energizing the AND-gate output. The AND-gate outputs are coupled, respectively, to the inputs of the matrix switch and the matrix switch outputs have respective string codes assigned thereto. The matrix switch is controllable for coupling any one of the matrix switch inputs to a selected one of the matrix switch outputs. Energization of an AND-gate output coupled to a matrix switch output provides a representation of the code assigned thereto. The provided representations of codes assigned to the AND-gates of a stage are coupled to the prefix code inputs of the AND-gates of the next following stage.

Abstract: The data compressor utilizes a plurality of subdictionaries arranged in levels for storing strings of data characters. The subdictionary at the first level stores two character strings and a subdictionary at a subsequent level stores strings that are one character longer than the strings stored in the subdictionary at the level prior thereto. A plurality of data characters are fetched from the input into an input buffer and applied to the respective levels. The subdictionary at a level is searched for the string comprising the string matched at the prior level extended by the fetched character applied to the level. The string code of a string matched at a level is cascaded to the next level. The longest match with the fetched characters is determined by one of the fetched characters resulting in a mismatch at one of the levels. The string code associated with the longest match is output.

Abstract: A data decompressor for decompressing an input stream of compressed codes to recover an output stream of data characters corresponding thereto. A plurality of character tables corresponding to respective characters store strings of data characters, the stored strings having respective string codes associated therewith. A string comprises a prefix string of at least one character followed by an extension character. A string is stored in the character tables by storing the code associated with the string prefix in the character table corresponding to the string extension character at a character table location corresponding to the string code of the string. The character tables are accessed with a currently received compressed code so as to recover a string corresponding thereto and the characters of the recovered string are output.

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.

Abstract: The data compressor utilizes a plurality of character tables arranged in levels for storing strings of data characters, the character tables corresponding to respective characters of the alphabet. A string is stored by storing the string code associated with the string in a character table corresponding to the extension character of the string in a location of the character table corresponding to the code of the string prefix. The character tables at the first level store 2-character strings and the character tables at a subsequent level store strings that are one character longer than the strings stored in the character tables at the level prior thereto.

Abstract: A data compressor includes a matrix of AND-gates corresponding to a respective plurality of strings. An AND-gate has inputs responsive, respectively, to a representation of a prefix code and a representation of a fetched character for energizing the AND-gate output. The AND-gate outputs are coupled, respectively, to the inputs of a matrix switch and the matrix switch outputs have respective string codes assigned thereto. The matrix switch is controllable for coupling any one of the matrix switch inputs to a selected one of the matrix switch outputs. Energization of an AND-gate output coupled to a matrix switch output provides a representation of the code assigned thereto. A prefix decoder responsive to the provided representations of codes assigned to the matrix switch outputs provides decoder outputs to the prefix code inputs of the AND-gates. A character decoder responsive to fetched characters provides decoder outputs to the character inputs of the AND-gates.

Abstract: An LZW compressor implementation architecture utilizes a plurality of limited length character tables corresponding to the respective characters of the alphabet. A string is stored by storing the code associated with the string in the character table corresponding to the extension character of the string at a character table location corresponding to the code of the string prefix. A character table is created when the character corresponding thereto is first encountered in the input. The input data character stream is searched by comparing the input stream to the stored strings to determine longest matches therewith. The codes associated with the longest matched strings are outputted so as to provide an output stream of compressed codes. The respective lengths of the character tables are limited in accordance with the frequency of occurrence of the characters of the alphabet.

Abstract: A decompressor recovers and outputs a stream of data characters corresponding to an input stream of compressed codes. The decompressor includes a dictionary that stores strings of data characters having respective codes associated therewith. A currently received compressed code accesses the dictionary to recover a string and the decompressor outputs the characters of the recovered string so as to provide the output stream of data characters. An extended string is inserted into the dictionary that comprises the string corresponding to the previously received code extended by the first character of the recovered string. A code is assigned to the stored extended string. The decompressor maintains counts of inserted extended strings that have the same extension character for respective characters of the alphabet.

Abstract: A new LZW compressor implementation architecture utilizes a plurality of character tables corresponding to the respective characters of the alphabet. A string is stored by storing the code associated with the string in the character table corresponding to the extension character of the string at a character table location corresponding to the code of the string prefix. A search for the longest matching string is performed by determining if the character table location is empty corresponding to the code of the currently matched string in the character table associated with the currently fetched character. 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.

Abstract: A new LZW compressor implementation architecture utilizes a plurality of limited length character tables corresponding to the respective characters of the alphabet. A string is stored by storing the code associated with the string in the character table corresponding to the extension character of the string at a character table location corresponding to the code of the string prefix. A character table is created when the character corresponding thereto is first encountered in the input. The input data character stream is searched by comparing the input stream to the stored strings to determine longest matches therewith. The codes associated with the longest matched strings are outputted so as to provide an output stream of compressed codes. The respective lengths of the character tables are limited in accordance with the frequency of occurrence of the characters of the alphabet.

Abstract: A data compression and decompression system based on the LZW data compression and decompression methodology that includes exclusion tables for storing strings that are infrequently encountered. If an extended string formed for updating the compressor and decompressor dictionaries is included in the exclusion tables, the extended string is not stored and the code counter for assigning codes to dictionary strings is not advanced. In this manner, dictionary codes are not usurped by infrequently encountered strings. The exclusion tables are dynamically modified in accordance with the input data by deleting strings from the exclusion tables that are frequently encountered therein and by adding infrequently encountered strings to the exclusion tables.

Abstract: A data compression and decompression system based on the LZW data compression and decompression methodology that includes exclusion tables storing strings that are infrequently encountered. If an extended string formed for updating the compressor and decompressor dictionaries is included in the exclusion tables, the extended string is not stored and the code counter for assigning codes to dictionary strings is not advanced. In this manner, dictionary codes are not usurped by infrequently encountered strings.

Abstract: In a data compressor, the input stream of data characters is formed into one or more data character groupings where each grouping comprises a predetermined number of the data characters (grouped character) followed by one or more of the input data characters. The formed input is compared to similarly configured stored strings until a longest match is determined. Each stored string has a code associated therewith and the code of the longest match is output by the compressor. An extended string is stored comprising the longest match extended by the data character that caused the mismatch. A next compression cycle begins with a grouped character comprising the data character that caused the mismatch concatenated by one less than the predetermined number of the next following data characters. In one embodiment, data character strings comprise an initial grouped character followed by as many data characters as can be matched.

Abstract: The disclosed data compressor receives an input stream of data characters and provides a corresponding stream of output codes. The compressor generates a sequence of numerically increasing output codes corresponding to numerically increasing contiguous segments of a detected run of the same data character. Non-run characters of the input stream are transmitted directly in synchronism with incrementing the codes of the code sequence. In one embodiment, the number of characters in the run segments are stored together with the respective codes representing the segments. In later encounters of a previously processed run, the stored data is accessed and the stored codes corresponding to the run segments are output as appropriate.