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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:45th Midwest Symposium on Circuits and Systems Ročník 1; s. I - 228
Hlavný autor: Hashemian, R.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 2002
Predmet:
Added delay
Binary trees
Data compression
Data mining
Decoding
Encoding
Entropy coding
Huffman coding
Life members
USA Councils
ISBN:0780375238, 9780780375239
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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