Simulation of Fast Implementation of Arithmetic Coding

• Data compression is the art or science of representing information in a compact form.The Reason why we need data compression is that more and more of the information we use is in digital form represented by huge bytes of data.If we compress the data by halving the number of bytes,the bandwidth required is halved and the time required for transmission is also reduced.One such compression algorithm is the arithmetic coding technique.
  

• Our Project advances a new lossless data compression method by utilizing reversible data hiding to reduce compression times significantly and achieve good compression rates.Also the security is provided in the utilization of reversible data hiding technique.The Core idea of this new approach is to transform a longer binary sequence into two binary sub-sequences, and apply a lossless coding algorithm based on the fact that a shorter sequence obviously takes less time than a longer sequence.