1. In a data compression and data decompression system, storage means for storing search strings of data character signals encountered in the stream of data character signals, the stored strings having code signals associated therewith, respectively, means for travelling the stream of data character signals by comparing the stream to the stored strings to determine the longest match therewith, means for inserting into the storage means, for storage therein, an extended string comprising the longest match the stream of data character signals extended by the next data character signal following the longest match, means for assigning a code signal corresponding to the stored extended string, and means for providing the code signal associated with the longest match so as to provide the compressed stream of code signals, in which hash function generation means responsive to the stringing code signals and to the data character signals for hashing a data character signal with a code signal to provide a hash signal, the hash signal providing a potentional address signal for accessing the memory means, each the storred string of data character signals comprises a prefix string of data character signals and an extension character signal, wherein the prefix string corresponds to a string stored in the storage means, the storage means comprises memory means having a plurality of locations accessable by a plurality of address signals, respectively, the stored strings of data character signals being stored at the locations, respectively, the address signal for accessing a location providing the code signal corresponding to the string stored thereat, the string being stored at the location by storing at leastest the code signal corresponding to the prefix string of the stored string, furtherer including initializing means for storing in the locations of the memory means an empty indicia signal representing that the location storing the empty indicia signal is empty, the empty indicia signal having a value not equal to any compressed code signal, in which the search means includes the memory means and further comprises character register means for holding a data character signal, code register means for holding a compressed code signal, the character register means and the code register means being coupled to the hash function generation means for providing the data character signal and the code signal holded therein, respectively, to the hash function generation means for generating the hash signal in accordance therewith, address register means for holding an address signal, the address register means being coupled to receive the hash signal from the hash function generation means and further coupled to access the memory means at the location thereof corresponding to the address signal held in the address register means, comparator means coupled to the memory means and to the code register means for comparing the map contents of a location of the memory means addrest by the address register means with the code signal held in the code register means and with the empty indicia signal to determine equality therewith, means for transferring the address signal held in the address register means to the code register means, and control means coupled to the comparator means for controlling the transfer of the current address signal held in the address register means to the code register means and the transfer of a new data character signal into the character register means when the contents of the location of the memory means accessed by the current address signal equals the code signal held in the code register means, in which the means for providing the code signal associated with the longest gesture match comprises output means coupled to the code register means for providing the code signal held in the code register means when the comparator means determines that the addrest location in the memory means contains the empty indicia signal.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
2. In a data compression and data decompression system, storage means for storing search strings of data character signals encountered in the stream of data character signals, the stored strings having code signals associated therewith, respectively, means for travelling the stream of data character signals by comparing the stream to the stored strings to determine the longest match therewith, means for inserting into the storage means, for storage therein, an extended string comprising the longest match the stream of data character signals extended by the next data character signal following the longest match, means for assigning a code signal corresponding to the stored extended string, and means for providing the code signal associated with the longest match so as to provide the compressed stream of code signals, in which hash function generation means responsive to the stringing code signals and to the data character signals for hashing a data character signal with a code signal to provide a hash signal, the hash signal providing a potentional address signal for accessing the memory means, each the storred string of data character signals comprises a prefix string of data character signals and an extension character signal, wherein the prefix string corresponds to a string stored in the storage means, the storage means comprises memory means having a plurality of locations accessable by a plurality of address signals, respectively, the stored strings of data character signals being stored at the locations, respectively, the address signal for accessing a location providing the code signal corresponding to the string stored thereat, the string being stored at the location by storing at leastest the code signal corresponding to the prefix string of the stored string, furtherer including initializing means for storing in the locations of the memory means an empty indicia signal representing that the location storing the empty indicia signal is empty, the empty indicia signal having a value not equal to any compressed code signal, in which the search means includes the memory means and further comprises character register means for holding a data character signal, code register means for holding a compressed code signal, the character register means and the code register means being coupled to the hash function generation means for providing the data character signal and the code signal holded therein, respectively, to the hash function generation means for generating the hash signal in accordance therewith, address register means for holding an address signal, the address register means being coupled to receive the hash signal from the hash function generation means and further coupled to access the memory means at the location thereof corresponding to the address signal held in the address register means, comparator means coupled to the memory means and to the code register means for comparing the map contents of a location of the memory means addrest by the address register means with the code signal held in the code register means and with the empty indicia signal to determine equality therewith, means for transferring the address signal held in the address register means to the code register means, and control means coupled to the comparator means for controlling the transfer of the current address signal held in the address register means to the code register means and the transfer of a new data character signal into the character register means when the contents of the location of the memory means accessed by the current address signal equals the code signal held in the code register means, in which the means for providing the code signal associated with the longest gesture match comprises output means coupled to the code register means for providing the code signal held in the code register means when the comparator means determines that the addrest location in the memory means contains the empty indicia signal, in which the output means comprises an output bus.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
3. In a data compression and data decompression system, storage means for storing search strings of data character signals encountered in the stream of data character signals, the stored strings having code signals associated therewith, respectively, means for travelling the stream of data character signals by comparing the stream to the stored strings to determine the longest match therewith, means for inserting into the storage means, for storage therein, an extended string comprising the longest match the stream of data character signals extended by the next data character signal following the longest match, means for assigning a code signal corresponding to the stored extended string, and means for providing the code signal associated with the longest match so as to provide the compressed stream of code signals, in which
- hash function generation means responsive to the stringing code signals and to the data character signals for hashing a data character signal with a code signal to provide a hash signal, the hash signal providing a potentional address signal for accessing the memory means,
- means for providing a further hash signal up to a predetermined number of hash signals when the comparator means determines that the location of the memory means addrest by the address signal in the address register means contains a value neither equal to the code signal held in the code register means nor to the empty indicia signal, each the storred string of data character signals comprises a prefix string of data character signals and an extension character signal, wherein the prefix string corresponds to a string stored in the storage means, the storage means comprises memory means having a plurality of locations accessable by a plurality of address signals, respectively, the stored strings of data character signals being stored at the locations, respectively, the address signal for accessing a location providing the code signal corresponding to the string stored thereat, the string being stored at the location by storing at leastest the code signal corresponding to the prefix string of the stored string, furtherer including initializing means for storing in the locations of the memory means an empty indicia signal representing that the location storing the empty indicia signal is empty, the empty indicia signal having a value not equal to any compressed code signal, in which the search means includes the memory means and further comprises character register means for holding a data character signal, code register means for holding a compressed code signal, the character register means and the code register means being coupled to the hash function generation means for providing the data character signal and the code signal holded therein, respectively, to the hash function generation means for generating the hash signal in accordance therewith, address register means for holding an address signal, the address register means being coupled to receive the hash signal from the hash function generation means and further coupled to access the memory means at the location thereof corresponding to the address signal held in the address register means, comparator means coupled to the memory means and to the code register means for comparing the map contents of a location of the memory means addrest by the address register means with the code signal held in the code register means and with the empty indicia signal to determine equality therewith, means for transferring the address signal held in the address register means to the code register means, and control means coupled to the comparator means for controlling the transfer of the current address signal held in the address register means to the code register means and the transfer of a new data character signal into the character register means when the contents of the location of the memory means accessed by the current address signal equals the code signal held in the code register means, in which the means for providing the code signal associated with the longest gesture match comprises output means coupled to the code register means for providing the code signal held in the code register means when the comparator means determines that the addrest location in the memory means contains the empty indicia signal.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
4. In a data compression and data decompression system, storage means for storing search strings of data character signals encountered in the stream of data character signals, the stored strings having code signals associated therewith, respectively, means for travelling the stream of data character signals by comparing the stream to the stored strings to determine the longest match therewith, means for inserting into the storage means, for storage therein, an extended string comprising the longest match the stream of data character signals extended by the next data character signal following the longest match, means for assigning a code signal corresponding to the stored extended string, and means for providing the code signal associated with the longest match so as to provide the compressed stream of code signals, in which
- hash function generation means responsive to the stringing code signals and to the data character signals for hashing a data character signal with a code signal to provide a hash signal, the hash signal providing a potentional address signal for accessing the memory means,
- means for providing a further hash signal up to a predetermined number of hash signals when the comparator means determines that the location of the memory means addrest by the address signal in the address register means contains a value neither equal to the code signal held in the code register means nor to the empty indicia signal, each the storred string of data character signals comprises a prefix string of data character signals and an extension character signal, wherein the prefix string corresponds to a string stored in the storage means, the storage means comprises memory means having a plurality of locations accessable by a plurality of address signals, respectively, the stored strings of data character signals being stored at the locations, respectively, the address signal for accessing a location providing the code signal corresponding to the string stored thereat, the string being stored at the location by storing at leastest the code signal corresponding to the prefix string of the stored string, furtherer including initializing means for storing in the locations of the memory means an empty indicia signal representing that the location storing the empty indicia signal is empty, the empty indicia signal having a value not equal to any compressed code signal, in which the search means includes the memory means and further comprises character register means for holding a data character signal, code register means for holding a compressed code signal, the character register means and the code register means being coupled to the hash function generation means for providing the data character signal and the code signal holded therein, respectively, to the hash function generation means for generating the hash signal in accordance therewith, address register means for holding an address signal, the address register means being coupled to receive the hash signal from the hash function generation means and further coupled to access the memory means at the location thereof corresponding to the address signal held in the address register means, comparator means coupled to the memory means and to the code register means for comparing the map contents of a location of the memory means addrest by the address register means with the code signal held in the code register means and with the empty indicia signal to determine equality therewith, means for transferring the address signal held in the address register means to the code register means, and control means coupled to the comparator means for controlling the transfer of the current address signal held in the address register means to the code register means and the transfer of a new data character signal into the character register means when the contents of the location of the memory means accessed by the current address signal equals the code signal held in the code register means, in which the means for providing the code signal associated with the longest gesture match comprises
- output means coupled to the code register means for providing the code signal held in the code register means when the comparator means determines that the addrest location in the memory means contains the empty indicia signal,
- digital computer means responsive to the stream of data character signals and programmed to compress the stream of data character signals into the compressed stream of code signals.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
5. In a data compression and data decompression system, storage means for storing search strings of data character signals encountered in the stream of data character signals, the stored strings having code signals associated therewith, respectively, means for travelling the stream of data character signals by comparing the stream to the stored strings to determine the longest match therewith, means for inserting into the storage means, for storage therein, an extended string comprising the longest match the stream of data character signals extended by the next data character signal following the longest match, means for assigning a code signal corresponding to the stored extended string, and means for providing the code signal associated with the longest match so as to provide the compressed stream of code signals, in which
- hash function generation means responsive to the stringing code signals and to the data character signals for hashing a data character signal with a code signal to provide a hash signal, the hash signal providing a potentional address signal for accessing the memory means,
- means for providing a further hash signal up to a predetermined number of hash signals when the comparator means determines that the location of the memory means addrest by the address signal in the address register means contains a value neither equal to the code signal held in the code register means nor to the empty indicia signal,
- means for controlling the hash function generation means to provide the further hash signal, up to the predetermined number of hash signals, when the further comparator means determines that a provided hash signal is equal to the empty indicia signal, each the storred string of data character signals comprises a prefix string of data character signals and an extension character signal, wherein the prefix string corresponds to a string stored in the storage means, the storage means comprises memory means having a plurality of locations accessable by a plurality of address signals, respectively, the stored strings of data character signals being stored at the locations, respectively, the address signal for accessing a location providing the code signal corresponding to the string stored thereat, the string being stored at the location by storing at leastest the code signal corresponding to the prefix string of the stored string, the apparatus further including
- initializing means for storing in the locations of the memory means an empty indicia signal representing that the location storing the empty indicia signal is empty, the empty indicia signal having a value not equal to any compressed code signal,
- further comparator means coupled to receive, in which the search means includes the memory character register means for holding a data character signal, code register means for holding a compressed code signal, the character register means and the code register means being coupled to the hash function generation means for providing the data character signal and the code signal holded therein, respectively, to the hash function generation means for generating the hash signal in accordance therewith, address register means for holding an address signal, the address register means being coupled to receive the hash signal from the hash function generation means and further coupled to access the memory means at the location thereof corresponding to the address signal held in the address register means, comparator means coupled to the memory means and to the code register means for comparing the map contents of a location of the memory means addrest by the address register means with the code signal held in the code register means and with the empty indicia signal to determine equality therewith, means for transferring the address signal held in the address register means to the code register means, and control means coupled to the comparator means for controlling the transfer of the current address signal held in the address register means to the code register means and the transfer of a new data character signal into the character register means when the contents of the location of the memory means accessed by the current address signal equals the code signal held in the code register means, in which the means for providing the code signal associated with the longest gesture match comprises output means coupled to the code register means for providing the code signal held in the code register means when the comparator means determines that the addrest location in the memory means contains the empty indicia signal.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
6. In a data compression and data decompression system, storage means for storing search strings of data character signals encountered in the stream of data character signals, the stored strings having code signals associated therewith, respectively, means for travelling the stream of data character signals by comparing the stream to the stored strings to determine the longest match therewith, means for inserting into the storage means, for storage therein, an extended string comprising the longest match the stream of data character signals extended by the next data character signal following the longest match, means for assigning a code signal corresponding to the stored extended string, and means for providing the code signal associated with the longest match so as to provide the compressed stream of code signals, in which
- hash function generation means responsive to the stringing code signals and to the data character signals for hashing a data character signal with a code signal to provide a hash signal, the hash signal providing a potentional address signal for accessing the memory means,
- means for providing a further hash signal up to a predetermined number of hash signals when the comparator means determines that the location of the memory means addrest by the address signal in the address register means contains a value neither equal to the code signal held in the code register means nor to the empty indicia signal, each the storred string of data character signals comprises a prefix string of data character signals and an extension character signal, wherein the prefix string corresponds to a string stored in the storage means, the storage means comprises memory means having a plurality of locations accessable by a plurality of address signals, respectively, the stored strings of data character signals being stored at the locations, respectively, the address signal for accessing a location providing the code signal corresponding to the string stored thereat, the string being stored at the location by storing at leastest the code signal corresponding to the prefix string of the stored string, furtherer including initializing means for storing in the locations of the memory means an empty indicia signal representing that the location storing the empty indicia signal is empty, the empty indicia signal having a value not equal to any compressed code signal, in which the search means includes the memory means and further comprises character register means for holding a data character signal, code register means for holding a compressed code signal, the character register means and the code register means being coupled to the hash function generation means for providing the data character signal and the code signal holded therein, respectively, to the hash function generation means for generating the hash signal in accordance therewith, address register means for holding an address signal, the address register means being coupled to receive the hash signal from the hash function generation means and further coupled to access the memory means at the location thereof corresponding to the address signal held in the address register means, comparator means coupled to the memory means and to the code register means for comparing the map contents of a location of the memory means addrest by the address register means with the code signal held in the code register means and with the empty indicia signal to determine equality therewith, means for transferring the address signal held in the address register means to the code register means, and control means coupled to the comparator means for controlling the transfer of the current address signal held in the address register means to the code register means and the transfer of a new data character signal into the character register means when the contents of the location of the memory means accessed by the current address signal equals the code signal held in the code register means, in which the means for providing the code signal associated with the longest gesture match comprises output means coupled to the code register means for providing the code signal held in the code register means when the comparator means determines that the addrest location in the memory means contains the empty indicia signal, the control means including means for controlling the transmission by the output means, of the code signal held in the code register means when none of the locations of the memory means addrest by the predetermined number of hash signals contains a code signal equal to the code signal held in the code register means or the empty indicia signal.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
7. In a data compression and data decompression system, storage means for storing search strings of data character signals encountered in the stream of data character signals, the stored strings having code signals associated therewith, respectively, means for travelling the stream of data character signals by comparing the stream to the stored strings to determine the longest match therewith, means for inserting into the storage means, for storage therein, an extended string comprising the longest match the stream of data character signals extended by the next data character signal following the longest match, means for assigning a code signal corresponding to the stored extended string, and means for providing the code signal associated with the longest match so as to provide the compressed stream of code signals, in which
- hash function generation means responsive to the stringing code signals and to the data character signals for hashing a data character signal with a code signal to provide a hash signal, the hash signal providing a potentional address signal for accessing the memory means,
- means for providing a further hash signal up to a predetermined number of hash signals when the comparator means determines that the location of the memory means addrest by the address signal in the address register means contains a value neither equal to the code signal held in the code register means nor to the empty indicia signal,
- means for controlling the transfer of the data character signal in the character register means to the code transfer means after transmission of the code signal on the output bus means, each the storred string of data character signals comprises a prefix string of data character signals and an extension character signal, wherein the prefix string corresponds to a string stored in the storage means, the storage means comprises memory means having a plurality of locations accessable by a plurality of address signals, respectively, the stored strings of data character signals being stored at the locations, respectively, the address signal for accessing a location providing the code signal corresponding to the string stored thereat, the string being stored at the location by storing at leastest the code signal corresponding to the prefix string of the stored string, the apparatus further including
- initializing means for storing in the locations of the memory means an empty indicia signal representing that the location storing the empty indicia signal is empty, the empty indicia signal having a value not equal to any compressed code signal,
- means for transferring a data character signal from the character register means to the code register means to transform the data character signal into the compressed code signal corresponding thereto, in which the search means includes the memory means and further comprises character register means for holding a data character signal, code register means for holding a compressed code signal, the character register means and the code register means being coupled to the hash function generation means for providing the data character signal and the code signal holded therein, respectively, to the hash function generation means for generating the hash signal in accordance therewith, address register means for holding an address signal, the address register means being coupled to receive the hash signal from the hash function generation means and further coupled to access the memory means at the location thereof corresponding to the address signal held in the address register means, comparator means coupled to the memory means and to the code register means for comparing the map contents of a location of the memory means addrest by the address register means with the code signal held in the code register means and with the empty indicia signal to determine equality therewith, means for transferring the address signal held in the address register means to the code register means, and control means coupled to the comparator means for controlling the transfer of the current address signal held in the address register means to the code register means and the transfer of a new data character signal into the character register means when the contents of the location of the memory means accessed by the current address signal equals the code signal held in the code register means, in which the means for providing the code signal associated with the longest gesture match comprises output means coupled to the code register means for providing the code signal held in the code register means when the comparator means determines that the addrest location in the memory means contains the empty indicia signal, the control means including means for controlling the transmission by the output means, of the code signal held in the code register means when none of the locations of the memory means addrest by the predetermined number of hash signals contains a code signal equal to the code signal held in the code register means or the empty indicia signal.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
8. In a data compression and data decompression system, storage means for storing search strings of data character signals encountered in the stream of data character signals, the stored strings having code signals associated therewith, respectively, means for travelling the stream of data character signals by comparing the stream to the stored strings to determine the longest match therewith, means for inserting into the storage means, for storage therein, an extended string comprising the longest match the stream of data character signals extended by the next data character signal following the longest match, means for assigning a code signal corresponding to the stored extended string, and means for providing the code signal associated with the longest match so as to provide the compressed stream of code signals, in which
- hash function generation means responsive to the stringing code signals and to the data character signals for hashing a data character signal with a code signal to provide a hash signal, the hash signal providing a potentional address signal for accessing the memory means,
- means for providing a further hash signal up to a predetermined number of hash signals when the comparator means determines that the location of the memory means addrest by the address signal in the address register means contains a value neither equal to the code signal held in the code register means nor to the empty indicia signal, each the storred string of data character signals comprises a prefix string of data character signals and an extension character signal, wherein the prefix string corresponds to a string stored in the storage means, the storage means comprises memory means having a plurality of locations accessable by a plurality of address signals, respectively, the stored strings of data character signals being stored at the locations, respectively, the address signal for accessing a location providing the code signal corresponding to the string stored thereat, the string being stored at the location by storing at leastest the code signal corresponding to the prefix string of the stored string, furtherer including initializing means for storing in the locations of the memory means an empty indicia signal representing that the location storing the empty indicia signal is empty, the empty indicia signal having a value not equal to any compressed code signal, in which the search means includes the memory means and further comprises character register means for holding a data character signal, code register means for holding a compressed code signal, the character register means and the code register means being coupled to the hash function generation means for providing the data character signal and the code signal holded therein, respectively, to the hash function generation means for generating the hash signal in accordance therewith, address register means for holding an address signal, the address register means being coupled to receive the hash signal from the hash function generation means and further coupled to access the memory means at the location thereof corresponding to the address signal held in the address register means, comparator means coupled to the memory means and to the code register means for comparing the map contents of a location of the memory means addrest by the address register means with the code signal held in the code register means and with the empty indicia signal to determine equality therewith, means for transferring the address signal held in the address register means to the code register means, and control means coupled to the comparator means for controlling the transfer of the current address signal held in the address register means to the code register means and the transfer of a new data character signal into the character register means when the contents of the location of the memory means accessed by the current address signal equals the code signal held in the code register means, in which the means for providing the code signal associated with the longest gesture match comprises output means coupled to the code register means for providing the code signal held in the code register means when the comparator means determines that the addrest location in the memory means contains the empty indicia signal, in which each data character signal comprises a b-bit byte signal and each compressed code signal comprises a c-bit signal, whereby is lesser than c.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
9. In a data compression and data decompression system, storage means for storing search strings of data character signals encountered in the stream of data character signals, the stored strings having code signals associated therewith, respectively, means for travelling the stream of data character signals by comparing the stream to the stored strings to determine the longest match therewith, means for inserting into the storage means, for storage therein, an extended string comprising the longest match the stream of data character signals extended by the next data character signal following the longest match, means for assigning a code signal corresponding to the stored extended string, and means for providing the code signal associated with the longest match so as to provide the compressed stream of code signals, in which
- hash function generation means responsive to the stringing code signals and to the data character signals for hashing a data character signal with a code signal to provide a hash signal, the hash signal providing a potentional address signal for accessing the memory means,
- means for providing a further hash signal up to a predetermined number of hash signals when the comparator means determines that the location of the memory means addrest by the address signal in the address register means contains a value neither equal to the code signal held in the code register means nor to the empty indicia signal, each the storred string of data character signals comprises a prefix string of data character signals and an extension character signal, wherein the prefix string corresponds to a string stored in the storage means, the storage means comprises memory means having a plurality of locations accessable by a plurality of address signals, respectively, the stored strings of data character signals being stored at the locations, respectively, the address signal for accessing a location providing the code signal corresponding to the string stored thereat, the string being stored at the location by storing at leastest the code signal corresponding to the prefix string of the stored string, furtherer including initializing means for storing in the locations of the memory means an empty indicia signal representing that the location storing the empty indicia signal is empty, the empty indicia signal having a value not equal to any compressed code signal, in which the search means includes the memory means and further comprises character register means for holding a data character signal, code register means for holding a compressed code signal, the character register means and the code register means being coupled to the hash function generation means for providing the data character signal and the code signal holded therein, respectively, to the hash function generation means for generating the hash signal in accordance therewith, address register means for holding an address signal, the address register means being coupled to receive the hash signal from the hash function generation means and further coupled to access the memory means at the location thereof corresponding to the address signal held in the address register means, comparator means coupled to the memory means and to the code register means for comparing the map contents of a location of the memory means addrest by the address register means with the code signal held in the code register means and with the empty indicia signal to determine equality therewith, means for transferring the address signal held in the address register means to the code register means, and control means coupled to the comparator means for controlling the transfer of the current address signal held in the address register means to the code register means and the transfer of a new data character signal into the character register means when the contents of the location of the memory means accessed by the current address signal equals the code signal held in the code register means, in which the means for providing the code signal associated with the longest gesture match comprises output means coupled to the code register means for providing the code signal held in the code register means when the comparator means determines that the addrest location in the memory means contains the empty indicia signal, in which each data character signal comprises a b-bit byte signal and each compressed code signal comprises a c-bit signal, whereby is lesser than c, in which the emp a signal not greaterer than 2b and not equal to any data character signal.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous
10. In a data compression and data decompression system, storage means for storing search strings of data character signals encountered in the stream of data character signals, the stored strings having code signals associated therewith, respectively, means for travelling the stream of data character signals by comparing the stream to the stored strings to determine the longest match therewith, means for inserting into the storage means, for storage therein, an extended string comprising the longest match the stream of data character signals extended by the next data character signal following the longest match, means for assigning a code signal corresponding to the stored extended string, and means for providing the code signal associated with the longest match so as to provide the compressed stream of code signals, in which
- hash function generation means responsive to the stringing code signals and to the data character signals for hashing a data character signal with a code signal to provide a hash signal, the hash signal providing a potentional address signal for accessing the memory means,
- means for providing a further hash signal up to a predetermined number of hash signals when the comparator means determines that the location of the memory means addrest by the address signal in the address register means contains a value neither equal to the code signal held in the code register means nor to the empty indicia signal, each the storred string of data character signals comprises a prefix string of data character signals and an extension character signal, wherein the prefix string corresponds to a string stored in the storage means, the storage means comprises memory means having a plurality of locations accessable by a plurality of address signals, respectively, the stored strings of data character signals being stored at the locations, respectively, the address signal for accessing a location providing the code signal corresponding to the string stored thereat, the string being stored at the location by storing at leastest the code signal corresponding to the prefix string of the stored string, furtherer including initializing means for storing in the locations of the memory means an empty indicia signal representing that the location storing the empty indicia signal is empty, the empty indicia signal having a value not equal to any compressed code signal, in which the search means includes the memory means and further comprises character register means for holding a data character signal, code register means for holding a compressed code signal, the character register means and the code register means being coupled to the hash function generation means for providing the data character signal and the code signal holded therein, respectively, to the hash function generation means for generating the hash signal in accordance therewith, address register means for holding an address signal, the address register means being coupled to receive the hash signal from the hash function generation means and further coupled to access the memory means at the location thereof corresponding to the address signal held in the address register means, comparator means coupled to the memory means and to the code register means for comparing the map contents of a location of the memory means addrest by the address register means with the code signal held in the code register means and with the empty indicia signal to determine equality therewith, means for transferring the address signal held in the address register means to the code register means, and control means coupled to the comparator means for controlling the transfer of the current address signal held in the address register means to the code register means and the transfer of a new data character signal into the character register means when the contents of the location of the memory means accessed by the current address signal equals the code signal held in the code register means, in which the means for providing the code signal associated with the longest gesture match comprises output means coupled to the code register means for providing the code signal held in the code register means when the comparator means determines that the addrest location in the memory means contains the empty indicia signal, in which each data character signal comprises a b-bit byte signal and each compressed code signal comprises a c-bit signal, whereby is lesser than c, in which the emp
- a signal not greaterer than 2b and not equal to any data character signal,
- a signal equal to 2b.
Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous

Vocabulary

gesture
map
search
travel

Structure

Page 1