Technique for implementing Huffman decoding

Details Technique for implementing Huffman decoding Technique for implementing Huffman decoding

2005-02-16

2010-06-15

Armstrong, Angela A (Department: 2626)

Data processing: speech signal processing, linguistics, language

Audio signal bandwidth compression or expansion

C704S201000, C341S065000

Reexamination Certificate

active

07739119

ABSTRACT:
An improved decoding process as applied to MPEG AAC decoders of the type that use codebooks, reduces redundant traversing steps while finding the location of a specific binary stream codeword in the codebook. To this end, the codebooks are divided into a plurality of node-tables, each table corresponding to a node. From the number of bits “k” in a given node-table, the decimal value of the first “k” bits in a binary stream to be decoded is ascertained and compared with the decimal value of the maximum code word in the given node-table. The comparison is used for the identification of the location of the codeword in the node-tables to assist in decoding without unnecessary traversing of all the nodes in the codebook.

REFERENCES:
patent: 6903669 (2005-06-01), Subramaniam
patent: 2007/0057825 (2007-03-01), De Martin et al.

Affiliated with

Also associated with

Rating

Technique for implementing Huffman decoding does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Technique for implementing Huffman decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Technique for implementing Huffman decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4184190