A Comparative Study Of Arthimetic Coding Compression Algorithm

Electronics and communication Engineering

Information Compression is the science and craft of speaking to data in a reduced structure. For quite a long time, Information pressure has been one of the basic empowering advancements for the progressing computerized interactive media unrest. There are part of information pressure calculations which are accessible to pack records of various configurations. This paper gives an overview of various fundamental lossless information pressure calculations. Trial results and correlations of the lossless pressure calculations utilizing Measurable pressure systems and Dictionary based pressure methods were performed on content information. Among the factual coding systems the calculations such as Shannon-Fano Coding, Huffman coding, Adaptive Huffman coding, Run Length Encoding and Arithmetic coding are considered. Arithmetic coding is a data compression technique that encodes data (the data string) by creating a code string which represents a fractional value on the number line between 0 and 1. The coding algorithm is symbol wise recursive; i.e., it operates upon and encodes (decodes) one data symbol per iteration or recursion.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.