BSTW Data Compression with PPM

スポンサーリンク

概要

• 論文の詳細を見る

• Algorithm BSTW developed by Bentley, Sleator, Tarjam and Wei is one of the most efficient data compression algorithms. This algorithm takes an advantage of locality of reference, the tendency of words to occur frequently for a short period of time and then fall into long period of disuse. The scheme is based on a self organizing list, for maintaining code table. PPM (Prediction by Partial Matching) in conjunction with Arithmetic coding, first investigated by Cleary and Written and later modified and implemented by Moffat had been also reported of high performance data compression. The algorithm bias probabilities assigned tosymbols according to the immediately preceeding text.In this paper we propose the using of BSTW's idea andemploy PPM to fomulate adaptive data compression model.

• 一般社団法人情報処理学会の論文
• 1992-02-24

著者

• WONGSAWANG Damras

  Shinshu University

• Okamoto Masayuki

  Shinshu University

関連論文

• Predictive Text Compression with Self-Organizing List
• The Zero-Frequency Problem in Predictive Self-Organizing Lists Data Compression
• BSTW Data Compression with PPM

スポンサーリンク