System and method for fast huffman decoding

H - Electricity – 03 – M

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

H03M 7/40 (2006.01) H03M 7/42 (2006.01)

Patent

CA 2123435

Abstract A method is provided for performing statistical decod- ing if a symbol in a data stream having byte boundaries wherein the symbol may have varying alignments with respect to the byte boundaries. The next byte of data is fetched from the data stream wherein the fetched byte contains at least a portion of the symbol. Based on this byte and on the current bit position, which is maintained by a state machine, either (a) a decoded value is obtained from a lookup table, or (b) further bytes are fetched and used to determine the decoded value. Each symbol has a prefix and free bits wherein the entire symbol may be included in the next byte, a boundary of the next byte may fall within a prefix, or a boundary of the next byte may fall within the free bits depending on the alignment of the symbol. Differing action routines, corresponding to differing symbols, may be selected for execution according to the decoded values determined in the symbols.

LandOfFree

Say what you really think

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

Rating

System and method for fast 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 System and method for fast huffman decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for fast huffman decoding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1587163

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