Haffman quick decoding method based on probability table look-up

A decoding method and probabilistic technology, which is applied in the field of Huffman fast decoding based on probability lookup table, can solve the problems of multi-bit operation, not whole byte reading, and ineffective use of register width, so as to achieve the effect of improving speed

Inactive Publication Date: 2008-12-17
HAIER BEIJING IC DESIGN
View PDF0 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

There are three time-consuming points in this process: First, because Huffman coding is bit-by-bit coding, this process requires more bit operations, and the data reading process is often not a whole byte reading; second, Huffman coding It is a variable-length code, so it is of

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Haffman quick decoding method based on probability table look-up
  • Haffman quick decoding method based on probability table look-up

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0019] figure 1 A flow chart of establishing an auxiliary table before performing Huffman decoding is illustrated.

[0020] The Huffman decoding method of the present invention first needs to establish an auxiliary table Table, and this auxiliary table has 65536 elements, and each element includes three items, Table->N, Table->L, Table->data[]. Among them, Table[B] corresponds to the information that B is a 16-bit binary code stream (for example, B=421, its binary code is 110100101B, then it represents the information of the binary code stream 0000000110100101), and Table[B]N represents this code The number of complete characters contained in the stream after decoding, Table[B]L represents the Huffman encoding length sum of the complete characters contained in the decoding, and Table[B]data represents the content of the complete characters contained in the decoding.

[0021] The process of creating an auxiliary table Table is as follows figure 1 shown.

[0022] Create auxil...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a huffman fast decoding method based on the probability table look-up, comprising: reading the code stream in turn in the decoding, looking up the corresponding information in the supplementary table according to the read code stream, and outputting the corresponding character after coding based on the corresponding information, wherein the supplementary table is built according to the huffman table, comprising a plurality of groups of information after coding, and reflecting the probability of occurrence in the code stream of the corresponding character after coding. According to the invention, a supplementary table is built before the huffman decoding, one or a plurality of huffman codes are obtained through one replacement and the 16-bit table look-up under the condition of higher probability of occurrence of the coded character in the data stream, and the reading of the code stream uses word as the unit, while in the lower probability, a huffman code is obtained in the routine way, which advances the coding speed of the huffman.

Description

technical field [0001] The invention relates to a Huffman fast decoding method based on probability look-up table. Background technique [0002] Huffman coding is a kind of entropy coding, which is a lossless compression method of variable word length coding (VLC). Its basic idea is to compress by assigning code values ​​of different lengths to characters with different probabilities of appearance in the data stream. In short, when the character to be encoded has a high probability of appearing in the data stream, a shorter code value is assigned to it, otherwise, a longer code value is assigned to it. Huffman coding is widely used in computer science, and many compressed data formats use Huffman coding as part of their standards. [0003] Generally speaking, Huffman decoding is a simple operation with a computational complexity of O(n), and its computational load is not very large. However, it is still important to increase the Huffman decoding speed in some cases where ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H03M7/42
Inventor 史岩
Owner HAIER BEIJING IC DESIGN
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap