We give a simple proof characterizing the complexity of Pres-burger arithmetic augmented with additional predicates. We show that Pres-burger arithmetic with additional predicates is 1 1 complete. Adding one unary predicate is enough to get 1 1 hardness, while adding more predicates (of any arity) does not make the complexity any worse.

We describe a novel text compressor which combines Ziv-Lempel compression and arithmetic coding with a form of vector quantisation. The resulting compressor resembles an LZ-77 compressor, but with no explicit phrase lengths or coding for literals. An examination of the limitations on its performance leads to some predictions of the limits of LZ-77 compression in general, showing that the LZ-77 ...

A novel system for representing the rational numbers based on Hensel's p-adic arithmetic is proposed. The new scheme uses a compact variable-length encoding that may be viewed as a generalization of radix complement notation. It allows exact arithmetic, and approximate arithmetic under programmer control. It is superior to existing coding methods because the arithmetic operations take particula...

The H.264/AVC is the most recent standard of video compression/decompression for future broadband network. This standard was developed through the Joint Video Team (JVT) from the ITU-T Video Coding Experts Group and the ISO/IEC MPEG standardization committee. In this project H.264 decoder functional block such as Context based Binary arithmetic coding (CABAC), Inverse Quantization and Inverse D...

This paper proposes the cascading of two algorithms that combines the features of both PDLZW and Arithmetic coding and also compares this with deflate which is a cascading of LZ77 and Huffman Coding. In PDLZW algorithm, the dictionary is divided into several dictionaries based on the size of the words. With the hierarchical parallel dictionary set, the search time can be reduced significantly. ...

A mixed-framework adaptive arithmetic coding technique is introduced in which the probability estimation process dynamically switches among a set of allowed models; the sequence of model choices is determined jointly with the relative data segmen-tation to yield the optimal coding performance for the given set of predictors. A speciic application is detailed in which the arithmetic coder can sw...

We present below our first implementation results on a modular arithmetic library for cryptography on GPUs. Our library, in C++ for CUDA, provides modular arithmetic, finite field arithmetic and some ECC support. Several algorithms and memory coding styles have been compared: local, shared and register. For moderate sizes, we report up to 2.6 speedup compared to state-of-the-art library.

An edge coding scheme based on chain code representation in a multiresolution image coding context is presented. Our method enhances the coding schemes that describe the source structure with Markov models, by using also an a priori knowledge from the previous decoded resolution images. Experiments using adaptive arithmetic coding have shown up to a 5% improvement for the bitrate compared to a ...

MPEG-4 is the most recent standard for audio-visual representation to be published by the International Organization for Standardization. One of the many new features of MPEG-4 is its ability to represent two-dimensional video objects of arbitrary shape. For this purpose, MPEG-4 uses the conventional motioncompensated discrete cosine transform syntax for color/texture coding and augments this w...