Adaptive computation of symbol probabilities in n-ary strings

作者: Paul D. Healey , Jorma J. Rissanen

DOI:

关键词: MathematicsDiscrete mathematicsString (computer science)Character (computing)Interval (graph theory)String-to-string correction problemValue (computer science)Position (vector)Symbol (chemistry)Binary numberCombinatorics

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

参考文章(16)
Daniel I. Barnea, Lalit R. Bahl, Hisashi Kobayashi, David D. Grossman, Finite memory adaptive predictor ,(1973)
Joan Laverne Mitchell, William Boone Pennebaker, Probability adaptation for arithmetic coders ,(1988)
Christosdoulos Chamzas, Donald L. Duttweiler, Method and apparatus for carry-over control in arithmetic entropy coding ,(1990)
Christodoulos Chamzas, Donald L. Duttweiler, Entropy encoder/decoder including a context extractor ,(1989)
Gerald Goertzel, Joan L. Mitchell, William B. Pennebaker, Log encoder/decorder system ,(1987)
Joan Laverne Mitchell, Cesar A. Gonzales, William B. Pennebaker, Adaptive graylevel image compression system ,(1987)
Joan L. Mitchell, Glen G. Langdon, Jorma J. Rissanen, William B. Pennebaker, Arithmetic coding encoder and decoder system ,(1988)