A new storage structure for Huffman tree and its applications
Due to the nonlinear property, Huffman tree sometimes needs large memory for storage. In order to reduce the needing memory and to accelerate the traversal also, a new storage structure is proposed in this paper. The regular storage structure of Huffman tree, nonlinear binary link-list, is replaced by two parallel linear lists. The implementation algorithm of this new structure is presented. Finally, the applications in image compression are shown to prove its advantages in both theory and practice.
Huffman tree storage structure parallel linear list traversal Huffman coding
DUAN Min CAO QiSheng
Department of ECM, ARFA of China, Wuhan, 430019 Department of Information Engineering, Dalian Maritime university of China, Dalian, 116026
国际会议
北京
英文
2007-08-05（万方平台首次上网日期，不代表论文的发表时间）