| 摘要 |
<p>A prior string match array compressor stores a history of a number of previous bytes, compares all of them with the current byte to find matches, and determines the length of the longest matched string and the displacement between the current string and the stored string. A string to be compressed had to be a minimum length of two bytes. To be used in a system where the minimum length is three, the current and next bytes must be tested. on the same cycle. This circuit accomplishes this while using only one comparator per cell by using the comparator to test the next byte, using a delay line to compare the current and next bytes to generate a current match, and uses the current match and the initialize signal in a logic circuit to generate the displacement signal. If there was no match in any cell on the previous cycle, the output is the previous match AND the current match. If there was a match on any cell, the output is the previous cell displacement signal AND the current match. <IMAGE></p> |
