Method of performing Huffman decoding

Details Method of performing Huffman decoding Method of performing Huffman decoding

2002-11-12

2003-11-11

Williams, Howard L. (Department: 2819)

Coded data generation or conversion

Digital code to digital code converters

To or from variable length codes

C341S065000

Reexamination Certificate

active

06646577

ABSTRACT:

BACKGROUND
The present invention is related to Huffman decoding.
As is well-known, Huffman coding is a popular variable length statistical encoding scheme. As is also well-known, Huffman code generation relies on statistical probabilities for each individual symbol. See, for example, D. A. Huffman, “A Method for the Reconstruction of Minimum-Redundancy Codes” Proceedings of the IRE, Volume 40, No. 9, pages 1098-1101, 1952. A traditional table lookup based encoding scheme is widely used for Huffman encoding due, at least in part, to its efficiency and relative ease of implementation. However, table searching based decoding is typically inefficient in both software and hardware implementations. This is especially the case when the number of entries in a table is reasonably high, as is typical for practical applications. Another approach employed for Huffman decoding is the creation of a Huffman tree which employs a “tree traversing technique.” However, this decoding technique also has disadvantages. This particular technique is bit sequential, and introduces extra “overhead” both in terms of memory allocation and the execution of computations for the Huffman tree generation process and for the decoding process.


REFERENCES:
patent: 5821887 (1998-10-01), Zhu
patent: 5875122 (1999-02-01), Acharya
patent: 5995210 (1999-11-01), Acharya
patent: 6009201 (1999-12-01), Acharya
patent: 6009206 (1999-12-01), Acharya
patent: 6047303 (2000-04-01), Acharya
patent: 6075470 (2000-06-01), Little et al.
patent: 6091851 (2000-07-01), Acharya
patent: 6094508 (2000-07-01), Acharya et al.
patent: 6108453 (2000-08-01), Acharya
patent: 6124811 (2000-09-01), Acharya et al.
patent: 6130960 (2000-10-01), Acharya
patent: 6151069 (2000-11-01), Dunton et al.
patent: 6151415 (2000-11-01), Acharya et al.
patent: 6154493 (2000-11-01), Acharya et al.
patent: 6166664 (2000-12-01), Acharya
patent: 6178269 (2001-01-01), Acharya
patent: 6195026 (2001-02-01), Acharya
patent: 6215908 (2001-04-01), Pazmino et al.
patent: 6215916 (2001-04-01), Acharya
patent: 6229578 (2001-05-01), Acharya et al.
patent: 6233358 (2001-05-01), Acharya
patent: 6236433 (2001-05-01), Acharya et al.
patent: 6236765 (2001-05-01), Acharya
patent: 6269181 (2001-07-01), Acharya
patent: 6275206 (2001-08-01), Tsai et al.
patent: 6285796 (2001-09-01), Acharya et al.
patent: 6292114 (2001-09-01), Tsai et al.
patent: 6301392 (2001-10-01), Acharya
patent: 6348929 (2002-02-01), Acharya et al.
patent: 6351555 (2002-02-01), Acharya et al.
patent: 6356276 (2002-03-01), Acharya
patent: 6366692 (2002-04-01), Acharya
patent: 6366694 (2002-04-01), Acharya
patent: 6373481 (2002-04-01), Tan et al.
patent: 6377280 (2002-04-01), Acharya et al.
patent: 6381357 (2002-04-01), Tan et al.
patent: 6392699 (2002-05-01), Acharya
Print of World Wide Web page from National Institue of Technology, http://www.nist.gov/dads/HTML/datastructur.html date unknown.*
Hashemian.Memory efficient and high-speed search Huffman coding, IEEE Transactions on Communications, vol.: 43, Issue: 10, Oct. 1995, page(s): 2576-2581.

Affiliated with

Also associated with

Rating

Method of performing 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 Method of performing Huffman decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of performing Huffman decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3142275