Condensed Huffman coding, a new efficient decoding technique

A new technique is proposed for decoding Huffman codes. In this technique a Condensed Huffman Table (CHT) for decoding purposes replaces a typical Huffman table. It is shown that a CHT is much smaller in size and the decoding becomes significantly faster. In an example with a typical Huffman table c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:45th Midwest Symposium on Circuits and Systems Jg. 1; S. I - 228
1. Verfasser: Hashemian, R.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 2002
Schlagworte:
Added delay
Binary trees
Data compression
Data mining
Decoding
Encoding
Entropy coding
Huffman coding
Life members
USA Councils
ISBN:0780375238, 9780780375239
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A new technique is proposed for decoding Huffman codes. In this technique a Condensed Huffman Table (CHT) for decoding purposes replaces a typical Huffman table. It is shown that a CHT is much smaller in size and the decoding becomes significantly faster. In an example with a typical Huffman table containing 108 codewords, it is shown that a CHT with only 14 codewords is sufficient to perform the decoding.
ISBN:0780375238
9780780375239
DOI:10.1109/MWSCAS.2002.1187198