{"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