面向VLSI测试动态降功耗的测试矢量重排序的人工智能方法

Sudip Roy, I. Gupta, A. Pal
{"title":"面向VLSI测试动态降功耗的测试矢量重排序的人工智能方法","authors":"Sudip Roy, I. Gupta, A. Pal","doi":"10.1109/TENCON.2008.4766747","DOIUrl":null,"url":null,"abstract":"As the feature size is scaled down with process technology advancement, power minimization has become a serious problem for the designers as well as the test engineers. Test vector reordering for dynamic power minimization during combinational circuit testing is a sub-problem of the general goal of low power testing. In this paper we have proposed an AI-based approach to order the test vectors in an optimal manner to minimize switching activity during testing. Empirically, the proposed algorithm yields on an average of about 22% reduction in switching activity over that given by a standard ATPG tool Synopsis TetraMax, which is also more than the reduction after applying existing Chained Lin-Kernighan heuristic.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Artificial intelligence approach to test vector reordering for dynamic power reduction during VLSI testing\",\"authors\":\"Sudip Roy, I. Gupta, A. Pal\",\"doi\":\"10.1109/TENCON.2008.4766747\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As the feature size is scaled down with process technology advancement, power minimization has become a serious problem for the designers as well as the test engineers. Test vector reordering for dynamic power minimization during combinational circuit testing is a sub-problem of the general goal of low power testing. In this paper we have proposed an AI-based approach to order the test vectors in an optimal manner to minimize switching activity during testing. Empirically, the proposed algorithm yields on an average of about 22% reduction in switching activity over that given by a standard ATPG tool Synopsis TetraMax, which is also more than the reduction after applying existing Chained Lin-Kernighan heuristic.\",\"PeriodicalId\":22230,\"journal\":{\"name\":\"TENCON 2008 - 2008 IEEE Region 10 Conference\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"TENCON 2008 - 2008 IEEE Region 10 Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TENCON.2008.4766747\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"TENCON 2008 - 2008 IEEE Region 10 Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.2008.4766747","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

随着工艺技术的进步,特征尺寸越来越小,功耗最小化已经成为设计人员和测试工程师面临的一个严重问题。组合电路测试中动态最小功耗测试矢量重排序是低功耗测试总目标的一个子问题。在本文中,我们提出了一种基于人工智能的方法,以最优方式对测试向量进行排序,以最小化测试期间的切换活动。根据经验,与标准的ATPG工具Synopsis TetraMax相比,该算法的开关活动平均减少了22%,这也比应用现有的Chained Lin-Kernighan启发式方法所减少的要多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Artificial intelligence approach to test vector reordering for dynamic power reduction during VLSI testing
As the feature size is scaled down with process technology advancement, power minimization has become a serious problem for the designers as well as the test engineers. Test vector reordering for dynamic power minimization during combinational circuit testing is a sub-problem of the general goal of low power testing. In this paper we have proposed an AI-based approach to order the test vectors in an optimal manner to minimize switching activity during testing. Empirically, the proposed algorithm yields on an average of about 22% reduction in switching activity over that given by a standard ATPG tool Synopsis TetraMax, which is also more than the reduction after applying existing Chained Lin-Kernighan heuristic.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信