A Novel Huffman Coding based Approach to Reduce the Size of Large Data Array

被引:0
作者
Sarkar, Subhra J. [1 ]
Sarkar, Nabendu Kr. [2 ]
Banerjee, Aritra [1 ]
机构
[1] Batanagar Inst Engg Management & Sci, Dept Elect Engn, Kolkata, India
[2] Haldia Inst Technol, Dept Elect Engn, Haldia, India
来源
PROCEEDINGS OF IEEE INTERNATIONAL CONFERENCE ON CIRCUIT, POWER AND COMPUTING TECHNOLOGIES (ICCPCT 2016) | 2016年
关键词
Data Compression; Huffman Coding; Data array; Compressed Array;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
While dealing with large data array required in various applications, the memory required for the data storage and data transfer of that bulk data becomes difficult. If the array size can be reduced without losing the data, the problem of storage and data transfer can be avoided. In this paper, a Huffman Coding based data compression algorithm is proposed and tested in MATLAB environment which will significantly reduce the size of one dimensional data array. Though the algorithm is tested with number array only, the algorithm can be extended to be applied with character array with slight modification.
引用
收藏
页数:5
相关论文
共 12 条
  • [1] [Anonymous], TAMKANG J SCI ENG
  • [2] [Anonymous], INDIAN J COMPUTER SC
  • [3] Brar R.S., 2013, International Journal of Advanced Research in Computer Science and Software Engineering, V3, P579
  • [4] Li ZN, 2014, TEXTS COMPUT SCI, P1, DOI 10.1007/978-3-319-05290-8
  • [5] Mathur Mridul Kumar, LOSSLESS HUFFMAN COD
  • [6] Patra Nilkesh, 2007, THESIS
  • [7] Pujar Jagadish H., NEW LOSSLESS METHOD
  • [8] Ratanaworabhan Paruj, FAST LOSSLESS COMPRE
  • [9] Sarkar Subhra J., 2016, 2 INT C CONTR INSTR
  • [10] Sarkar Subhra J., 2015, 12 IEEE IND INT C EL