Review on Lossless Compression Techniques

被引：9

作者：

Kotha, Harika Devi ^{[1
]}

Tummanapally, Madhumitha ^{[1
]}

Upadhyay, Vikash Kumar ^{[1
]}

机构：

[1] ICFAI Fdn Higher Educ FST, Dept ECE, Hyderabad, India

来源：

INTERNATIONAL CONFERENCE ON COMPUTER VISION AND MACHINE LEARNING | 2019年 / 1228卷

关键词：

Compression; Huffman coding; Arithmetic coding;

D O I：

10.1088/1742-6596/1228/1/012007

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In the present world data compression is used in every field. Through data compression the bits required to represent a message will be reduced. By compressing the given data, we can save the storage capacity, files are transferred at high speed, storage hardware is decreased so that its cost is also decreased, and storage bandwidth is decreased. There are many methods to compress the data. But in this paper, we are discussing about Huffman coding and Arithmetic coding. For various input streams we are comparing adaptive Huffman coding and arithmetic coding and we will observe which technique will be more efficient to compress the data.

引用

页数：6

共 11 条

[1] Chen B, 2007, PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, P2296
[2] DATA-COMPRESSION USING ADAPTIVE CODING AND PARTIAL STRING MATCHING
CLEARY, JG
WITTEN, IH
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1984, 32 (04) : 396 - 402
[3] Gailly Jean-loup, DATA COMPRESSION BOO
[4] Optimal selective Huffman coding for test-data compression
Kavousianos, Xrysovalantis
Kalligeros, Emmanouil
Nikolos, Dimitris
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2007, 56 (08) : 1146 - 1152
[5] Kodituwakku S. R., INDIAN J COMPUTER SC, V1
[6] AN OVERVIEW OF DATA-COMPRESSION TECHNIQUES
REGHBATI, HK
[J]. COMPUTER, 1981, 14 (04) : 71 - 75
[7] Sarkar SJ, 2015, ANNU IEEE IND CONF
[8] Sayood Khalid, INTRO DATA COMPRESSI, P91
[9] Sharma M, 2010, INT J COMPUT SCI NET, V10, P133
[10] Tharini C., 2009, Journal of Computer Sciences, V5, P466, DOI 10.3844/jcssp.2009.466.470

← 1 2 →