Skip-scan: A methodology for test time reduction

Binod Kumar, B. Nehru, B. Pandey, Jaynarayan T. Tudu
{"title":"Skip-scan: A methodology for test time reduction","authors":"Binod Kumar, B. Nehru, B. Pandey, Jaynarayan T. Tudu","doi":"10.1109/ISVDAT.2016.8064869","DOIUrl":null,"url":null,"abstract":"Reducing test time is a major challenge in scan based DFT architectures for cost effective test. In this paper, we have proposed a test pattern reordering methodology for dynamic scan architecture. The reconfiguration of scan chain dynamically reduces its length by skipping scan cells with don't care bits. A graph theoretical approach is presented for test pattern reordering to maximise skip. We have calculated theoretical bounds on reduction in test time and segregated test patterns into groups with variable skip-depths. Our results indicate up to 84% reduction in test time. Comparison of this approach with the default ATPG tool pattern and scan chain reordering technique is also done.","PeriodicalId":301815,"journal":{"name":"2016 20th International Symposium on VLSI Design and Test (VDAT)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 20th International Symposium on VLSI Design and Test (VDAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVDAT.2016.8064869","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Reducing test time is a major challenge in scan based DFT architectures for cost effective test. In this paper, we have proposed a test pattern reordering methodology for dynamic scan architecture. The reconfiguration of scan chain dynamically reduces its length by skipping scan cells with don't care bits. A graph theoretical approach is presented for test pattern reordering to maximise skip. We have calculated theoretical bounds on reduction in test time and segregated test patterns into groups with variable skip-depths. Our results indicate up to 84% reduction in test time. Comparison of this approach with the default ATPG tool pattern and scan chain reordering technique is also done.
跳过扫描:一种减少测试时间的方法
在基于扫描的DFT体系结构中,减少测试时间是降低测试成本的主要挑战。本文提出了一种用于动态扫描体系结构的测试模式重排序方法。扫描链的重构通过跳过具有无关位的扫描单元,动态地缩短了扫描链的长度。提出了一种图论方法来实现测试模式的重新排序,以最大限度地提高跳过率。我们计算了减少测试时间的理论界限,并将测试模式划分为具有可变跳过深度的组。我们的结果表明测试时间减少了84%。将该方法与默认的ATPG工具模式和扫描链重新排序技术进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信