Prediction of actual symbol probability is crucial for statistical data compression that uses arithmetic coder. Krichevsky-Trofimov (KT) estimator has been a standard predictor and applied in CTW or FWCTW methods. However, KT-estimator performs poorly when non occurring symbols appear. To rectify this we proposed a zero-redundancy estimator, especially with a finite window(Rashid and Kawabata, ISIT2003) for non stationary source. In this paper, we analyze the zero-redundancy estimators in the case of Markovian source and give an asymptotic evaluation of the redundancy. We show that one of the estimators has the per symbol redundancy given by one half of the dimension of positive parameters divided by the window size when the window size is large.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Mohammad M. RASHID, Tsutomu KAWABATA, "Analysis of Zero-Redundancy Estimator with a Finite Window for Markovian Source" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 10, pp. 2819-2825, October 2005, doi: 10.1093/ietfec/e88-a.10.2819.
Abstract: Prediction of actual symbol probability is crucial for statistical data compression that uses arithmetic coder. Krichevsky-Trofimov (KT) estimator has been a standard predictor and applied in CTW or FWCTW methods. However, KT-estimator performs poorly when non occurring symbols appear. To rectify this we proposed a zero-redundancy estimator, especially with a finite window(Rashid and Kawabata, ISIT2003) for non stationary source. In this paper, we analyze the zero-redundancy estimators in the case of Markovian source and give an asymptotic evaluation of the redundancy. We show that one of the estimators has the per symbol redundancy given by one half of the dimension of positive parameters divided by the window size when the window size is large.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.10.2819/_p
Copy
@ARTICLE{e88-a_10_2819,
author={Mohammad M. RASHID, Tsutomu KAWABATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Analysis of Zero-Redundancy Estimator with a Finite Window for Markovian Source},
year={2005},
volume={E88-A},
number={10},
pages={2819-2825},
abstract={Prediction of actual symbol probability is crucial for statistical data compression that uses arithmetic coder. Krichevsky-Trofimov (KT) estimator has been a standard predictor and applied in CTW or FWCTW methods. However, KT-estimator performs poorly when non occurring symbols appear. To rectify this we proposed a zero-redundancy estimator, especially with a finite window(Rashid and Kawabata, ISIT2003) for non stationary source. In this paper, we analyze the zero-redundancy estimators in the case of Markovian source and give an asymptotic evaluation of the redundancy. We show that one of the estimators has the per symbol redundancy given by one half of the dimension of positive parameters divided by the window size when the window size is large.},
keywords={},
doi={10.1093/ietfec/e88-a.10.2819},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Analysis of Zero-Redundancy Estimator with a Finite Window for Markovian Source
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2819
EP - 2825
AU - Mohammad M. RASHID
AU - Tsutomu KAWABATA
PY - 2005
DO - 10.1093/ietfec/e88-a.10.2819
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2005
AB - Prediction of actual symbol probability is crucial for statistical data compression that uses arithmetic coder. Krichevsky-Trofimov (KT) estimator has been a standard predictor and applied in CTW or FWCTW methods. However, KT-estimator performs poorly when non occurring symbols appear. To rectify this we proposed a zero-redundancy estimator, especially with a finite window(Rashid and Kawabata, ISIT2003) for non stationary source. In this paper, we analyze the zero-redundancy estimators in the case of Markovian source and give an asymptotic evaluation of the redundancy. We show that one of the estimators has the per symbol redundancy given by one half of the dimension of positive parameters divided by the window size when the window size is large.
ER -