Back to results
US 7,002,494 B2Granted
Low memory and MIPS efficient technique for decoding Huffman codes using multi-stage, multi-bits lookup at different levels
AssigneeBroadcom Corporation
InventorsManoj Singhal, Sandeep Bhatia, Srinivasa Mpr
Life of this patent
Estimating the term…
Abstract
Present herein is a low memory and MIPS efficient technique for decoding Huffman codes using multi-stage, multi-bits lookup at different levels. A binary tree is cut at levels depending on the quotient of the number of existing nodes and the number of possible nodes.
Claims18
A method for storing a variable length code table in a memory, said method comprising:
- (a) calculating a value for each of at least one levels of a binary tree;
- (b) comparing the value for each of the at least one levels of the binary tree to a threshold;
- and
- (c) generating at least one new binary tree from a particular one of the at least one levels, if the threshold exceeds the value for the particular one of the at least one levels.
1 more element
An article of manufacture comprising a computer readable medium, wherein the computer readable medium stores a plurality of instructions, wherein execution of the plurality of instructions causes:
- (a) calculating a value for each of at least one levels of a binary tree;
- (b) comparing the value for each of the at least one levels of the binary tree to a threshold;
- and
- (c) generating at least one new binary tree from a particular one of the at least one levels, if the threshold exceeds the value for the particular one of the at least one levels.
1 more element
Dependencies are inferred from the claim text.