Melola Discovery

← Melola Discovery

Jurnal SINTA 2

Lossless Compression Performance of a Simple Counter-Based Entropy Coder

Journal of ICT Research and Applications (JICTRA) · Vol. 5 No. 3 (2013) · pp. 173–184

DOI
10.5614/itbj.ict.2011.5.3.2
ISSN
2338-5499, 2337-5787
Published
2013-09-13
Publisher
DRI - ITB
Language
eng

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.

Collaboration network of the authors

19 authors · 48 co-authorship links · 9 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Bandung Institute of Technology
  • Maranatha Christian University
  • Institut Teknologi Nasional Bandung
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Suhono Harso SupangkatBandung Institute of Technology3
Yoanes BandungBandung Institute of Technology2
Carmadi MachbubBandung Institute of Technology2
Nur AhmadiBandung Institute of Technology2
Amy Hamidah SalmanBandung Institute of Technology2
Richard MengkoAffiliation unknown2
Tati L. R. MengkoBandung Institute of Technology2
Eko MarpanajiBandung Institute of Technology1
Adit KurniawanBandung Institute of Technology1
Bamba Riyanto TrilaksonoAffiliation unknown1
Andri MahendraBandung Institute of Technology1
Thay LiungBandung Institute of Technology1
Herry Imanta SitepuBandung Institute of Technology1
Arry Akhmad ArmanBandung Institute of Technology1
Radiant Victor ImbarMaranatha Christian University1
Meliana Christianti JohanMaranatha Christian University1
Gina PurnamaBandung Institute of Technology1
Irma Amelia DewiInstitut Teknologi Nasional Bandung1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://journals.itb.ac.id/index.php/jictra/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Lossless Compression Performance of a Simple Counter-Based Entropy Coder</dc:title>
	<dc:creator>Langi, Armein Z.R.</dc:creator>
	<dc:description xml:lang="en-US">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.</dc:description>
	<dc:publisher xml:lang="en-US">DRI - ITB</dc:publisher>
	<dc:date>2013-09-13</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journals.itb.ac.id/index.php/jictra/article/view/214</dc:identifier>
	<dc:identifier>10.5614/itbj.ict.2011.5.3.2</dc:identifier>
	<dc:source xml:lang="en-US">Journal of ICT Research and Applications; Vol. 5 No. 3 (2011); 173-184</dc:source>
	<dc:source>2338-5499</dc:source>
	<dc:source>2337-5787</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journals.itb.ac.id/index.php/jictra/article/view/214/208</dc:relation>
</oai_dc:dc>