Lossless Compression Performance of a Simple Counter-Based Entropy Coder
DOI:
https://doi.org/10.5614/itbj.ict.2011.5.3.2Abstract
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 codercan 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.
Downloads
References
Jayant, N., Signal Compression: Technology Targets and Research Directions, IEEE J. Selected Areas Communications, IEEE 0733-8716/92, 10(5), pp. 796-818, July 1992.
Rice, R.F., Some Practical Universal Noiseless Coding Coding Techniques, Part III, Module PSI-14,K+, JPL Publication 91-3, NASA, JPL California Institute of Technology, 124p, November 1991.
CCSDS, Image Data Compression, Recommended Standard CCSDS 122.0-B-1, Consultative Committee for Space Data Systems, Nov, 2005. (available at http://public.ccsds.org, accessed 4 March 2011)
Langi, A., Review of Data Compression Methods and Algorithms, Technical Report, DSP-RTG-2010-9, Institut Teknologi Bandung, Sep. 2010.
Bradley, J.N. & Brislawn, C.N., The Wavelet/Scalar Quantization Compression Standard for Digital Fingerprint Images, Proc. IEEE Int. Symp. Circuits and Systems, London, May 3-June 2, 1994.
Langi, A.Z.R., An FPGA Implementation of a Simple Lossless Data Compression Coprocessor, Proc. International Conference on Electrical Engineering and Informatics (ICEEI 2011), Bandung, July 2011.
