Huffman coding method, system and equipment

Abstract

The invention discloses a Huffman coding method, system and equipment. The Huffman coding method comprises the steps of: acquiring to-be-coded data; counting to-be-coded characters in the to-be-codeddata and the occurrence frequency of the to-be-coded characters; counting the applied times of the to-be-coded characters in the process of performing Huffman coding on the to-be-coded characters; taking the applied times of the to-be-coded characters as a code length of the to-be-coded characters; and determining a Huffman coding value of the to-be-coded characters based on the occurrence frequency of the to-be-coded characters and the code length of the to-be-coded characters, so as to perform Huffman coding on the to-be-coded data, wherein a binary tree is forbidden to be generated in the process of carrying out Huffman coding on the to-be-coded characters. According to the Huffman coding method, a binary tree does not need to be generated, and memory consumption caused by storage of the binary tree is avoided; only the applied times of the to-be-coded characters need to be recorded, the recorded content is simple and few, and software and hardware implementation is facilitated; inaddition, the efficiency of Huffman coding can be improved, and the limitation is low.

Description

technical field [0001] The present application relates to the technical field of digital encoding, and more specifically, relates to a Huffman encoding method, system, and equipment. Background technique [0002] At present, with the continuous development of science and technology, data information shows an explosive growth. With the rise of cloud computing, the advancement of artificial intelligence, the advent of the era of big data, and the increasing number of new workloads, the problem of massive data transmission and storage has attracted continuous attention. How to efficiently transmit massive data without placing too much burden on the processor The problem of load needs to be solved urgently. If the file can be pre-compressed during file transfer, it will not only save data traffic, but also reduce the transfer time; if the file is compressed before reading the disk file, the file reading rate can be increased; in a word, compressed data from a The new perspecti...

AI Technical Summary

Problems solved by technology

[0004] However, in the process of Huffman coding, it is necessary to directly iteratively construct the Huffman tree, the generation process is cumbersome, and the data storage form of the binary tree is not conducive to hardware implementation, and it will also have the difficulty of large amount of calculation and waste of storage for software implementation. Makes Huffman coding more limited

Images