Method of building an adaptive huffman codeword tree

Details Method of building an adaptive huffman codeword tree Method of building an adaptive huffman codeword tree

1998-05-29

2000-03-21

Young, Brian

Coded data generation or conversion

Digital code to digital code converters

To or from number of pulses

341 67, H03M 740

Patent

active

060407905

ABSTRACT:
Many compression algorithms require the compressor to generate trees (tables) for encoding purposes. To generate the optimum tree for a set of Huffman symbols either takes too much time or requires too much hardware. This invention proposes to separate the symbols into groups according to the symbol's occurring frequency. With these groups of symbols available, subsequent code length assignment of these groups can be done without a complete sorting of all the symbols and their parents. During code length assignment, some relocation of individual symbols from one group to another can also be performed to optimize the Huffman table. In most of the cases this technique can achieve a compression ratio within 5% of the optimum Huffman table, while requiring less hardware or software overhead.

REFERENCES:
patent: 5432512 (1995-07-01), Park
patent: 5696507 (1997-12-01), Nam

Affiliated with

Also associated with

Rating

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

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-733835