New source coding method based on LZW adopting the least recently used deletion heuristic

Sadataka Hayashi, Jun ichi Kubo, Takaya Yamazato, Iwao Sasase

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we proposed a new source coding method based on Lempel-Ziv-Welch(LZW) method. Our proposed method assigns variable-length codewords instead of LZW's fixed-length codewords. Proposed method has a Least-Recently-Used(LRU) deletion heuristic queuing buffer whose each entry has a different parsed string. The queuing buffer is sorted on the rule of Move-to-Front(MTF) for each time of encoding/decoding. Proposed coding rule is that in the shallower entry of the queuing buffer a parsed string is, the shorter length of codeword is assigned for it. In result, proposed method yields better performance of compression ratio without losing the characteristics of LZW.

Original languageEnglish
Title of host publicationIEEE Pac Rim Conf Commun Comput Signal Process
PublisherPubl by IEEE
Pages190-193
Number of pages4
ISBN (Print)0780312198
Publication statusPublished - 1993 Jan 1
EventProceedings of the IEEE 1993 Pacific Rim Conference on Communications, Computers and Signal Processing - Victoria, BC, Can
Duration: 1993 May 191993 May 21

Publication series

NameIEEE Pac Rim Conf Commun Comput Signal Process

Other

OtherProceedings of the IEEE 1993 Pacific Rim Conference on Communications, Computers and Signal Processing
CityVictoria, BC, Can
Period93/5/1993/5/21

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'New source coding method based on LZW adopting the least recently used deletion heuristic'. Together they form a unique fingerprint.

Cite this