{"title":"安排可变现场测试周期的功能测试序列池","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":"{\"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}","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}
Arranging a Pool of Functional Test Sequences for Variable In-Field Test Periods
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.
IEEE AccessCOMPUTER 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.