Arranging a Pool of Functional Test Sequences for Variable In-Field Test Periods

IF 3.4 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Irith Pomeranz
{"title":"Arranging a Pool of Functional Test Sequences for Variable In-Field Test Periods","authors":"Irith Pomeranz","doi":"10.1109/ACCESS.2025.3528741","DOIUrl":null,"url":null,"abstract":"High workloads applied to a system cause chips to be more susceptible to aging effects that may eventually result in hardware defects. The detection of the defects requires tests for delay faults to be applied in-field. Both scan-based tests and functional test sequences are important to apply. In-field test periods vary in length. Therefore, test sets of both types should be arranged such that every test period would be utilized for targeting the most likely to occur faults. This is preferred over the alternative where each test period is used for achieving the highest possible fault coverage since the highest possible fault coverage may be achieved without detecting the most likely to occur faults. This article considers the problem of arranging a pool of functional test sequences to match different in-field test periods when the goal is to ensure that the most likely to occur faults are detected in every test period. The procedure described in this article produces a series of solutions with subsets of increasing lengths of the pool (subpools) to detect subsets of transition faults of increasing sizes. The increase in the length of every subpool in the series is minimum or close-to-minimum relative to the length of the previous subpool. The procedure is implemented in an academic simulation environment and applied to benchmark circuits to demonstrate its effectiveness.","PeriodicalId":13079,"journal":{"name":"IEEE Access","volume":"13 ","pages":"10009-10021"},"PeriodicalIF":3.4000,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10838502","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Access","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10838502/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

High workloads applied to a system cause chips to be more susceptible to aging effects that may eventually result in hardware defects. The detection of the defects requires tests for delay faults to be applied in-field. Both scan-based tests and functional test sequences are important to apply. In-field test periods vary in length. Therefore, test sets of both types should be arranged such that every test period would be utilized for targeting the most likely to occur faults. This is preferred over the alternative where each test period is used for achieving the highest possible fault coverage since the highest possible fault coverage may be achieved without detecting the most likely to occur faults. This article considers the problem of arranging a pool of functional test sequences to match different in-field test periods when the goal is to ensure that the most likely to occur faults are detected in every test period. The procedure described in this article produces a series of solutions with subsets of increasing lengths of the pool (subpools) to detect subsets of transition faults of increasing sizes. The increase in the length of every subpool in the series is minimum or close-to-minimum relative to the length of the previous subpool. The procedure is implemented in an academic simulation environment and applied to benchmark circuits to demonstrate its effectiveness.
安排可变现场测试周期的功能测试序列池
应用于系统的高工作负载导致芯片更容易受到老化效应的影响,这可能最终导致硬件缺陷。缺陷的检测需要在现场应用延迟故障测试。基于扫描的测试和功能测试序列都很重要。现场测试周期长短不一。因此,应该安排两种类型的测试集,以便每个测试周期都将用于瞄准最可能发生的故障。这优于另一种选择,其中每个测试周期用于实现最高可能的故障覆盖率,因为最高可能的故障覆盖率可以在不检测最可能发生的故障的情况下实现。本文考虑了如何安排一组功能测试序列来匹配不同的现场测试周期,其目标是确保在每个测试周期都检测到最可能发生的故障。本文中描述的过程产生一系列解决方案,其中包含池(子池)长度不断增加的子集,以检测大小不断增加的转换故障子集。相对于前一个子池的长度,该系列中每个子池的长度增量是最小的或接近最小的。该程序在一个学术仿真环境中实现,并应用于基准电路以证明其有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Access
IEEE Access COMPUTER SCIENCE, INFORMATION SYSTEMSENGIN-ENGINEERING, ELECTRICAL & ELECTRONIC
CiteScore
9.80
自引率
7.70%
发文量
6673
审稿时长
6 weeks
期刊介绍: IEEE Access® is a multidisciplinary, open access (OA), applications-oriented, all-electronic archival journal that continuously presents the results of original research or development across all of IEEE''s fields of interest. IEEE Access will publish articles that are of high interest to readers, original, technically correct, and clearly presented. Supported by author publication charges (APC), its hallmarks are a rapid peer review and publication process with open access to all readers. Unlike IEEE''s traditional Transactions or Journals, reviews are "binary", in that reviewers will either Accept or Reject an article in the form it is submitted in order to achieve rapid turnaround. Especially encouraged are submissions on: Multidisciplinary topics, or applications-oriented articles and negative results that do not fit within the scope of IEEE''s traditional journals. Practical articles discussing new experiments or measurement techniques, interesting solutions to engineering. Development of new or improved fabrication or manufacturing techniques. Reviews or survey articles of new or evolving fields oriented to assist others in understanding the new area.
×
引用
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学术官方微信