DOI Number : 10.5614/itbj.ict.2011.5.3.2
Hits : 2

Lossless Compression Performance of a Simple Counter-Based Entropy Coder

Armein Z R Langi1,2

1ITB Research Center on Information and Communication Technology
2Information Technology RG, School of Electrical Engineering and Informatics
Institut Teknologi Bandung, Jalan Ganeca 10, Bandung, 40116, Indonesia

Abstract. This paper describes the performance of a simple counter based entropy coder, as compared to other entropy coders, especially Huffman coder. Lossless 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.

Keywords: entropy coder, counter-based coder, lossless compression, Rice coders

Download Article
Bahasa Indonesia | English


Begin on 10 October 2014 this website is no longer activated for article process in Journal of Mathematical and Fundamental Sciences, Journal of Engineering and Technological Sciences, Journal of ICT Research and Applications and Journal of Visual Art and Design. The next process will be proceeded under new website at

For detail information please contact us to:

       ITB Journal Visitor Number #15941265       
       Jl. Tamansari 64, Bandung 40116, Indonesia Visitor IP Address #       
       Tel : +62-22-250 1759 ext. 121 2011 Institut Teknologi Bandung       
       Fax : +62-22-250 4010, +62-22-251 1215 XHTML + CSS + RSS       
       E-mail : or Developed by AVE