Heuristic Search based Test Pattern Compression Scheme

M. Baráth, S. Asha Pon, V. Jeyalakshmi
{"title":"Heuristic Search based Test Pattern Compression Scheme","authors":"M. Baráth, S. Asha Pon, V. Jeyalakshmi","doi":"10.1109/ICNWC57852.2023.10127249","DOIUrl":null,"url":null,"abstract":"VLSI testing becomes a mandatory process with invention of system-on chip to ensure device reliability. To assure the effectiveness of system-on chip, larger test data volume are required. This leads to excessive power consumption and also increases the device testing time. Additionally, larger memory is required to store this enormous test data. Hence, to overcome these drawbacks test data volume has to be reduced. This paper proposes a test data compression scheme based on Genetic algorithm to minimize test power. Test power minimization is accomplished by reducing hamming distance among test patterns. Proposed algorithm is implemented in c17 ISCAS’85 benchmark combinational circuit. Experimental result shows that 67.74% reduction on test pattern count and 49.35% reduction in hamming distance is observed.","PeriodicalId":197525,"journal":{"name":"2023 International Conference on Networking and Communications (ICNWC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Networking and Communications (ICNWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNWC57852.2023.10127249","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

VLSI testing becomes a mandatory process with invention of system-on chip to ensure device reliability. To assure the effectiveness of system-on chip, larger test data volume are required. This leads to excessive power consumption and also increases the device testing time. Additionally, larger memory is required to store this enormous test data. Hence, to overcome these drawbacks test data volume has to be reduced. This paper proposes a test data compression scheme based on Genetic algorithm to minimize test power. Test power minimization is accomplished by reducing hamming distance among test patterns. Proposed algorithm is implemented in c17 ISCAS’85 benchmark combinational circuit. Experimental result shows that 67.74% reduction on test pattern count and 49.35% reduction in hamming distance is observed.
基于启发式搜索的测试模式压缩方案
随着系统级芯片的发明,为了保证器件的可靠性,VLSI测试成为一项必不可少的过程。为了保证片上系统的有效性,需要更大的测试数据量。这将导致过度的功耗,也增加了设备的测试时间。此外,需要更大的内存来存储这些庞大的测试数据。因此,为了克服这些缺点,必须减少测试数据量。提出了一种基于遗传算法的测试数据压缩方案,使测试功率最小化。测试功率最小化是通过减少测试模式之间的汉明距离来实现的。该算法在c17iscas’85基准组合电路中实现。实验结果表明,测试模式数减少67.74%,汉明距离减少49.35%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信