Complexity Reduction of the Context-Tree Weighting Method (1997) [4 citations — 1 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Frans M. J. Willems and Tjalling J. Tjalkens},
title = {Complexity Reduction of the Context-Tree Weighting Method},
booktitle = {In 18th Benelux Symposium on Information Theory},
year = {1997},
pages = {123--130}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
We present a method to decrease the storage and communication complexity of the context-tree weighting method. This method is based on combining the estimated probability of a node in the context tree and weighted probabilities of its children in one single variable. This variable is represented by its logarithm. 1 Introduction, standard implementation The context-tree weighting (CTW) method was proposed in [4] as a universal source coding algorithm for binary tree sources 1 . It was shown for this method that optimal redundancy behavior, in the sense of Rissanen[2], was achieved with a storage and computational complexity that were both linear in the source sequence length T . In the basic paper accuracy effects were not studied. However in [6] it was demonstrated that a finite accuracy implementation exists with an analyzable behavior. As expected we get a redundancy increase which is smaller if we are ready to increase the accuracy of the computations. This implementation however...
Citations
| 202 | Universal coding, information, prediction, and estimation – Rissanen - 1984 |
| 80 | The performance of universal encoding – Krichevsky, Trofimov - 1981 |
| 54 | The context tree weighting method: Basic properties – Willems, Shtarkov, et al. - 1995 |
| 3 | Efficient and Fast Data Compression Codes for Discrete Sources with Memory – Tjalkens - 1987 |
| 2 | Implementing the Context-Tree Weighting Method," Abstracts 1996 – Willems |
| 1 | Reflections on the Prize Paper: The Context Tree Weighting Method: Basic properties – Willems, Shtarkov, et al. - 1997 |
