A Two-level N-ary Tree Based Sequential Data Compression Algorithm

摘要

A universal structure, based on Two-level N-ary tree and suited Jor modifying all existing LZ algorithms, is proposed in this paper. Using this structure can largely limit matching scope and save time accordingly. It is applied to typical LZ algorithm-LZW, the results show that it does approve the encoding and decoding speed for about 40% in most cases.