LFSR种子的正负额外时钟以减少存储测试的数量

I. Pomeranz
{"title":"LFSR种子的正负额外时钟以减少存储测试的数量","authors":"I. Pomeranz","doi":"10.1109/ATS52891.2021.00031","DOIUrl":null,"url":null,"abstract":"When test data compression uses a linear-feedback shift-register (LFSR) for on-chip decompression, stored tests consist of seeds for the LFSR. Extra clocking of an LFSR seed, bringing the LFSR to one of its next-states, was shown to allow several different tests to be applied based on every stored test, thus reducing the number of seeds that need to be stored, or increasing the fault coverage. Extra clocking that brings the LFSR to its next-states is referred to as positive extra clocking. Only this type of clocking was used earlier. This article suggests to replace a seed by a previous state of the LFSR as a way to increase the effectiveness of this approach without changing the test application process. The computation of previous states is referred to as negative extra clocking. The procedure described in this article uses negative extra clocking to replace seeds with previous states while adjusting the positive extra clocking of the seeds. Experimental results are presented for benchmark circuits to demonstrate the importance of negative extra clocking in reducing the number of seeds that need to be stored.","PeriodicalId":432330,"journal":{"name":"2021 IEEE 30th Asian Test Symposium (ATS)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Positive and Negative Extra Clocking of LFSR Seeds for Reduced Numbers of Stored Tests\",\"authors\":\"I. Pomeranz\",\"doi\":\"10.1109/ATS52891.2021.00031\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When test data compression uses a linear-feedback shift-register (LFSR) for on-chip decompression, stored tests consist of seeds for the LFSR. Extra clocking of an LFSR seed, bringing the LFSR to one of its next-states, was shown to allow several different tests to be applied based on every stored test, thus reducing the number of seeds that need to be stored, or increasing the fault coverage. Extra clocking that brings the LFSR to its next-states is referred to as positive extra clocking. Only this type of clocking was used earlier. This article suggests to replace a seed by a previous state of the LFSR as a way to increase the effectiveness of this approach without changing the test application process. The computation of previous states is referred to as negative extra clocking. The procedure described in this article uses negative extra clocking to replace seeds with previous states while adjusting the positive extra clocking of the seeds. Experimental results are presented for benchmark circuits to demonstrate the importance of negative extra clocking in reducing the number of seeds that need to be stored.\",\"PeriodicalId\":432330,\"journal\":{\"name\":\"2021 IEEE 30th Asian Test Symposium (ATS)\",\"volume\":\"141 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 30th Asian Test Symposium (ATS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ATS52891.2021.00031\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 30th Asian Test Symposium (ATS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATS52891.2021.00031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

当测试数据压缩使用线性反馈移位寄存器(LFSR)进行片上解压缩时,存储的测试由LFSR的种子组成。额外的LFSR种子时钟,将LFSR带到它的下一个状态之一,被证明允许基于每个存储的测试应用几个不同的测试,从而减少需要存储的种子的数量,或者增加故障覆盖率。将LFSR带到下一状态的额外时钟被称为正额外时钟。以前只有这种类型的时钟被使用。本文建议将种子替换为LFSR的先前状态,作为在不更改测试应用程序过程的情况下提高该方法有效性的一种方法。先前状态的计算称为负额外时钟。本文中描述的过程使用负额外时钟来替换具有先前状态的种子,同时调整种子的正额外时钟。给出了基准电路的实验结果,以证明负额外时钟在减少需要存储的种子数量方面的重要性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Positive and Negative Extra Clocking of LFSR Seeds for Reduced Numbers of Stored Tests
When test data compression uses a linear-feedback shift-register (LFSR) for on-chip decompression, stored tests consist of seeds for the LFSR. Extra clocking of an LFSR seed, bringing the LFSR to one of its next-states, was shown to allow several different tests to be applied based on every stored test, thus reducing the number of seeds that need to be stored, or increasing the fault coverage. Extra clocking that brings the LFSR to its next-states is referred to as positive extra clocking. Only this type of clocking was used earlier. This article suggests to replace a seed by a previous state of the LFSR as a way to increase the effectiveness of this approach without changing the test application process. The computation of previous states is referred to as negative extra clocking. The procedure described in this article uses negative extra clocking to replace seeds with previous states while adjusting the positive extra clocking of the seeds. Experimental results are presented for benchmark circuits to demonstrate the importance of negative extra clocking in reducing the number of seeds that need to be stored.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信