Evaluation of Huffman and Arithmetic Algorithms for Multimedia Compression Standards

Details Evaluation of Huffman and Arithmetic Algorithms for Multimedia Compression Standards Evaluation of Huffman and Arithmetic Algorithms for Multimedia Compression Standards

2011-08-31

arxiv.org/abs/1109.0216v1

Computer Science

Information Theory

11 pages; http://airccse.org/journal/ijcsea/current.html International Journal of Computer Science, Engineering and Applicatio

Scientific paper

Compression is a technique to reduce the quantity of data without excessively reducing the quality of the multimedia data. The transition and storing of compressed multimedia data is much faster and more efficient than original uncompressed multimedia data. There are various techniques and standards for multimedia data compression, especially for image compression such as the JPEG and JPEG2000 standards. These standards consist of different functions such as color space conversion and entropy coding. Arithmetic and Huffman coding are normally used in the entropy coding phase. In this paper we try to answer the following question. Which entropy coding, arithmetic or Huffman, is more suitable compared to other from the compression ratio, performance, and implementation points of view? We have implemented and tested Huffman and arithmetic algorithms. Our implemented results show that compression ratio of arithmetic coding is better than Huffman coding, while the performance of the Huffman coding is higher than Arithmetic coding. In addition, implementation of Huffman coding is much easier than the Arithmetic coding.

Affiliated with

Also associated with

No associations

Rating

Evaluation of Huffman and Arithmetic Algorithms for Multimedia Compression Standards does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Evaluation of Huffman and Arithmetic Algorithms for Multimedia Compression Standards, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Evaluation of Huffman and Arithmetic Algorithms for Multimedia Compression Standards will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-626634