Bit-stream huffman coding for data compression

Details Bit-stream huffman coding for data compression Bit-stream huffman coding for data compression

2008-09-04

2010-06-15

Young, Brian (Department: 2819)

Coded data generation or conversion

Digital code to digital code converters

To or from number of pulses

C341S050000

Reexamination Certificate

active

07737870

ABSTRACT:
Bit-stream Huffman coding may be used for data compression to quickly and efficiently compress relatively small and large datasets. A symbol used in data compression may not be a byte or 8 bits. Rather it has any number of bits. For a certain dataset, a symbol has a dynamic number of bits according to the data size. A symbol may have less than 8 bits for a small dataset, or more than 8 bits for a large dataset. For rapid processing, a large dataset may be broken into smaller datasets that are fast encoded in parallel. Accordingly, the Huffman encoding inputs from a bit-stream instead of a conventional byte-stream and outputs a bit-stream. In particular, bit-stream Static and Adaptive Huffman codings are presented with extended algorithms. Hardware implementation with parallel Huffman encoders and decoders is also illustrated for fast network data compression.

REFERENCES:
patent: 4906991 (1990-03-01), Fiala et al.
patent: 5583500 (1996-12-01), Allen et al.
patent: 7538696 (2009-05-01), Laker et al.

Affiliated with

Also associated with

Rating

Bit-stream huffman coding for data compression does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Bit-stream huffman coding for data compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bit-stream huffman coding for data compression will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4170400