Data processing method based on Huffman sheet

Abstract

The invention provides a data processing method based on a Huffman sheet; the method comprises the steps: establishing a binary tree array based on the Huffman sheet and decoding based on the binary tree array, wherein the binary tree array is a two-dimensional array, the first-dimensional array is the number of the layers of a binary tree and the second-dimensional array is the number of the nodes in each layer. The decoding based on the binary tree array comprises reading picture data, acquiring a node inquire code and correspondingly positioning to the corresponding nodes in the two-dimensional array according to the number of the layers of the two-dimensional array and the node inquire code; if the data at the corresponding position is valid, the node is a leaf node and the present inquire is finished; if no, continuously reading the picture data. By adopting the array manner, the operation of error-prone pointers and trees is avoided, the encoding is relatively simple and the debugging is relatively intuitive and simple compared with the binary tree manner.

Description

technical field [0001] The invention relates to a data processing method, in particular to a data processing method based on a Huffman table. Background technique [0002] The traditional image coding technology is also called the first generation coding technology, mainly including predictive coding, transform coding, information entropy coding and vector quantization. Predictive coding and transform coding are the most commonly used technologies for current image encoders. The main purpose of prediction and transform is to reduce the strong correlation existing in the original spatial domain representation of the image, so that the predicted or transformed data matrix becomes a weak correlation matrix. This allows efficient compression with scalar quantization and entropy coding. Information entropy coding is a kind of lossless coding, and there are three commonly used ones: Huffman Coding, Run Length Coding and Arithmetic Coding. [0003] The traditional Huffman coding ...

AI Technical Summary

Problems solved by technology

[0019] However, in the prior art, when encoding and decoding Huffman tables using a binary tree, the code implementation is complex, the probability of error is high, and the code debugging is complicated.

Images