Huffman decoding method

Details Huffman decoding method Huffman decoding method

2008-05-20

2008-05-20

Nguyen, Khai M (Department: 2819)

Coded data generation or conversion

Digital code to digital code converters

To or from number of pulses

C341S067000, C382S246000

Reexamination Certificate

active

07375660

ABSTRACT:
The present invention relates to a Huffman decoding method. Firstly, a Huffman table including multiple Huffman codes and multiple corresponding size/symbol codes is extracted. Each Huffman code comprises a codeword and each size/symbol code comprises a size code and a symbol code. Then, multiple mask codes are generated according to the size codes. Then, masking operations are performed on successive 16 bits of the compression bit stream and the mask codes, thereby outputting multiple masking results. Subsequently, logic operations on the masking results and the Huffman codes, thereby generating multiple are performed on the new Huffman codes, wherein each new Huffman code includes the codeword. It is discriminated whether the 16 bits of the compression bit stream complies with a specific one of new Huffman codes, thereby outputting the size/symbol code corresponding to the codeword.

REFERENCES:
patent: 4899149 (1990-02-01), Kahan
patent: 6563439 (2003-05-01), Acharya et al.
patent: 6636167 (2003-10-01), Acharya et al.
patent: 6646577 (2003-11-01), Acharya et al.
patent: 7190287 (2007-03-01), Acharya et al.
patent: 7205915 (2007-04-01), Zheltov et al.

Affiliated with

Also associated with

Rating

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

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

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2810932