Data compression method

Details Data compression method Data compression method

1991-01-15

1993-12-07

Logan, Sharon D.

Coded data generation or conversion

Digital code to digital code converters

To or from code based on probability

341 51, 341 79, 341109, H03M 730, H03M 726

Patent

active

052686868

ABSTRACT:
The method is founded on the GUAZZO algorithm and is adaptive as it does not require any prior statistical knowledge of source of message to be coded. The message is comprised of a sequence of symbols of the source which are represented by the indication of the direction "0" or "1" chosen at each node of a binary tree. According to the invention, the adaptiveness is obtained by associating with each node two finite-sized counters that count the "0"s and "1"s according to the routing of the tree. The contents of these counters enable the conditional probability of each of the elements "0" and "1" to be estimated at the node.

REFERENCES:
patent: 4488143 (1984-12-01), Martin
patent: 4899149 (1990-02-01), Kahan
"A General Minimum-Redundancy Source-Coding Algorithm" by Mauro Guazzo, IEEE Transactions on Information Theory, vol. IT-26, No. 1, Jan., 1980, pp. 15-24.

Affiliated with

Also associated with

Rating

Data compression method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data compression method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data compression method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2018671