A novel Huffman coding based approach to reduce the size of large data array

S. Sarkar, Nabendu Kr. Sarkar, A. Banerjee
{"title":"A novel Huffman coding based approach to reduce the size of large data array","authors":"S. Sarkar, Nabendu Kr. Sarkar, A. Banerjee","doi":"10.1109/ICCPCT.2016.7530355","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":431894,"journal":{"name":"2016 International Conference on Circuit, Power and Computing Technologies (ICCPCT)","volume":"02 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Circuit, Power and Computing Technologies (ICCPCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCPCT.2016.7530355","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

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.
一种新颖的基于Huffman编码的大数据数组缩减方法
在处理各种应用程序所需的大型数据阵列时,数据存储和数据传输所需的内存变得困难。如果可以在不丢失数据的情况下减小数组大小,则可以避免存储和数据传输问题。本文提出了一种基于霍夫曼编码的数据压缩算法,并在MATLAB环境下进行了测试,该算法可以显著减小一维数据数组的大小。虽然该算法只测试了数字数组,但稍加修改,该算法可以扩展到字符数组。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信