# Lossless Data Compression Techniques Essay

2246 Words9 Pages
Lossless Data Compression Techniques: A Case Study Meena kumari M.Tech CSE Deptt.BPSMV khanpur kalan (sonipat) E-Mail: meena.boora24@gmail.com

Abstract:
Compression is a technique of representing the information in a compact form. It is a most requirement technique for compressed the computerized application. It reduces the amount of data and also decrease transfer time. Data compression used in files storage and distributed system. There are two type of data compression “lossy” and “lossless” but this paper examines
…show more content…
Assign a 0 and 1 code word to the two branches of the tree on the path from the root. After the Huffman tree, the method creates a prefix code for each node from the alphabet by traversing the tree
Ex:
B 15
C 10
A 20
D 5 Building a Huffman code tree short the list in order the characters from highest to lowest frequency of occurrence as follows:

20 15 10 5
A B C D

Figure -2 Huffman algorithm

Tracing down the tree gives the "Huffman codes", with the shortest codes assigned to the characters with the greatest frequency: A 0 B 10 C 110 D 111

Advantages and disadvantages:

Huffman’s algorithm is generating less redundancy codes compared to other algorithms. It uses coding in text, image, video compression, and conferencing system such as, JPEG, MPEG-2, and MPEG-4 etc [9] .Compression ratio and memory space is low.

2.4 Arithmetic Coding:

It is more advanced than Huffman coding. Arithmetic coding changes the method of replacing each bit with a codeword. There for it replaces the string of input data with a single floating point number as an output. The main purpose of the algorithm is to given an interval to each potential bit data [10].
Basic arithmetic coding iteration: range = high -
…show more content…
Arup Kumar Bhattacharjee1, Tanumon Bej2, Saheb Agarwal3,”compression study of lossless data compression algorithm for text data” IOSR Journal of Computer Engineering (IOSR-JCE) e-ISSN: 2278-0661, p- ISSN: 2278-8727Volume 11, Issue 6, pp1-5 (May. - Jun. 2013), 4. Anmol Jyot Maan “Analysis and Comparison of Algorithms for Lossless Data Compression” International Journal of Information and Computation Technology. ISSN 0974-2239 Volume 3, 1-8, Number 3 (2013), pp. 139-146
5. Mohammed Al-laham1 & Ibrahiem M. M. El Emary2 “Comparative Study Between Various Algorithms of Data Compression Techniques” Proceedings of the World Congress on Engineering and Computer Science 2007 WCECS 2007, pp1-11, October 24-26, 2007, San Francisco, USA

6. Ajit Singh and Yogita Bhatnagar” Enhancement of Data Compression Using Incremental Encoding” International Journal of Scientific & Engineering Research, Volume 3, Issue 5,pp1-5 May-2012 1 ISSN 2229-5518

7. Amarjit Kaur Navdeep Singh Sethi Harinderpal Singh“A Review on Data Compression Techniques”International Journal of Advanced Research Computer Science and Software Engineering, Volume5, Issue 1, pp1-5, January 2015 ISSN: 2277 128X
8. Senthil Shanmugasundaram, Robert Lourdusamy, ”A comparative study of text compression algorithm” International Journal of Wisdom Based Computing,Vol. 1(3),pp 1-9 December