基于不兼容测试数据集的确定性向量聚类压缩

2009 International Test Conference Pub Date : 2009-12-18 DOI:10.1109/TEST.2009.5355555

Grzegorz Mrugalski, N. Mukherjee, J. Rajski, Dariusz Czysz, J. Tyszer

{"title":"基于不兼容测试数据集的确定性向量聚类压缩","authors":"Grzegorz Mrugalski, N. Mukherjee, J. Rajski, Dariusz Czysz, J. Tyszer","doi":"10.1109/TEST.2009.5355555","DOIUrl":null,"url":null,"abstract":"The presented compression scheme is a novel solution that is based on deterministic vector clustering and encompasses three data reduction features in one on-chip decoding system. The approach preserves all benefits of continuous flow decompression and offers compression ratios of order 1000x with encoding efficiency much higher than 1.00.","PeriodicalId":419063,"journal":{"name":"2009 International Test Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":"{\"title\":\"Compression based on deterministic vector clustering of incompatible test cubes\",\"authors\":\"Grzegorz Mrugalski, N. Mukherjee, J. Rajski, Dariusz Czysz, J. Tyszer\",\"doi\":\"10.1109/TEST.2009.5355555\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The presented compression scheme is a novel solution that is based on deterministic vector clustering and encompasses three data reduction features in one on-chip decoding system. The approach preserves all benefits of continuous flow decompression and offers compression ratios of order 1000x with encoding efficiency much higher than 1.00.\",\"PeriodicalId\":419063,\"journal\":{\"name\":\"2009 International Test Conference\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Test Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TEST.2009.5355555\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Test Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TEST.2009.5355555","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 29

摘要

所提出的压缩方案是一种基于确定性向量聚类的新颖解决方案，在一个片上解码系统中包含三个数据约简特征。该方法保留了连续流解压的所有优点，并提供了1000倍的压缩比，编码效率远高于1.00。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Compression based on deterministic vector clustering of incompatible test cubes

The presented compression scheme is a novel solution that is based on deterministic vector clustering and encompasses three data reduction features in one on-chip decoding system. The approach preserves all benefits of continuous flow decompression and offers compression ratios of order 1000x with encoding efficiency much higher than 1.00.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 International Test Conference

自引率

0.00%

发文量