Parallel Lempel Ziv coding
We explore the possibility of using multiple processors to improve the encoding and decoding times of LempelZiv schemes. A new layout of the processors, based on a full binary tree, is suggested and it is shown how LZSS and LZW can be adapted to take advantage of such parallel architectures. The layout is then generalized to higher order trees. Experimental results show an improvement in compression over the standard method of parallelization and an improvement in time over the sequential method.
data compression lempelziv algorithms parallel algorithms