Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, termed “distributed arithmetic codin...
In this paper we give a short theoretical description of the general predictive adaptive arithmetic coding technique. The links between this technique and the works of J. Rissanen...
Guilhem Coq, Olivier Alata, Marc Arnaudon, Christi...
This paper examines the opportunity of using compression for accelerating the (re)configuration of FPGA devices, focusing on the choice of compression algorithms, and their hardwa...
Arithmetic coding is an efficient entropy compression method that achieves results close to the entropy limit and it is used in modern standards such as JPEG-2000 and H.264. Arith...
The arithmetic-coding-based communication system, Dasher, can be driven by a one-dimensional continuous signal. A belt-mounted breath-mouse, delivering a signal related to lung vol...
This paper addresses the issue of robust and joint source-channel decoding of quasiarithmetic codes. Quasi-arithmetic coding is a reduced precision and complexity implementation o...
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
Various error control schemes have been addressed in wireless video stream transmission. By combining an adaptive binary arithmetic coding technique with context modeling, CABAC a...
—This paper presents a new context modeling technique for arithmetic coding of DCT coefficients in video compression. A key feature of the new technique is the inclusion of all p...
Li Zhang, Xiaolin Wu, Ning Zhang, Wen Gao, Qiang W...
—The use of multiple entropy models for Huffman or arithmetic coding is widely used to improve the compression efficiency of many algorithms when the source probability distribu...