A technique for fault detection in C-testable orthogonal iterative arrays

W. Huang, F. Lombardi
{"title":"A technique for fault detection in C-testable orthogonal iterative arrays","authors":"W. Huang, F. Lombardi","doi":"10.1109/CMPEUR.1988.4953","DOIUrl":null,"url":null,"abstract":"The authors present an approach to C-testability of orthogonal iterative arrays. C-testability is defined by those criteria which characterize the complexity of the testing process as independent of the dimensions of the array and of the erroneous states of the cells. The proposed approach is based on a cellular automata characterization under a single-faulty-cell assumption. This characterization analyzes the state transition table of a basic cell and adds new states to it. These new states are used to reproduce internally to the array the test input and propagate the faulty state to the output pins of a chip. This process is analyzed exhaustively. The characteristics of the additional states are presented. The conditions of C-testability are fully proved. Complexity of the testing process (number of test vectors) is discussed. It is proved that the proposed approach has a lower complexity than previously published work.<<ETX>>","PeriodicalId":415032,"journal":{"name":"[Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPEUR.1988.4953","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The authors present an approach to C-testability of orthogonal iterative arrays. C-testability is defined by those criteria which characterize the complexity of the testing process as independent of the dimensions of the array and of the erroneous states of the cells. The proposed approach is based on a cellular automata characterization under a single-faulty-cell assumption. This characterization analyzes the state transition table of a basic cell and adds new states to it. These new states are used to reproduce internally to the array the test input and propagate the faulty state to the output pins of a chip. This process is analyzed exhaustively. The characteristics of the additional states are presented. The conditions of C-testability are fully proved. Complexity of the testing process (number of test vectors) is discussed. It is proved that the proposed approach has a lower complexity than previously published work.<>
c可测试正交迭代阵列的故障检测技术
提出了一种正交迭代阵列c -可检验性的方法。c -可测试性是由那些标准来定义的,这些标准描述了测试过程的复杂性,与阵列的尺寸和细胞的错误状态无关。提出的方法是基于单故障细胞假设下的元胞自动机表征。该特性分析基本单元的状态转换表,并向其添加新状态。这些新状态用于在阵列内部再现测试输入,并将故障状态传播到芯片的输出引脚。对这一过程进行了详尽的分析。给出了附加态的特征。充分证明了c可测性的条件。讨论了测试过程的复杂性(测试向量的数量)。结果表明,该方法的复杂度低于已有的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信