路径延迟测试生成逻辑系统

S. Bose, P. Agrawal, V. Agrawal
{"title":"路径延迟测试生成逻辑系统","authors":"S. Bose, P. Agrawal, V. Agrawal","doi":"10.1109/EURDAC.1993.410638","DOIUrl":null,"url":null,"abstract":"The authors present an algorithmic derivation of logic systems for solving path delay test problems. In these logic systems, the state of a signal represents any possible situation that can occur during two consecutive vectors. Starting from a set of valid input states, a state transition graph is constructed to enumerate all possible states produced by Boolean gates. Specifics of the test problem are used for distinguishability criteria and to minimize the number of states. For test generation in combinational or sequential circuits, the authors use the algorithm to obtain optimal logic systems. They define optimality as to the smallest number of logic states that provide the least possible ambiguity. The ten-value logic of Fuchs et al. is found to be optimal for generating tests for single path delay faults but gives ambiguous results for multiple path activation. A new 23-value logic is derived as an optimal system for solving the multiple path problem as well as the delay test generation problem of sequential circuits. The limitations and capabilities of various logic systems are illustrated.<<ETX>>","PeriodicalId":339176,"journal":{"name":"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference","volume":"122 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"Logic systems for path delay test generation\",\"authors\":\"S. Bose, P. Agrawal, V. Agrawal\",\"doi\":\"10.1109/EURDAC.1993.410638\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present an algorithmic derivation of logic systems for solving path delay test problems. In these logic systems, the state of a signal represents any possible situation that can occur during two consecutive vectors. Starting from a set of valid input states, a state transition graph is constructed to enumerate all possible states produced by Boolean gates. Specifics of the test problem are used for distinguishability criteria and to minimize the number of states. For test generation in combinational or sequential circuits, the authors use the algorithm to obtain optimal logic systems. They define optimality as to the smallest number of logic states that provide the least possible ambiguity. The ten-value logic of Fuchs et al. is found to be optimal for generating tests for single path delay faults but gives ambiguous results for multiple path activation. A new 23-value logic is derived as an optimal system for solving the multiple path problem as well as the delay test generation problem of sequential circuits. The limitations and capabilities of various logic systems are illustrated.<<ETX>>\",\"PeriodicalId\":339176,\"journal\":{\"name\":\"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference\",\"volume\":\"122 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EURDAC.1993.410638\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of EURO-DAC 93 and EURO-VHDL 93- European Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURDAC.1993.410638","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

摘要

作者提出了一种求解路径延迟测试问题的逻辑系统的算法推导。在这些逻辑系统中,信号的状态表示在两个连续向量期间可能发生的任何可能情况。从一组有效的输入状态出发,构造一个状态转移图来枚举布尔门产生的所有可能的状态。测试问题的细节用于区分标准和最小化状态的数量。对于组合或顺序电路中的测试生成,作者使用该算法来获得最优逻辑系统。他们将最优性定义为提供最少可能歧义的最少数量的逻辑状态。Fuchs等人的十值逻辑被发现对于生成单路径延迟故障的测试是最优的,但对于多路径激活给出了模糊的结果。推导了一种新的23值逻辑,作为解决顺序电路多路径问题和延迟测试产生问题的最优系统。说明了各种逻辑系统的局限性和能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Logic systems for path delay test generation
The authors present an algorithmic derivation of logic systems for solving path delay test problems. In these logic systems, the state of a signal represents any possible situation that can occur during two consecutive vectors. Starting from a set of valid input states, a state transition graph is constructed to enumerate all possible states produced by Boolean gates. Specifics of the test problem are used for distinguishability criteria and to minimize the number of states. For test generation in combinational or sequential circuits, the authors use the algorithm to obtain optimal logic systems. They define optimality as to the smallest number of logic states that provide the least possible ambiguity. The ten-value logic of Fuchs et al. is found to be optimal for generating tests for single path delay faults but gives ambiguous results for multiple path activation. A new 23-value logic is derived as an optimal system for solving the multiple path problem as well as the delay test generation problem of sequential circuits. The limitations and capabilities of various logic systems are illustrated.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Conditional and unconditional hardware sharing in pipeline synthesis Partitioning strategies within a distributed multilevel logic simulator including dynamic repartitioning Extended 0/1 LP formulation for the scheduling problem in high-level synthesis The CALLAS synthesis system and its application to mechatronic ASIC design problems Realizing expression graphs using table-lookup FPGAs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1