This paper presents a fast context-based adaptive variable-length decoding (CAVLD) method of H.264/AVC with a very long instruction word-based bitstream processing unit (BsPU) designed for entropy decoding of multiple video formats. A new table mapping algorithm for the coeff_token, level, and run_before syntax elements of the quantized transform coefficients is proposed, and many branch operat...

A new method for lossless coding of the classiication table in low bit rate subband image coders with block-wise classiication is proposed. The method is referred to as hierarchical enumeration and uses an algorithmic enumeration technique to associate a xed-length unique binary code-word with each possible combination of integers deening the classiication table. The resulting bit rate is less ...

The lossless entropy coding used in many image coding schemes often is overlooked as most research is based around the lossy stages of image compression. This paper examines the relative merits of using static Huffman coding with a compact optimal table verses more sophisticated adaptive arithmetic methods. For very low bit rate image compression, the computationally simple Huffman method is sh...

In this paper an eecient open addressing hash function called exponential hashing is developed using concepts from dynamical systems theory and number theory. A comparison of exponential hashing versus a widely-used double hash function is performed using an analysis based on Lya-punov exponents and entropy. Proofs of optimal table parameter choices are provided for a number of hash functions. ...