ABSTRACT: Entropy encoding is a term referring to lossless coding technique that replaces data elements with coded representations. Entropy encoding in combination with the transformation and quantization results in significantly reduced data size. For any conventional multimedia coding, entropy encoding is a bit assigning and lossless module. Since entropy encoding is a lossless module, compression ratio is the only constraint. Thus this paper develops a new entropy coding technique with higher compression ratio and minimum computational complexity. Huffman encoding and Arithmetic coding are well known entropy encoding method applied in JPEG and MPEG coding standards. In this paper, an efficient entropy encoding technique for multimedia coding is proposed. This proposed algorithm uses the concept of number of occurrence in a sequence of symbols. According to the rank of its occurrence, number of bits and groups are assigned and coded effectively. Based on the available channel band width, the appropriate bit-rate can also be achieved by using recursive property of our proposed encoding algorithm. Here two level of recursion has been considered for the proposed algorithm. The experiments were conducted in various multimedia data such as text, image, audio and video sequences. It is observed that the proposed algorithm outperforms the existing entropy encoding algorithms such as Huffman and arithmetic coding in terms of compressed file size, encoding and decoding time. Thus the proposal is very much suitable for multimedia applications.
Conference on Computational Intelligence and Multimedia Applications, 2007. International Conference on; 01/2008