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