Huffman decoding method for quick extracting bit stream

A decoding method and Huffman code table technology, applied in the field of Huffman decoding, can solve the problems of large memory overhead, low efficiency, and low efficiency, and achieve the effect of reducing a large number of calculations and improving operating efficiency

Inactive Publication Date: 2007-10-10
CENT ACADEME OF SVA GROUP
View PDF0 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Among them, the efficiency of linear search method and binary search method is low, which is not suitable for occasions with high real-time requirements; while the efficiency of direct table lookup method is slightly higher, but the memory overhead is larger; in addition, the step-by-step table lookup method is binary search method and A compromise of the direct table lookup method, but its efficiency is still not very high

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
  • Huffman decoding method for quick extracting bit stream

Examples

Experimental program
Comparison scheme
Effect test

Embodiment approach

[0047] The present invention provides a kind of fast extraction bitstream Huffman decoding method, it comprises the following steps:

[0048] Step 1, reconstructing the code value table, index table and code length table of the new Huffman code table;

[0049]Step 2. Based on the Huffman code table constructed in step 1, quickly strip the required number of bits from the bit stream to realize Huffman decoding.

[0050] Described step 1 specifically comprises the following steps:

[0051] Step 1.1, according to the size of each code length value in the original code length table Table_len1 in the Huffman code table, reorder according to the order, and store the new code length table obtained after sorting in the table Table_len2;

[0052] Step 1.2, storing the mapping relationship from the original code length table to the new code length table in the mapping table Table_Index;

[0053] Step 1.3, according to the mapping relationship in the table Table_Index, correspondingly ...

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 method includes steps: (1) reconstructing new Huffman code table, which presents regularity distribution based on code length; (2) based on reconstructed Huffman code table, the method strips off needed number of bit form stream of bits rapidly so as to realize decoding stream of bits. The method reduces large amount of calculation caused by stripping off needed number of bit form stream of bits greatly, and obtains decoding result same to original result finally so as to raise operating efficiency greatly.

Description

technical field [0001] The invention belongs to the field of multimedia technology using Huffman encoding and decoding, and in particular relates to a method for realizing Huffman decoding by rapidly extracting bits from a bit stream. Background technique [0002] The Huffman coding is to use the probability distribution of the signal source symbols to determine the amount of information encoded by the symbols. For symbols with high probability of occurrence, short codewords are used to describe them; for symbols with low probability of occurrence, long codewords are sampled to describe. The redundancy between information is eliminated by variable length coding, so as to achieve the purpose of lossless compression of the signal. [0003] In the modern multimedia field, Huffman codec technology has been widely used, including in MPEG audio codec technology, in AVS audio codec technology, and in AC series audio codec technology. [0004] In the Huffman decoding process, it i...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H03M7/40
Inventor 谭建国
Owner CENT ACADEME OF SVA GROUP
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