Parallel Lempel Ziv Coding

Authors:
Shmuel T. Klein;Yair Wiseman
Affiliations:
-;-
Venue:
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Year:
2001

Citing 5
Cited 0

Parallel algorithms for data compression

Journal of the ACM (JACM)
Constructing Huffman Trees in Parallel

SIAM Journal on Computing
Data compression via textual substitution

Journal of the ACM (JACM)
Parallel Huffman Decoding

DCC '00 Proceedings of the Conference on Data Compression
A Technique for High-Performance Data Compression

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore the possibility of using multiple processors to improve the encoding and decoding tasks of Lempel Ziv schemes. A new layout of the processors is suggested and it is shown how LZSS and LZW can be adapted to take advantage of such parallel architectures. Experimental results show an improvement in compression and time over standard methods.