HUFFMAN CODING METHOD, ITS DEVICE, HUFFMAN DECODING METHOD AND ITS DEVICE

摘要

PROBLEM TO BE SOLVED: To reduce a data amount of Huffman tree information by coding each code using a Huffman code table generated by each code incidence frequency in a data file. ;SOLUTION: A data file arranging codes representing characters and a Huffman coding data file after data compression are stored in a storage device 3. A Huffman coding processing and decoding processing program is stored in a ROM 4 and various data arrays generated and used for coding decoding processing and data table write areas are reserved in a RAM 5. Then a data area storing the number of types of codes incident in a data file before compression, 1st data arrays in which incidence codes are arranged in the order of incidence frequency, 2nd data arrays where data areas storing the number of types of the same bit length Huffman codes are arranged in the order of Huffman code bit length are compressed as Huffman tree information and arranged to a head of the data file, codes not incident area deleted from the tree information to reduce the tree information data amount.;COPYRIGHT: (C)1997,JPO