Byte-based prefix encoding

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

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

341 67, 341106, H03M 740, H03M 700

Patent

active

059736267

ABSTRACT:
Two software-only prefix encoding techniques employ encoding look-up tables to produce contributions to the encoded bit stream that are incremented in integral numbers of bytes to facilitate accelerated encoding rates at the expense of an acceptable trade-off in increased memory size requirements. The first technique, referred to as offset-based encoding, employs encoding tables which eliminate most of the bit-based operations that need to be performed by a prefix encoder without inordinately expanding memory requirements. In offset-based encoding, a Huffman table is employed which contains information for each number of bits by which the length of a Huffman word is offset from an integral number of bytes. The encoding method generates bytes of encoded data, even though the Huffman code has variable length code words for each symbol to be encoded. The second technique, referred to as byte-based encoding, employs a byte-based Huffman encoding table which operates even faster than the offset-based encoding scheme because it does not employ any bit-based operations at all; however, this is achieved at the expense of a considerable expansion in memory requirements.

REFERENCES:
patent: 5208593 (1993-05-01), Tong et al.
patent: 5774081 (1998-06-01), Cheng et al.
Andrezej Sieminski, "Fast Decoding of the Huffman Codes," Information Processing Letters, pp. 237-241, (Jan. 11, 1988).
Shaw-Min Lei, "An Entropy Coding System for Digital HDTV Applications," IEEE Transactions on Circuits and Systems for Video Technology, vol. 1 (No. 1), pp. 147-155, (Mar. 1991).
Shih-Fu Chang et al., "Designing High-Throughput VLC Decoder, Part I-Concurrent VLSI Architectures," IEEE Transactions on Circuits and Systems for Video Technology, vol. 2 (No. 2), p. 187-196, (Jun., 1992).
Reza Hashemian, "Memory Efficient and High-Speed Search Huffman Coding," IEEE Transactions on Communications, vol. 43 (No. 10), pp. 2576-2581, (Oct., 1995).
Alistair Moffat, et al., "On the Implication of Minimum-Redundancy Prefix Codes," Proceedings of DCC 1996, pp. 170-179, (1996).

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

Byte-based prefix encoding does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Byte-based prefix encoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Byte-based prefix encoding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-769412

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