Adaptive computation of symbol probabilities in n-ary strings

Details Adaptive computation of symbol probabilities in n-ary strings Adaptive computation of symbol probabilities in n-ary strings

1992-11-20

1994-10-18

Young, Brian K.

Coded data generation or conversion

Digital code to digital code converters

To or from code based on probability

H03M 700

Patent

active

053572505

ABSTRACT:
A method and apparatus are provided for adaptively and predictively determining probabilities of occurrence for each symbol of a finite alphabet within a symbol string. A plurality of intervals are defined over a portion of the symbol string. As successive new symbols are added to the string, they enter the intervals, and old symbols pass out of the intervals. A probability for each symbol of the alphabet is maintained and updated by the following process. For each new symbol which enters the intervals, it is determined whether the new symbol is a given character of the alphabet, and whether each old symbol leaving each interval is the given character. Accordingly, the number of occurrences of the given character within each interval may change. A probability update value is determined, having a component from each interval determined by whether the number of occurrences of the given character in that interval changed. Preferably the update value is a binary number having a bit position corresponding to each interval. The probability of occurrence of the given symbol is updated using the probability update value.

REFERENCES:
patent: 3769453 (1973-10-01), Bahl et al.
patent: 4325085 (1982-04-01), Gooch
patent: 4355306 (1982-10-01), Mitchell
patent: 4516246 (1985-05-01), Kenemuth
patent: 4591908 (1986-05-01), Hirano
patent: 4633490 (1986-12-01), Goertzel et al.
patent: 4725885 (1988-02-01), Gonzales et al.
patent: 4785356 (1988-11-01), Gonzales et al.
patent: 4791403 (1988-12-01), Mitchell et al.
patent: 4862167 (1989-08-01), Copeland, III
patent: 4891643 (1990-01-01), Mitchell et al.
patent: 4905297 (1990-02-01), Langdon, Jr. et al.
patent: 4933883 (1990-06-01), Pennebaker et al.
patent: 4935882 (1990-06-01), Pennebaker et al.
patent: 4973961 (1990-11-01), Chamzas et al.
patent: 5023611 (1991-06-01), Chamzas et al.
patent: 5025258 (1991-06-01), Duttweiler
Adaptive Model for Nonstationary Sources, IBM Technical Disclosure Bulletin, vol. 28, No. 11, Apr. 1986.
J. Rissanen, Stochastic Complexity, Journal of the Royal Statistical Society, Series B, vol. 49, No. 3, 1987.

Affiliated with

Also associated with

Rating

Adaptive computation of symbol probabilities in n-ary strings does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Adaptive computation of symbol probabilities in n-ary strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive computation of symbol probabilities in n-ary strings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2375482