Coded data generation or conversion – Digital code to digital code converters – To or from number of pulses
Reexamination Certificate
2001-08-30
2004-08-17
Young, Brian (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
To or from number of pulses
C341S067000
Reexamination Certificate
active
06778107
ABSTRACT:
BACKGROUND
1. Field
This disclosure relates to Huffman decoding.
2. Background Information
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 (Institute of Electrical and Radio Engineers), 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: 4646061 (1987-02-01), Bledsoe
patent: 4700175 (1987-10-01), Bledsoe
patent: 4899149 (1990-02-01), Kahan
patent: 5329313 (1994-07-01), Keith
patent: 5467088 (1995-11-01), Kinouchi et al.
patent: 5559831 (1996-09-01), Keith
patent: 5615020 (1997-03-01), Keith
patent: 5696563 (1997-12-01), Rosenberg
patent: 5970177 (1999-10-01), Chinnock
patent: 5973626 (1999-10-01), Berger et al.
patent: 6292114 (2001-09-01), Tsai et al.
patent: 6297754 (2001-10-01), Miyasaka et al.
patent: 6563439 (2003-05-01), Acharya et al.
Acharya et al., A Method of Performing Huffman Decoding, Oct. 31, 2002.*
U.S. patent application Ser. No. 09/704,380, Acharya, et al., filed Oct. 31, 2000.
U.S. patent application Ser. No. 09/704,392, Acharya, et al., filed Oct. 31, 2000.
U.S. patent application Ser. No. 09/705,314, Acharya, et al. filed Nov. 3, 2000.
Tsai Ping-Sing
Wang Wen-Shan
Nguyen John B
Steiner Paul E.
Young Brian
LandOfFree
Method and apparatus for huffman decoding technique 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 apparatus for huffman decoding technique, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for huffman decoding technique will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3343415