TY - JOUR
T1 - Parallel Lempel Ziv coding
AU - Klein, Shmuel Tomi
AU - Wiseman, Yair
PY - 2005/3/1
Y1 - 2005/3/1
N2 - 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.
AB - 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.
KW - Data compression
KW - Lempel-Ziv algorithms
KW - Parallel algorithms
UR - http://www.scopus.com/inward/record.url?scp=11844269849&partnerID=8YFLogxK
U2 - 10.1016/j.dam.2004.04.013
DO - 10.1016/j.dam.2004.04.013
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:11844269849
SN - 0166-218X
VL - 146
SP - 180
EP - 191
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 2
ER -