A Simple Parallel Algorithm for the Ziv-Lempel Encoding

Ken-ichi IWATA  Masakatu MORII  Tomohiko UYEMATSU  Eiji OKAMOTO  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E81-A   No.4   pp.709-712
Publication Date: 1998/04/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Information Theory and Coding Theory
Keyword: 
parallel encoding,  sliding-window Ziv-Lempel algorithm,  longest-matched string,  universal data compression,  

Full Text: PDF(300.2KB)>>
Buy this Article




Summary: 
Many Ziv-Lempel algorithms have a similar property, that is, slow encoding and fast decoding. This paper proposes a simple improved Ziv-Lempel algorithm to encode a large amount of data quickly as well as compactly by using multiple-processor system.