Coded data generation or conversion – Digital code to digital code converters – To or from variable length codes
Reexamination Certificate
2008-05-13
2008-05-13
Jeanglaude, Jean Bruner (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
To or from variable length codes
C341S051000
Reexamination Certificate
active
11293708
ABSTRACT:
Methods and systems that leverage the advantages of Huffman coding to increase processing efficiency of a data-stream while simultaneously minimizing storage requirements are provided. Decoding efficiency and table storage requirements can be balanced to produce systems that can be adapted for use in high-end network infrastructure applications and for low-resourced portable consumer devices. The systems and methods are operative in decoding data streams using multi-symbol codes and sign information, including AAC and MP3 data streams. A hierarchical structure of tables is described as having primary tables, secondary tables, tertiary tables and so on. Optimization balances processing requirements, table storage requirements and the described systems and methods may be implemented on a variety of processing platforms.
REFERENCES:
patent: 6008745 (1999-12-01), Zandi et al.
patent: 6041403 (2000-03-01), Parker et al.
patent: 6543023 (2003-04-01), Bessios
patent: 6839624 (2005-01-01), Beesley et al.
patent: 2004/0081245 (2004-04-01), Deeley et al.
Jeanglaude Jean Bruner
Lauture Joseph
Nvidia Corporation
LandOfFree
Efficient decoding of n-tuple variable bit length symbols does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Efficient decoding of n-tuple variable bit length symbols, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient decoding of n-tuple variable bit length symbols will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3938770