Enhancing delay fault testability for iterative logic arrays

Shyue-Kung Lu, Chien-Hung Yeh
{"title":"Enhancing delay fault testability for iterative logic arrays","authors":"Shyue-Kung Lu, Chien-Hung Yeh","doi":"10.1109/PRDC.2002.1185648","DOIUrl":null,"url":null,"abstract":"Iterative logic arrays are widely used in many applications, e.g., general-purpose processors, digital signal processors, and embedded processors. Owing to the advanced VLSI technology, new defect mechanisms exist in the fabricated circuits. Therefore, in order to improve the quality of manufactured products, the traditional single cell fault model is not sufficient. Therefore, more realistic fault models such as the sequential fault models and the delay fault models should also be considered. Therefore, delay fault testability conditions are proposed for iterative logic arrays (ILAs) in this paper. Our approach applies to ILAs with an arbitrary dimension, e.g., linear and mesh-connected ILAs, etc. Moreover, it can also be applied to various other connection types, e.g., butterfly-connected and shuffle-connected ones. A design for-testability approach is used to make these arrays delay fault testable based on the proposed testability conditions. To illustrate our approach, we give a delay fault testable FFT processor as an example and show that an overhead of no more than 5% is sufficient to make it C-testable. It requires only 128 2-pattern tests to achieve 100% cell-delay-fault coverage regardless of the word length and the computation points of the FFT processor. Our approaches also guarantee that the test set is easy to generate, and the corresponding BIST structure requires smaller hardware overhead and has a more regular structure.","PeriodicalId":362330,"journal":{"name":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2002.1185648","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Iterative logic arrays are widely used in many applications, e.g., general-purpose processors, digital signal processors, and embedded processors. Owing to the advanced VLSI technology, new defect mechanisms exist in the fabricated circuits. Therefore, in order to improve the quality of manufactured products, the traditional single cell fault model is not sufficient. Therefore, more realistic fault models such as the sequential fault models and the delay fault models should also be considered. Therefore, delay fault testability conditions are proposed for iterative logic arrays (ILAs) in this paper. Our approach applies to ILAs with an arbitrary dimension, e.g., linear and mesh-connected ILAs, etc. Moreover, it can also be applied to various other connection types, e.g., butterfly-connected and shuffle-connected ones. A design for-testability approach is used to make these arrays delay fault testable based on the proposed testability conditions. To illustrate our approach, we give a delay fault testable FFT processor as an example and show that an overhead of no more than 5% is sufficient to make it C-testable. It requires only 128 2-pattern tests to achieve 100% cell-delay-fault coverage regardless of the word length and the computation points of the FFT processor. Our approaches also guarantee that the test set is easy to generate, and the corresponding BIST structure requires smaller hardware overhead and has a more regular structure.
提高迭代逻辑阵列的延迟故障可测试性
迭代逻辑阵列在通用处理器、数字信号处理器、嵌入式处理器等领域有着广泛的应用。由于超大规模集成电路技术的进步,在制造电路中出现了新的缺陷机制。因此,为了提高制造产品的质量,传统的单细胞故障模型是不够的。因此,还应考虑更现实的故障模型,如顺序故障模型和延迟故障模型。因此,本文提出了迭代逻辑阵列(ILAs)延迟故障可测性条件。我们的方法适用于任意尺寸的ILAs,例如线性和网格连接的ILAs等。此外,它还可以应用于各种其他连接类型,如蝴蝶连接和洗牌连接。基于所提出的可测试性条件,采用可测试性设计方法使阵列延迟故障可测试。为了说明我们的方法,我们给出了一个延迟故障可测试的FFT处理器作为例子,并表明开销不超过5%就足以使其可测试c。无论单词长度和FFT处理器的计算点如何,它只需要128个2模式测试就可以实现100%的小区延迟故障覆盖。我们的方法还保证了测试集易于生成,并且相应的BIST结构需要更小的硬件开销并且具有更规则的结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信