Method of constructing an approximated dynamic Huffman table...

Coded data generation or conversion – Digital code to digital code converters – To or from number of pulses

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C382S239000

Reexamination Certificate

active

07834781

ABSTRACT:
A novel and useful method of constructing a fast approximation of a dynamic Huffman table from a data sample comprising a subset of data to be compressed. The frequency of incidence of each symbol in the sample is calculated, and the symbols are then allocated to predefined bins based on their frequency of incidence. The bins are then transformed into binary sub-trees, where the leaf nodes of the binary sub-trees comprise the symbols of the bin associated with the binary sub-trees. The binary sub-trees are then combined via nesting, thereby creating a coarse grained binary tree, where all leaves are mapped to a specified number of depths. The coarse grained binary tree is then traversed, thereby yielding a canonical code for each symbol, thereby defining the entries for a dynamic Huffman table.

REFERENCES:
patent: 5748121 (1998-05-01), Romriell
patent: 5848195 (1998-12-01), Romriell
patent: 5959560 (1999-09-01), Said et al.
patent: 5970177 (1999-10-01), Chinnock
patent: 6701020 (2004-03-01), Chrysafis et al.
patent: 6903668 (2005-06-01), Dror et al.
patent: 7609182 (2009-10-01), Owsley et al.
patent: 7692561 (2010-04-01), Biran et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFUS-PAI-O-4219627

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.