Armein Z.R. Langi
ITB Research Center on Information and Communication Technology Information Technology RG, School of Electrical Engineering and Informatics Institut Teknologi Bandung, Jalan Ganeca 10, Bandung, 40116, Indonesia

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Lossless Compression Performance of a Simple Counter-Based Entropy Coder Armein Z.R. Langi
Journal of ICT Research and Applications Vol. 5 No. 3 (2011)
Publisher : LPPM ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/itbj.ict.2011.5.3.2

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.