Method of generating Huffman code length information
AssigneeIntel Corporation
InventorsTinku Acharya, Ping-Sing Tsai
Life of this patent
Estimating the term…
Abstract
Embodiments of a method of generating Huffman code length information 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.
Claims29
A method of generating, for symbols to be coded, code lengths, using a data structure, said method comprising:
- sorting the data structure, combining symbols in the data structure, and updating symbol length, based, at least in part, on the frequency of the symbols being coded.
A method of generating code lengths for a grouping of symbols to be coded in accordance with a Huffman code without generating a Huffman tree comprising:
- (a) sorting the symbols by frequency and assigning a different flag and the same initial length to each symbol;
- (b) combining symbol flags beginning with the smallest frequency symbols;
- (c) resorting the symbols and updating the length information to reflect the combination;
- and
- repeating (b) and (c) until no more symbols remain to be combined.
A data structure comprising:
- at least two portions;
- a first portion comprising symbol indices and an initially assigned length, wherein said symbol indices are sorted by frequency;
- and
- a second portion comprising group frequency information and an assigned bit flag corresponding to each respective symbol.
An article comprising:
- a storage medium, said storage medium having stored thereon, instructions that, when executed, result in the following method of generating, for symbols to be coded, code lengths, being executed using a data structure:
- sorting the data structure, combining symbols in the data structure, and updating symbol length, based, at least in part, on the frequency of the symbols being coded.
An article comprising:
- a storage medium, said storage medium having stored thereon, instructions that, when executed, result in the following method of initializing a data structure for generating code lengths for symbols to be coded, being executed:
- sorting the symbols by frequency and assigning a different flag and the same initial length to each symbol.
A method of encoding symbols comprising:
- encoding symbols using code length information;
- generating the code length information without using a Huffman tree.
A method of decoding symbols comprising:
- decoding symbols, wherein the symbols have been encoded using code length information and the code length information was generated without using a Huffman tree.
Dependencies are inferred from the claim text.