COMPACTED CODEWORD BASED HUFFMAN DECODING METHOD

摘要

A Huffman decoding method based on a compacted codeword is provided to simultaneously search a plurality of symbols through one memory access by grouping codewords with high probability distribution and short length in a typical Huffman codebook table and reconstructing a codebook table. Codewords with high probability distribution and short length which are located at an upper position of a Huffman codebook are reconstructed into one combined code, and then one compacted codeword is accessed so that a plurality of symbols is simultaneously searched. The number of the symbols and the number of used bits are represented together in a newly reconstructed table so that the symbols are simultaneously searched through access of one compacted codeword.