A Data Compression Coding Method Based on Partial Huffman Tree

Abstract

The invention relates to a data compressed encoding method based on a part Hoffman tree. The data compressed encoding method comprises the steps that firstly, a rough but very simple and convenient calculation method is used for pre-allocating encoding lengths for all characters needing to be encoded, and therefore a layered encoding schedule named as a pre-encoding schedule is formed; secondly, some specific parts in the Hoffman tree are established on the basis of the pre-encoding schedule; thirdly, the encoding lengths of the characters are dynamically adjusted while the part Hoffman tree is established, and the pre-encoding schedule is modified till the pre-encoding schedule meets the conditions of an optimal encoding schedule. The encoding effect same as that of the typical Hoffman algorithm can be obtained without establishing a complete Hoffman tree. By means of the data compressed encoding method, the redundancy calculation in the typical Hoffman tree can be effectively eliminated, the encoding efficiency is improved, the data compressed encoding method is used for encoding of data, the real-time performance is improved, and meanwhile the consumption of energy is reduced.

Description

technical field [0001] The present invention relates to the field of data compression, and more particularly relates to a data compression coding method based on a partial Huffman tree, so as to realize a fast data compression coding method by constructing a partial Huffman tree. Background technique [0002] With the vigorous development of computer and network technology, the data volume of the entire network is increasing exponentially. Although computer processing speed, hard disk capacity and network bandwidth have also made great progress, it is still difficult to adapt to the speed of data growth. How to compress data smaller and faster has always been an active research direction. [0003] Entropy coding is an important way of data compression. Simply put, the connotation of entropy coding is to replace characters with a high probability of occurrence in a piece of data with shorter codewords, and corresponding characters that appear less frequently with relatively...

AI Technical Summary

Problems solved by technology

[0016] 1) This method requires a large number of sorting operations in each recursive process. In the final Huffman tree, all nodes are arranged in order. This arrangement needs to be supported by a large number of comparison operations. The efficiency of the whole algorithm

[0017] 2) This classic Huffman coding method must construct a complete Huffman tree to encode. Theoretical research shows that the relationship between the nodes in the Huffman tree and the ordering of the nodes in the layer do not contribute to the generation of the coding table.

Images