| 摘要 |
<p>PROBLEM TO BE SOLVED: To quicken decoding of Huffman code and to provide a decoding table where redundancy is suppressed. SOLUTION: A decoding table stored in an ROM 2 contains branch information, the number of branches, a first subsequent relative address when one head bit of a Huffman code sequence is '0', and a second subsequent relative address when the head bit is '1' wherein the number of bits being processed simultaneously is variable. A variable length code is cut out from the Huffman code sequence depending on the current reference table information, a code value thus cut out is employed as next address information and decoding is progressed. If the branch information of information acquired from the table id multibranch, next cut length obtained simultaneously is made variable and processing is quickened by cutting out a plurality of codes.</p> |
