Level-compressed Huffman decoding

Kuo Liang Chung, Jung Gen Wu

研究成果: 雜誌貢獻期刊論文同行評審

16 引文 斯高帕斯(Scopus)

摘要

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.

原文英語
頁(從 - 到)1455-1457
頁數3
期刊IEEE Transactions on Communications
47
發行號10
DOIs
出版狀態已發佈 - 1999

ASJC Scopus subject areas

  • 電氣與電子工程

指紋

深入研究「Level-compressed Huffman decoding」主題。共同形成了獨特的指紋。

引用此