| 摘要 |
A huffman decoding method using a balanced binary search tree and a decoding apparatus therefor are provided to be more efficient in the use of a memory by configuring the balanced binary search tree of a new type which does not include empty nodes and performing huffman decoding. A comparing unit(300) compares the maximum bit stream corresponding to the maximum codeword length among codeword lengths included in a balanced binary search tree with a codeword stored in a root node of the balanced binary search tree in an input bit stream. If the maximum bit stream is smaller than the codeword stored in the root node, the comparing unit(300) compares the maximum bit stream with a codeword stored in a left child node. If the maximum bit stream is greater than the codeword stored in the root node, the comparing unit(300) compares the maximum bit stream with a codeword stored in a right child node. The comparing unit(300) repeatedly performs the comparison until a codeword identical to the maximum bit stream is searched. If the codeword identical to the maximum bit stream is searched, a decoding unit(310) performs decoding by using the identical codeword. |
