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ženo v:
Podrobná bibliografie
Vydáno v:45th Midwest Symposium on Circuits and Systems Ročník 1; s. I - 228
Hlavní autor: Hashemian, R.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 2002
Témata:
Added delay
Binary trees
Data compression
Data mining
Decoding
Encoding
Entropy coding
Huffman coding
Life members
USA Councils
ISBN:0780375238, 9780780375239
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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