Method and system for decoding variable length encoded...

Details Method and system for decoding variable length encoded... Method and system for decoding variable length encoded...

2003-06-24

2008-03-25

Mai, Lam T. (Department: 2819)

Coded data generation or conversion

Digital code to digital code converters

To or from variable length codes

C341S060000

Reexamination Certificate

active

07348901

ABSTRACT:
A system adapted for use, e.g. in an MPEG audio-video decoder for decoding variable-length (e.g. Huffman) encoded codewords, each having associated a respective set of sign bits. The system operates on the basis of a signed decoding codebook including extended signed codewords. Each extended codeword includes a respective codeword in the original codebook plus the associated set of sign bits. The variable-length encoded codewords are decoded on the basis of the signed decoding codebook, whereby the codewords are decoded together with the sign bit set associated therewith. Preferably, the codewords are partitioned in “short” and “long” codewords with respect to a given threshold. The short codewords are decoded by means of a single lookup step in a first lookup table. The long words are decoded by means of a multi-step lookup process involving at least one second lookup table. The lookup tables are preferably arranged as nested lookup tables within a container table.

REFERENCES:
patent: 5253053 (1993-10-01), Chu et al.
patent: 5589829 (1996-12-01), Astle
patent: 5646618 (1997-07-01), Walsh
Chung, Efficient Huffman decoding, Information Processing Letters, Elsevier, Netherlands, vol. 61, No. 2, XP002269302, ISSN: 0020-0190, pp. 97-99, (Jan. 28, 1997).
Sieminski, “Fast Decoding of the Huffman Codes”, Information Processing Letters, Amsterdam, NL, vol. 26, No. 5, XP008013198, ISSN: 0020-0190, pp. 237-241, (Jan. 11, 1988).
Hashemian, “Memory Efficient and High-Speed Search Huffman Coding”, IEEE Transactions on Communications, IEEE Inc., New York, US, vol. 43, No. 10, XP000535628, ISSN: 0090-6778, pp. 2576-2581, (Oct. 1, 1995).
Bosi, et al., ISO/IEC JTC1/SC29/WG11, “Information Technology—Generic Coding of Moving Pictures and Associated Audio, Part 7: Advanced Audio Coding”, pp. 1-107, 1997.
Huffman, “A Method for the Construction of Minimum-Redundancy Codes”, Proceedings of the IRE, pp. 1098-1101, (1952).
Aggarwal, et al., “Efficient Huffman Decoding”, Proc. ICIP, vol. 1, pp. 936-939, (2000).
Chen, et al., A memory-efficient and fast Huffman decoding algorithm, Information Processing Letters, vol. 69, No. 3, pp. 119-122, (Feb. 1999).
Moffat, et al., “On the Implementation of Minimum Redundancy Prefix Codes”, IEEE Transaction on Communications, vol. 45, No. 10, pp. 1200-1207, (Oct. 1997).
Pajarola, “Fast Huffman Code Processing”, University of California Irvine—Information & Computer Science Department Technical Report No. 99-43, pp. 1-6, (Oct. 1999).
Sayood, “Huffman Coding”, Introduction to Data Compression—Second Edition, Morgan Kaufmann Publisher, San Francisco, California, pp. 40-76, (2000).

Affiliated with

Also associated with

Rating

Method and system for decoding variable length encoded... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and system for decoding variable length encoded..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for decoding variable length encoded... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3971890