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

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

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトルIEEE Pac Rim Conf Commun Comput Signal Process
出版社Publ by IEEE
ページ190-193
ページ数4
ISBN(印刷版)0780312198
出版ステータスPublished - 1993 1 1
イベントProceedings of the IEEE 1993 Pacific Rim Conference on Communications, Computers and Signal Processing - Victoria, BC, Can
継続期間: 1993 5 191993 5 21

出版物シリーズ

名前IEEE 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

フィンガープリント 「New source coding method based on LZW adopting the least recently used deletion heuristic」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル