Lossless Compression Performance of a Simple Counter- Based Entropy Coder  

Oleh:

Langi, Armein Z. R.

Jenis: Article from Journal - ilmiah nasional - terakreditasi DIKTI
Dalam koleksi: Journal of ICT Research and Applications vol. 5C no. 3 (2011), page 177-188.
Topik: Entropy Coder; Counter-Based Coder; Loss-less Compression; Rice Coders
Fulltext: 4_Thom.pdf (367.83KB)

Isi artikel

This paper describes the performance of a simple counter based entropy coder, as compared to other entropy coders, especially Huffman coder. Loss-less data compression, such as Huffman coder and arithmetic coder, are designed to perform well over a wide range of data entropy. As a result, the coders require significant computational resources that could be the bottleneck of a compression implementation performance. In contrast, counter-based coders are designed to be optimal on a limited entropy range only. This paper shows the encoding and decoding process of counter-based coder can be simple and fast, very suitable for hardware and software implementations. It also reports that the performance of the designed coder is comparable to that of a much more complex Huffman coder.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali