Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Huffman decoding method

a decoding method and binary tree search technology, applied in the field of decoding methods, can solve the problems of slow processing speed of such binary tree search methods and inability to decode abundant compressed files, and achieve the effect of high speed

Inactive Publication Date: 2008-05-29
PRIMAX ELECTRONICS LTD
View PDF6 Cites 26 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

The present invention provides a method for quickly decoding Huffman codes. The method involves extracting a Huffman table, generating mask codes based on the size codes, performing masking operations on the compression bit stream and the mask codes, and generating new Huffman codes based on the logic operations. The method can discriminate whether the compression bit stream complies with a specific new Huffman code and output the corresponding size / symbol code. The invention also provides a device for performing these operations. The technical effect of the invention is to enable faster and more efficient decoding of Huffman codes.

Problems solved by technology

Since the bits of the input data stream are decoded one by one, the processing speed of such binary tree search method is very slow and is not suitable to decode abundant compressed files.

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
  • Huffman decoding method
  • Huffman decoding method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0021]The present invention relates to a Huffman decoding method. First of all, a Huffman table is provided in a Huffman decoder to describe the Huffman codes. Take a JPEG file for example. Generally, a standard JPEG Huffman table has been previously provided in the decoder. The standard JPEG Huffman table includes codewords for most JPEG files in order to be used for decoding most compressed JPEG data. On the other hand, the application of the standard JPEG Huffman table is restricted because some JPEG files have specific decompression requirements. As a consequence, the manufacture may design specified Huffman tables as required. These specified Huffman table are stored in the header of the JPEG file. When the decoding operation is initiated, the specified Huffman tables will be downloaded from the JPEG file to the decoder through the bus.

[0022]Referring to FIG. 3(a), a data code definition for the Huffman table used in the present invention is illustrated. The data code 310 is a ...

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 present invention relates to a Huffman decoding method. Firstly, a Huffman table including multiple Huffman codes and multiple corresponding size / symbol codes is extracted. Each Huffman code comprises a codeword and each size / symbol code comprises a size code and a symbol code. Then, multiple mask codes are generated according to the size codes. Then, masking operations are performed on successive 16 bits of the compression bit stream and the mask codes, thereby outputting multiple masking results. Subsequently, logic operations on the masking results and the Huffman codes, thereby generating multiple are performed on the new Huffman codes, wherein each new Huffman code includes the codeword. It is discriminated whether the 16 bits of the compression bit stream complies with a specific one of new Huffman codes, thereby outputting the size / symbol code corresponding to the codeword.

Description

FIELD OF THE INVENTION[0001]The present invention relates to a decoding method, and more particularly to a Huffman decoding method.BACKGROUND OF THE INVENTION[0002]Huffman encoding algorithm is widely used in compression of video and image data, for example in JPEG and MPEG compression. As known, identical symbols (e.g. A, B, C, etc.) included in a file to be compressed may be repeatedly occurred. Based on the frequency of occurrence of the symbols in the file that is being compressed, Huffman encoding algorithm encodes symbols by assigning thereto respective codewords having lengths corresponding to probabilities of occurrence of the symbols. In a case that the occurrence of a symbol is more frequent, the length of the encoded symbol is shorter. Take a file having data ABCBCDCDDD for example. The frequency of occurrence for the symbol A is 1, for the symbol B is 2, for the symbol C is 3 and for the symbol D is 4. Since the symbol D has the most probable occurrence, the symbol D is ...

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(United States)
IPC IPC(8): H03M7/40
CPCH03M7/40
Inventor CHANG, WEN-TSUNGCHUANG, CHE-SHENG
Owner PRIMAX ELECTRONICS LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com