A new data structure for cumulative frequency tables
Software—Practice & Experience
An empirical evaluation of coding methods for multi-symbol alphabets
Information Processing and Management: an International Journal - Special issue: data compression
Information Processing and Management: an International Journal - Special issue: data compression
Arithmetic coding for data compression
Communications of the ACM
Min-max compression methods for medical image databases
ACM SIGMOD Record
The centroid method for compressing sets of similar images
Pattern Recognition Letters
Bayesian networks for lossless dataset compression
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Progressive compressive and transmission of arbitrary triangular meshes
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
An analysis of the Burrows—Wheeler transform
Journal of the ACM (JACM)
A general-purpose compression scheme for large collections
ACM Transactions on Information Systems (TOIS)
Shell Representation and Compression Conscious Manipulation for Three Dimensional Graphical Datasets
TPCG '03 Proceedings of the Theory and Practice of Computer Graphics 2003
Low Delay Perceptually Lossless Coding of Audio Signals
DCC '01 Proceedings of the Data Compression Conference
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
The Effects of XML Compression on SOAP Performance
World Wide Web
Reducing coding redundancy in LZW
Information Sciences: an International Journal
Decoding-aware compression of FPGA bitstreams
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Digital hologram compression using correlation of reconstructed object images
PSIVT'11 Proceedings of the 5th Pacific Rim conference on Advances in Image and Video Technology - Volume Part II
| Hi-index | 0.00 |
During its long gestation in the 1970s and early 1980s, arithmetic coding was widely regarded more as an academic curiosity than a practical coding technique. One factor that helped it gain the popularity it enjoys today was the publication in 1987 of source code for a multi symbol arithmetic coder in Communications of the ACM. Now (1995), our understanding of arithmetic coding has further matured, and it is timely to review the components of that implementation and summarise the improvements that we and other authors have developed since then. We also describe a novel method for performing the underlying calculation needed for arithmetic coding. Accompanying the paper is a "Mark II" implementation that incorporates the improvements we suggest. The areas examined include: changes to the coding procedure that reduce the number of multiplications and divisions and permit them to be done to low precision; the increased range of probability approximations and alphabet sizes that can be supported using limited precision calculation; data structures for support of arithmetic coding on large alphabets; the interface between the modelling and coding subsystems; the use of enhanced models to allow high performance compression. For each of these areas, we consider how the new implementation differs from the CACM package.