Normal form Huffman decoding method and device

Abstract

The invention discloses a normal form Huffman decoding method and device; the method comprises the following steps: zero-padding the right side of each code in a preset decoding table so as to expand to form m bit code, calculating the value of the m bit code, wherein m refers to the longest coding length in the preset decoding table; respectively using the minimum value of the coding values with the same original coding length as the threshold; reading m bit binary system codes in sequence from the reading initial position of a decoded bit stream, and calculating the value D; respectively comparing the D with n thresholds in sequence, if D is smaller than the compared threshold, 0 is obtained, otherwise, 1 is obtained; recording the comparison result according to the comparison order, thus obtaining a mask; carrying out and-operation for the m bit binary system code and the mask, thus obtaining a result code; calculating to obtain a decoding character and the original coding length L according to the result code value; moving back the present reading initial position for L bits, and repeatedly reading binary system codes until the decoding is finished. The normal form Huffman decoding method and device can read a binary system code group in each time, are fast in decoding rate, and high in efficiency.

Description

technical field [0001] The present invention relates to the technical field of coding and decoding, in particular to a paradigm Huffman decoding method and a device thereof. Background technique [0002] At present, with the rapid development of the Internet and the Internet of Things, the scale of data files is getting larger and larger. In order to save storage costs, each data center compresses the data. A large amount of data compression takes up relatively high CPU resources, which not only reduces server performance, but also increases server power consumption and increases energy costs. [0003] At present, the Huffman decoding method is often used in data compression. Huffman coding is a consistent coding method (also known as "entropy coding method") for lossless compression of data. It establishes a code table according to the probability of each character. Characters with a high probability of occurrence use a shorter code, whereas characters with a low probabi...

AI Technical Summary

Problems solved by technology

[0004] Since Huffman coding is a variable-length coding, the code length of each character is uncertain, so Huffman decoding can only be performed serially, and the bit stream to be decoded cannot be pre-divided into binary code strings of a specific length for

Images