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

Method of performing huffman decoding

A technology of codes and codewords, applied in the field when codewords will be decoded, can solve problems such as deficiencies

Inactive Publication Date: 2008-09-03
INTEL CORP
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, this decoding technique also has disadvantages
This particular technique is bit sequential and introduces additional "overhead" in both memory allocation and computation execution for the Huffman tree generation process and decoding process

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
  • Method of performing huffman decoding
  • Method of performing huffman decoding
  • Method of performing huffman decoding

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0014] In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, it will be understood by those skilled in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, components and circuits have not been described in detail so as not to obscure the present invention.

[0015] As mentioned earlier, the generation of Huffman codes for a set of symbols is based on the probability of occurrence of the source symbols. Typically, a binary tree structure called a Huffman tree is employed in this context. D.A. Huffman, in the aforementioned literature, describes the process thus:

[0016] ● list all possible symbols and their probabilities;

[0017] ● Find the two symbols with the smallest probability;

[0018] Replace them by a single set of two symbols whose probability is the sum of individual probabili...

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

Embodiments of a method of performing Huffman decoding are disclosed. In one such embodiment, a data structure is employed, although, of course, the invention is not limited in scope to the particular embodiments disclosed.

Description

[0001] related application [0002] The present invention relates to U.S. Patent Application No. 09 / 704,392 and titled "A Method of Generating Huffman Code Length Information" filed concurrently by Acharya et al. (Attorney Reference No. 042390.P9804), which is assigned to assignee, which is hereby incorporated by reference. Background technique [0003] The present invention relates to Huffman decoding. [0004] As we all know, Huffman coding is a popular variable-length statistical coding scheme. It is also well known that the generation of Huffman codes depends on statistical probabilities for each individual symbol. See, for example, "A Method for the Reconstruction of Minimum-Redundancy Codes" by D.A. Huffman, Proceedings of the IRE, Vol. 40, No. 9, pp. 1098-1101, 1952. A traditional table-lookup-based coding scheme is widely used for Huffman coding, at least in part because of its efficiency and relative simplicity of implementation. However, table search based decodi...

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/42H03M7/40
CPCH03M7/42H03M7/40
Inventor 廷库·阿查里雅平圣·蔡
Owner INTEL CORP