Unlock instant, AI-driven research and patent intelligence for your innovation.

Hoffman decoder and decoding method thereof

A decoding method and decoder technology are applied in the field of improving the efficiency of a Huffman decoding program, which can solve the problems of time-consuming coding of characters and the inability of a decoding system to judge the coding characters, and achieve the effect of high computing efficiency.

Inactive Publication Date: 2012-11-14
MSTAR SOFTWARE R&D (SHENZHEN) LTD +1
View PDF3 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The disadvantage of the prior art is that until a leaf node is traced to find that a coded character corresponds to symbol 0, the decoding system cannot determine whether the coded character is a rare code
In the case of a Huffman tree with many levels, the process of judging whether a coded character is a rare code is particularly time-consuming

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
  • Hoffman decoder and decoding method thereof
  • Hoffman decoder and decoding method thereof
  • Hoffman decoder and decoding method thereof

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0021] FIG. 2(A) is a block diagram of a Huffman decoder according to a specific embodiment of the present invention. The decoder includes a storage module 21 , a receiving module 22 , a judging module 23 and a decoding module 24 . In practical applications, the decoder can be set in various computer or multimedia systems using Huffman coding, for example, as a low bit rate (low bit rate, LBR) decoder.

[0022] A target path corresponding to a rare code is stored in the storage module 21 . by figure 1 The Huffman tree shown is taken as an example, assuming that the coded character in this embodiment has only one rare code, and the symbol representing the rare code is 0, and the path 001 corresponding to it is the above-mentioned target path. Since the decoder can grasp the content of the Huffman tree before it starts to receive coded characters, and which symbol therein represents a rare code is also known in advance, the target path can be found in advance according to the...

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 provides a Hoffman decoder, which comprises a storage module, a receiving module and a judgment module, wherein the storage module stores a target path corresponding to a rare code; the receiving module is used for receiving path data of a coded character; and the judgment module is used for comparing the path data with the target path. When the path data and the target path are the same, the judgment module judges the coded character to be the rare code.

Description

technical field [0001] The present invention is related to decoding techniques, and in particular to techniques for improving the efficiency of Huffman decoding procedures. Background technique [0002] Huffman coding (Huffman coding) is a data compression technology widely used in multimedia systems. Its concept is to determine the corresponding code according to the probability of each original code appearing in the entire string of symbols to be compressed. High source codes are assigned shorter codes, and less frequent source codes are assigned longer codes. From the Huffman tree (Huffman tree), we can see the corresponding relationship between each symbol (symbol) and its encoding. Each encoded code word (codeword) will have a path data, which is used to indicate the position of the symbol corresponding to the code word in the Huffman tree. The receiving end system decodes the received data according to the known Huffman tree. [0003] At once figure 1 For the examp...

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 MSTAR SOFTWARE R&D (SHENZHEN) LTD