A simple parallel algorithm for the ziv-lempel encoding

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E81-A, Issue 4, 1998, Pages 709-712

  Iwata, Ken Ichi ^a   Morh, Masakatu ^a,c   Uyematsu, Tomohiko ^b,c   Okamoto, Eiji ^a,b,c  

^a UNIVERSITY OF TOKUSHIMA   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^c JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Longest matched string; Parallel encoding; Sliding window Ziv Lempel algorithm; Universal data compression

Indexed keywords

DATA COMPRESSION; DECODING; ENCODING (SYMBOLS); PARALLEL PROCESSING SYSTEMS;

ZIV-LEMPEL ALGORITHMS;

PARALLEL ALGORITHMS;

EID: 0032050005     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. Inf. Theory, vol.IT-23, no.3, pp.337-343, May 1977.
2. T.C. Bell, J.G. Cleary, and I.H. Witten, Text Compression, Prentice Hall, Englewood Cliffs, 1990.
3. T. Uyematsu, Introduction to Text Compression Algorithm, CQ pub. co., Tokyo, 1994.
4. A.D. Wyner and J. Ziv, The sliding-window Lempel-Ziv algorithm is asymptotically optimal, Proc. IEEE, vol.82, no.6, pp.872-877, June 1994.
5. P.E. Bender and J.K. Wolf, New asymptotic bounds and improvements on the Lempel-Ziv data compression algorithm, IEEE Trans. Inf. Theory, vol.IT-37, no.3, pp.721729, May 1991.
6. M.E. Gonzalez Smith and J.A. Storer, Parallel algorithms for data compression, J. ACM, vol.32, no.2, pp.344-373, April 1985.