论文部分内容阅读
该文首先回顾了Huffman解码的一般原理和传统的解码算法，然后以视频压缩标准H．263中的Huff-man解码为例，提出了一种Huffman解码快速算法，并将这种快速算法和传统的算法进行了比较。结果表明该文所提出的算法和传统的算法相比，不仅减小了对内存的需求量，而且由于采用查表的方法大大提高了解码效率。由于许多图象编码标准都采用Huffman编码和解码算法，因此文章提出的算法具有普遍意义。
This paper first reviews the general principle of Huffman decoding and the traditional decoding algorithm, and then uses the video compression standard H. Huff-man decoding as an example, a fast Huffman decoding algorithm is proposed, and the fast algorithm is compared with the traditional one. The results show that compared with the traditional algorithm, the proposed algorithm not only reduces the memory requirement, but also greatly improves the decoding efficiency due to the use of look-up table. Since many image coding standards use Huffman coding and decoding algorithms, the proposed algorithm has universal significance.