Submitted: Sep 7, 2013; Accepted: Nov 6, 2013; Published: Nov 10, 2013 Abstract: This paper studies the joint video compression and encryption, which gains good attention in past couple of years due to its reduced computational complexity. In this paper, we present a multimedia data encryption scheme based on arithmetic coding, which we refer to as Random Chaotic Arithmetic Coding (RCAC). In RC...

This paper presents Group Testing for Wavelets (GTW), a novel embedded-wavelet-based image compression algorithm based on the concept of group testing. We explain how group testing is a generalization of the zerotree coding technique for wavelet-transformed images. We also show that Golomb coding is equivalent to Hwang's group testing algorithm. GTW is similar to SPIHT but replaces SPIHT's sign...

Context-Based Adaptive Binary Arithmetic Coding (CABAC) as a normative part of the new ITU-T/ISO/IEC standard H.264/AVC for video compression is presented. By combining an adaptive binary arithmetic coding technique with context modeling, a high degree of adaptation and redundancy reduction is achieved. The CABAC framework also includes a novel low-complexity method for binary arithmetic coding...

In this paper a new adaptive entropy coding scheme for video compression is presented. It utilizes an adaptive arithmetic coding technique to better match the first order entropy of the coded symbols and to keep track of nonstationary symbol statistics. In addition, remaining symbol redundancies will be exploited by context modeling to further reduce the bit-rate. A novel approach for coding of...

Arithmetic coding is a lossless compression algorithm with variable-length source coding. It is more flexible and efficient than the well-known Huffman coding. In this paper we present a non-adaptive FPGA implementation of a multi-alphabet arithmetic coding with separated statistical model of the data source. The alphabet of the data source is a 256-symbol ASCII character set and does not inclu...

Adaptive Binary Arithmetic coding is an effective mode of coding. In this paper we propose an efficient adaptive binary arithmetic coder, which is multiplication-free and look-up table free. To achieve this, we combine the probability estimation based on the virtual sliding window technique with the approximation of multiplication and the use of simple operations to calculate the next approxima...