High quality atpg for delay defects

Puneet Gupta, M. Hsiao
{"title":"High quality atpg for delay defects","authors":"Puneet Gupta, M. Hsiao","doi":"10.1109/TEST.2003.1270885","DOIUrl":null,"url":null,"abstract":"The paper presents a novel technique for generating effective vectors for delay defects. The test set achieves high path delay fault coverage to capture small- distributed delay defects and high transition fault coverage to capture gross delay defects. Furthermore, non-robust paths for ATPG are filtered (selected) carefully so that there is a minimum overlap with the already tested robust paths. A relationship between path delay fault model and transition fault model has been observed which helps us reduce the number of non-robust paths considered for test generation. To generate tests for robust and non-robust paths, a deterministic ATPG engine is developed. Clustering of paths has been done in order to improve the test set quality. Implications were used to identify the untestable paths. Finally an incremental propagation based ATPG is used for transition faults. Results for ISCAS'85 and full-scan ISCAS'89 benchmark circuits show that the filtered non- robust path set can be reduced to 40% smaller than the conventional path set without losing delay defect coverage. Clustering reduces vector size in average by about 40%.","PeriodicalId":236182,"journal":{"name":"International Test Conference, 2003. Proceedings. ITC 2003.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Test Conference, 2003. Proceedings. ITC 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TEST.2003.1270885","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

The paper presents a novel technique for generating effective vectors for delay defects. The test set achieves high path delay fault coverage to capture small- distributed delay defects and high transition fault coverage to capture gross delay defects. Furthermore, non-robust paths for ATPG are filtered (selected) carefully so that there is a minimum overlap with the already tested robust paths. A relationship between path delay fault model and transition fault model has been observed which helps us reduce the number of non-robust paths considered for test generation. To generate tests for robust and non-robust paths, a deterministic ATPG engine is developed. Clustering of paths has been done in order to improve the test set quality. Implications were used to identify the untestable paths. Finally an incremental propagation based ATPG is used for transition faults. Results for ISCAS'85 and full-scan ISCAS'89 benchmark circuits show that the filtered non- robust path set can be reduced to 40% smaller than the conventional path set without losing delay defect coverage. Clustering reduces vector size in average by about 40%.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
高质量的延迟缺陷atpg
提出了一种针对延迟缺陷生成有效向量的新方法。该测试集实现了高路径延迟故障覆盖率以捕获小分布延迟缺陷,高过渡故障覆盖率以捕获大延迟缺陷。此外,对ATPG的非鲁棒路径进行了仔细的过滤(选择),使其与已测试的鲁棒路径的重叠最小。观察到路径延迟故障模型和过渡故障模型之间的关系,有助于减少用于测试生成的非鲁棒路径的数量。为了生成鲁棒和非鲁棒路径的测试,开发了一种确定性ATPG引擎。为了提高测试集的质量,对路径进行了聚类。使用暗示来识别不可测试的路径。最后,采用基于增量传播的ATPG方法处理转换故障。对ISCAS'85和全扫描ISCAS'89基准电路的测试结果表明,滤波后的非鲁棒路径集比传统的路径集小40%,而不会损失延迟缺陷覆盖率。聚类平均减少约40%的向量大小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fault pattern oriented defect diagnosis for memories A built-in self-repair scheme for semiconductor memories with 2-d redundancy Cost-effective approach for reducing soft error failure rate in logic circuits A new maximal diagnosis algorithm for bus-structured systems Test vector generation based on correlation model for ratio-I/sub DDQ/
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1