Test Data Compression by Spilt-VIHC (SVIHC)

C. Giri, B. M. Rao, S. Chattopadhyay
{"title":"Test Data Compression by Spilt-VIHC (SVIHC)","authors":"C. Giri, B. M. Rao, S. Chattopadhyay","doi":"10.1109/ICCTA.2007.123","DOIUrl":null,"url":null,"abstract":"This paper suggests a new test data compression scheme that performs Huffman coding on different sections of test data file separately. It improves upon the single Huffman tree based approach by up to 6% in compression ratio, 29% in test application time, sacrificing only 6.1% in the decoder area. The scheme compares favourably with other works reported in the literature. While for most of the cases, it produces better compression ratios, the area requirements are much lesser than other contemporary works","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCTA.2007.123","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

This paper suggests a new test data compression scheme that performs Huffman coding on different sections of test data file separately. It improves upon the single Huffman tree based approach by up to 6% in compression ratio, 29% in test application time, sacrificing only 6.1% in the decoder area. The scheme compares favourably with other works reported in the literature. While for most of the cases, it produces better compression ratios, the area requirements are much lesser than other contemporary works
基于SVIHC的测试数据压缩
本文提出了一种新的测试数据压缩方案,对测试数据文件的不同部分分别进行霍夫曼编码。它在基于单霍夫曼树的方法的基础上提高了6%的压缩比,29%的测试应用时间,仅牺牲了6.1%的解码器面积。该方案与文献中报道的其他作品相比具有优势。虽然在大多数情况下,它产生更好的压缩比,但面积要求比其他当代作品要小得多
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信