Implementation of Data Compression Algorithms

Abstract

DataTcompressionTisTaTprocessTthatTreducesTtheTdataTsize,TremovingTtheTexcessive information andTredundancy.TWhyTshorterTdataTsequenceTisTmoreTsuitable?T–theTanswer is simple it reduces theTcost.TDataTcompressionTisTaTcommonTrequirementTforTmostTofTthe computerized application . DataTcompressionThasTimportantTapplicationTinTtheTareaTofTfileTstorageTand distributedTsystem. DataTcompressionTisTusedTinTmultimediaTfield,TtextTdocumentsTandTdata base table. Data compressionTmethodsTcanTbeTclassifiedTinTseveralTways.TOneTofTtheTmostTimportant criteria of classification isTwhether theTcompressionTalgorithmsTremoveTsomeTpartTofTdata,TwhichTcannot be recovered during decompression. The algorithm, which removes some part of data, is called loss data compression. And the algorithm that achieve the same what we compressed after decompressionTisTcalledTlosslessTdataTcompression.TTheTlossTdataTcompression algorithm isTusually usedTwhen aTperfect consistencyTwithTtheToriginalTdata is not necessary after decompression. Example ofTlossTdataTcompressionTisTcompressionTof video or picture data. Lossless data compressionTisTusedTinTtext file,Tdatabase tablesTandTinTmedical image because law ofTregulations. Various losslessTdata compression algorithm haveTbeen proposed andTused. Some ofTmainTtechniquesTare Huffman Coding,TRun LengthTEncoding, Arithmetic Encoding and DictionaryTBased Encoding.TInTthisTreport weTexamineTArithmeticTEncoding andTDictionary-basedTAlgorithmTandTgiveTcomparisonTbetweenTthemTaccording to their performances.”