Coded data generation or conversion – Digital code to digital code converters – Coding by table look-up techniques
Reexamination Certificate
2006-10-31
2006-10-31
Jeanglaude, Jean Bruner (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
Coding by table look-up techniques
C341S050000, C341S051000
Reexamination Certificate
active
07129864
ABSTRACT:
A method may include performing an N bit-at-a-time matching operation for a first N bits in an encoded input stream of bits using a lookup table. The matching operation may obtain a first address in the table, and N may be an integer greater than one. The method may also include obtaining a second address in the table based on a mask and a jump address that are associated with the first address and a second number of bits in the encoded input stream. An index value may be output based on the second address in the table.
REFERENCES:
patent: 5406279 (1995-04-01), Anderson et al.
patent: 5532693 (1996-07-01), Winters et al.
patent: 5675382 (1997-10-01), Bauchspies
patent: 5708511 (1998-01-01), Gandhi et al.
patent: 6188797 (2001-02-01), Moledina et al.
patent: 6546053 (2003-04-01), Ishii
Hsiun, “Programmable variable length decoder”, USPGPUB 2003/0184457, filed on Nov. 12, 2002.
Haque Munsi A.
Jahanghir Musa
Lippincott Louis
Jeanglaude Jean Bruner
Pedersen-Giles Alan L.
LandOfFree
Fast compact decoder for huffman codes does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Fast compact decoder for huffman codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast compact decoder for huffman codes will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3713081