Parallel Lempel Ziv coding

Shmuel Tomi Klein, Yair Wiseman

Research output: Contribution to journalArticlepeer-review


We explore the possibility of using multiple processors to improve the encoding and decoding times of Lempel-Ziv 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.

Original languageEnglish
Pages (from-to)180-191
Number of pages12
JournalDiscrete Applied Mathematics
Issue number2
StatePublished - 1 Mar 2005
Externally publishedYes


  • Data compression
  • Lempel-Ziv algorithms
  • Parallel algorithms


Dive into the research topics of 'Parallel Lempel Ziv coding'. Together they form a unique fingerprint.

Cite this