An Efficient Huffman decoding method based on the N-Tree searching algorithm

N-Tree 검색에 기반한 허프만 디코더의 최적 구현에 관한 연구

This paper presents an efficient huffman decoding method based on the multiple branch technique. In the proposed search method, the internal node which does not contain a leaf node are removed for decrease the searching time and the memory consumption. The proposed search method gives 44％ of improved in searching time and 34％ of decreased in memory requirement compared to the binary search method.