Coded data generation or conversion – Digital code to digital code converters – To or from variable length codes
Patent
1997-12-04
1998-11-24
Williams, Howard L.
Coded data generation or conversion
Digital code to digital code converters
To or from variable length codes
H03M 740
Patent
active
058413812
ABSTRACT:
Decompression of Huffman encoded data is obtained by calculating, from a sequence of bits which includes a Huffman code to be decoded, a code length and a code number of the Huffman code to be decoded. The code number is determined based on the rank of the Huffman code when compared to plural other reference Huffman codes with respect to relative probabilities of occurrence. A conversion of the code number into a fixed-length decoded code corresponding to a code which has been encoded is also provided. Corresponding compression of data is obtained by converting a fixed-length code to be encoded into a code number, the code number being determined based on the rank of the Huffman code when compared to plural other reference Huffman codes with respect to relative probabilities of occurrence. By calculation from the code number, a Huffman code to be output and a code length of the Huffman code are then generated.
REFERENCES:
patent: 4475174 (1984-10-01), Kanayama
patent: 4516246 (1985-05-01), Kenemuth
patent: 4700175 (1987-10-01), Bledsoe
patent: 4899149 (1990-02-01), Kahan
patent: 5696507 (1997-12-01), Nam
patent: 5714949 (1998-02-01), Watabe
Canon Kabushiki Kaisha
Williams Howard L.
LandOfFree
Huffman coding/decoding using an intermediate code number 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 coding/decoding using an intermediate code number, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Huffman coding/decoding using an intermediate code number will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1707916