Back to results
US 6,646,577 B2Granted
Method of performing Huffman decoding
AssigneeIntel Corporation
InventorsTinku Acharya, Ping-Sing Tsai
Life of this patent
Estimating the term…
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.
Claims20
A method of decoding a series of binary digital signals using a data structure, the series of binary digital signals being encoded, said method comprising:
- searching the data structure based on, at least in part, the length of a subgrouping of binary digital signals of the series of binary digital signals being decoded, wherein the length of the subgrouping of binary digital signals being decoded is used, at least in part, for a determination of a possible matching code in the data structure.
A data structure of Huffman codes, the Huffman codes being arranged in subgroupings, comprising:
- for each subgrouping, a code word length, a start code, an end code, and a base index, a possible matching code word in the data structure being determinable, based at least in part, upon code word length.
A method of creating a data structure for decoding code words, said method comprising:
- sorting the code words by code length;
- and
- ordering the code words of the same length sequentially from start code to end code;
- a possible matching code word in the data structure being determinable, based at least in part, upon code word length.
1 more element
An article comprising:
- a storage medium, said storage medium having stored thereon, instructions, that, when executed, result in the following operations:
- searching the data structure based on, at least in part, the length of a subgrouping of binary digital signals of the series of binary digital signals being decoded, wherein the length of the subgrouping of binary digital signals being decoded is used, at least in part, for a determination of a possible matching code in the data structure.
An article comprising:
- a storage medium, said storage medium having stored thereon, instructions, that, when executed, result in the following operations:
- sorting the code words by code length;
- and
- ordering the code words of the same length sequentially from start code to end code;
- a possible matching code word in the data structure being determinable, based at least in part, upon code word length.
2 more elements
Dependencies are inferred from the claim text.