An Effective and Simple Heuristic for Analog Test Point Selection

Huajun Lei, Kaiyu Qin
{"title":"An Effective and Simple Heuristic for Analog Test Point Selection","authors":"Huajun Lei, Kaiyu Qin","doi":"10.1109/ISCID.2013.14","DOIUrl":null,"url":null,"abstract":"An important problem that arises in the area of fault diagnosis and circuit testing is the analog test point selection (ATPS), which is known to be NP-hard. In this paper, we present a new approach for the ATPS problem based on greedy randomized adaptive search procedure (GRASP), with the objective of overcoming the shortcoming of the greedy algorithms which are easily getting trapped into local optima. The proposed method first generates a feasible test point set by introducing randomness into greedy algorithm, and then a local search algorithm is designed to further improve the quality of the test point set got before. The efficiency of the proposed algorithm is demonstrated by a benchmark circuit. Results indicate that the proposed method, compared with other ATPS methods, more efficiently and more accurately finds the optimum set of test points.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Sixth International Symposium on Computational Intelligence and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID.2013.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

An important problem that arises in the area of fault diagnosis and circuit testing is the analog test point selection (ATPS), which is known to be NP-hard. In this paper, we present a new approach for the ATPS problem based on greedy randomized adaptive search procedure (GRASP), with the objective of overcoming the shortcoming of the greedy algorithms which are easily getting trapped into local optima. The proposed method first generates a feasible test point set by introducing randomness into greedy algorithm, and then a local search algorithm is designed to further improve the quality of the test point set got before. The efficiency of the proposed algorithm is demonstrated by a benchmark circuit. Results indicate that the proposed method, compared with other ATPS methods, more efficiently and more accurately finds the optimum set of test points.
一种简单有效的模拟测试点选择启发式方法
在故障诊断和电路测试领域中,模拟测试点选择(ATPS)是一个重要的问题,它被称为np困难。为了克服贪心算法容易陷入局部最优的缺点,提出了一种基于贪心随机自适应搜索过程(GRASP)的ATPS问题求解方法。该方法首先在贪心算法中引入随机性,生成可行的测试点集,然后设计局部搜索算法,进一步提高得到的测试点集的质量。通过一个基准电路验证了该算法的有效性。结果表明,与其他的ATPS方法相比,该方法更有效、更准确地找到最优测试点集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信