Level-compressed Huffman decoding

Kuo Liang Chung; Jung Gen Wu

doi:10.1109/26.795810

Level-compressed Huffman decoding

Kuo Liang Chung, Jung Gen Wu

Research output: Contribution to journal › Article › peer-review

17 Citations (Scopus)

Abstract

Based on the breadth-first search manner and the level-compression technique, this letter first presents a new array data structure to represent the classical Huffman tree. Then, the decoding algorithm is given. Both the memory and the decoding time required in the proposed method are less than those of previous methods. Some experimentations are carried out to demonstrate the advantages of the proposed method. In fact, the proposed algorithm can be applied to the canonical Huffman tree.

Original language	English
Pages (from-to)	1455-1457
Number of pages	3
Journal	IEEE Transactions on Communications
Volume	47
Issue number	10
DOIs	https://doi.org/10.1109/26.795810
Publication status	Published - 1999
Externally published	Yes

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/26.795810

Cite this

@article{a084490780fe4e26b3ade0e43cc697ed,

title = "Level-compressed Huffman decoding",

abstract = "Based on the breadth-first search manner and the level-compression technique, this letter first presents a new array data structure to represent the classical Huffman tree. Then, the decoding algorithm is given. Both the memory and the decoding time required in the proposed method are less than those of previous methods. Some experimentations are carried out to demonstrate the advantages of the proposed method. In fact, the proposed algorithm can be applied to the canonical Huffman tree.",

author = "Chung, {Kuo Liang} and Wu, {Jung Gen}",

note = "Funding Information: Paper approved by E. Ayanoglu, the Editor for Communication Theory and Coding Application of the IEEE Communications Society. Manuscript received May 1, 1998; revised December 9, 1999. This research was supported by the National Science Council, R.O.C., under Contract NSC88-2213-E011-005.",

year = "1999",

doi = "10.1109/26.795810",

language = "English",

volume = "47",

pages = "1455--1457",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10",

}

TY - JOUR

T1 - Level-compressed Huffman decoding

AU - Chung, Kuo Liang

AU - Wu, Jung Gen

N1 - Funding Information: Paper approved by E. Ayanoglu, the Editor for Communication Theory and Coding Application of the IEEE Communications Society. Manuscript received May 1, 1998; revised December 9, 1999. This research was supported by the National Science Council, R.O.C., under Contract NSC88-2213-E011-005.

PY - 1999

Y1 - 1999

N2 - Based on the breadth-first search manner and the level-compression technique, this letter first presents a new array data structure to represent the classical Huffman tree. Then, the decoding algorithm is given. Both the memory and the decoding time required in the proposed method are less than those of previous methods. Some experimentations are carried out to demonstrate the advantages of the proposed method. In fact, the proposed algorithm can be applied to the canonical Huffman tree.

AB - Based on the breadth-first search manner and the level-compression technique, this letter first presents a new array data structure to represent the classical Huffman tree. Then, the decoding algorithm is given. Both the memory and the decoding time required in the proposed method are less than those of previous methods. Some experimentations are carried out to demonstrate the advantages of the proposed method. In fact, the proposed algorithm can be applied to the canonical Huffman tree.

UR - http://www.scopus.com/inward/record.url?scp=0033354210&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033354210&partnerID=8YFLogxK

U2 - 10.1109/26.795810

DO - 10.1109/26.795810

M3 - Article

AN - SCOPUS:0033354210

SN - 0090-6778

VL - 47

SP - 1455

EP - 1457

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 10

ER -

Level-compressed Huffman decoding

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this