Patent ID: 6621429
Filing Date: 2003-09-16
Classification: H03M

Abstract:
A Huffman decoding method of decoding input data encoded by a Huffman code, comprising the steps of:preparing a table describing a binary tree corresponding to the Huffman code and having leaves each storing data; and carrying out a binary-tree based search of the table, based on the input data sequentially acquired by at least one bit to thereby decode the input data encoded by the Huffman code, wherein the binary tree has first nodes having the leaves connected thereto, second nodes having no leaves connected thereto, and the table stores words corresponding to the leaves of the binary tree, and words corresponding to the second nodes having no leaves connected thereto, wherein the table stores, as the words corresponding to the leaves of the binary tree, decoded data corresponding to the data stored in the leaves, and flags for controlling outputting of the decoded data, and flags for controlling outputting of the decoded data, and wherein the table stores, as the words corresponding to the second nodes having no leaves connected thereto, an address of a word corresponding to one of two of the first or second nodes connected as branches to each of the second nodes, and a flag for controlling whether or not the second nodes should be branched to the address.