An optimized Huffman decoding method and device

A technology of a decoding device and a decoding method, applied in the field of an optimized Huffman decoding method and device, capable of solving the problems of more storage space and consumption, and achieving the effect of less storage space

Active Publication Date: 2007-10-24
VIMICRO ELECTRONICS CORP
View PDF0 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The Huffman decoding method of the binary tree search method can achieve high decoding efficiency, but it needs to store each intermediate node and endpoint
It can be seen from Figure 2 that since each node only corresponds to a codeword of one bit, but a certain length of storage space needs to be allocated to each node, therefore, the existing binary tree search method needs to consume more storage space

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
  • An optimized Huffman decoding method and device
  • An optimized Huffman decoding method and device
  • An optimized Huffman decoding method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0028] In order to make the purpose, technical solution and advantages of the present invention clearer, the present invention will be further elaborated below in conjunction with the accompanying drawings.

[0029] The embodiment of the present invention performs variable-length grouping on all codewords in the Huffman code table, generates nodes according to the variable-length codeword fragments obtained by grouping, and forms the nodes into a variable-length grouping Huffman search tree; then , searching the code stream formed by Huffman coding according to the variable-length block Huffman search tree.

[0030] The node storage structure of the variable-length grouped Huffman search tree in the embodiment of the present invention is shown in FIG. 3 . Assume that the storage length is 16 bits, including a one-bit endpoint identifier, which is used to indicate whether the node is an endpoint. For example, a value of 1 indicates that the node is an endpoint, and a value of z...

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 disclosed optimal Hofmann decoding method comprises: variable-length grouping all code words in Hofmann code table, generating node according to the variable-length code word fragment to form a variable-length grouping Hofmann search tree; searching the code flow to obtain the corresponding signal. This invention can reduce memory space.

Description

technical field [0001] The invention relates to the technical field of data compression encoding and decoding, in particular to an optimized Huffman (Huffman) decoding method and device. Background technique [0002] Huffman coding is a coding method proposed by Huffman in 1952 using the statistical properties of message symbols, that is, a bottom-up coding method. Huffman coding is an entropy coding technique commonly used at present, and it is also one of the most basic and main coding techniques. [0003] Figure 1 shows a simple implementation process of Huffman coding, including the following steps: [0004] Step 101: The total number of cell symbols is N, according to the probability P of each cell symbol i (i=1, 2,...N) are arranged in order from large to small, which is P 1 ≥P 2 ≥...≥P N ; [0005] Step 102: adding the probabilities of the two cell symbols with the smallest occurrence probability to synthesize a probability; rearranging this probability together...

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 VIMICRO ELECTRONICS CORP
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