An optimized Huffman decoding method and device

Abstract

The disclosed optimal Hofmann decoding method comprises: variable-length grouping all code words in Hofmann code table, generating node according to the variable-length code word fragment to form a variable-length grouping Hofmann search tree; searching the code flow to obtain the corresponding signal. This invention can reduce memory space.

Description

technical field [0001] The invention relates to the technical field of data compression encoding and decoding, in particular to an optimized Huffman (Huffman) decoding method and device. Background technique [0002] Huffman coding is a coding method proposed by Huffman in 1952 using the statistical properties of message symbols, that is, a bottom-up coding method. Huffman coding is an entropy coding technique commonly used at present, and it is also one of the most basic and main coding techniques. [0003] Figure 1 shows a simple implementation process of Huffman coding, including the following steps: [0004] Step 101: The total number of cell symbols is N, according to the probability P of each cell symbol i (i=1, 2,...N) are arranged in order from large to small, which is P 1 ≥P 2 ≥...≥P N ; [0005] Step 102: adding the probabilities of the two cell symbols with the smallest occurrence probability to synthesize a probability; rearranging this probability together...

AI Technical Summary

Problems solved by technology

The Huffman decoding method of the binary tree search method can achieve high decoding efficiency, but it needs to store each intermediate node and endpoint

It can be seen from Figure 2 that since each node only corresponds to a codeword of one bit, but a certain length of storage space needs to be allocated to each node, therefore, the existing binary tree search method needs to consume more storage space

Images