2016 International Conference on Circuit, Power and Computing Technologies (ICCPCT) 2016
DOI: 10.1109/iccpct.2016.7530355
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(6 citation statements)
references
References 5 publications
0
6
0
Order By: Relevance
“…CR is the ratio of actual and compressed data size which is an important parameter to determine the effectiveness of any compression algorithm. Higher will be the CR, better will be the compression algorithm [17,21]. It is obvious that CR achieved by lossy compression techniques is higher than that achieved by lossless techniques.…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…CR is the ratio of actual and compressed data size which is an important parameter to determine the effectiveness of any compression algorithm. Higher will be the CR, better will be the compression algorithm [17,21]. It is obvious that CR achieved by lossy compression techniques is higher than that achieved by lossless techniques.…”
Section: Methodsmentioning
confidence: 99%
“…It is obvious that CR achieved by lossy compression techniques is higher than that achieved by lossless techniques. Huffman coding and basic arithmetic coding-based algorithms developed in [17,18] can achieve CR in the order of 2 and 3, respectively, when tested with practical unit commitment data.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Das [ 22 ] proposed four arithmetic coding schemes for compressing power data. Sarkar [ 23 , 24 ] developed two compression algorithms based on Huffman and basic arithmetic coding for compressing combined data arrays. However, the performance of these traditional entropy coding algorithms should be improved.…”
Section: Related Workmentioning
confidence: 99%