鲁棒延迟故障可测试组合逻辑电路的综合与优化

S. Devadas, K. Keutzer
{"title":"鲁棒延迟故障可测试组合逻辑电路的综合与优化","authors":"S. Devadas, K. Keutzer","doi":"10.1109/DAC.1990.114858","DOIUrl":null,"url":null,"abstract":"Recently developed necessary and sufficient conditions for robust path-delay-fault testability are applied to develop synthesis procedures which produce two-level and multilevel circuits with high degrees of robust path delay fault testability. For circuits which can be flattened to two levels, a covering procedure is given which optimizes for robust path delay fault testability. These two-level circuits can then be algebraically factored to produce robustly path-delay-fault testable multilevel circuits. For regular structures which cannot be flattened to two levels, a composition procedure is given which allows for the construction of robustly path-delay-fault testable regular structures. Finally, it is shown how these two techniques can be combined to produce cascaded combinational logic blocks that are robustly path-delay-fault testable. These techniques are demonstrated on a variety of examples. It is possible to produce entire clips that are fully path delay testable using these techniques.<<ETX>>","PeriodicalId":118552,"journal":{"name":"27th ACM/IEEE Design Automation Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":"{\"title\":\"Synthesis and optimization procedures for robustly delay-fault testable combinational logic circuits\",\"authors\":\"S. Devadas, K. Keutzer\",\"doi\":\"10.1109/DAC.1990.114858\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently developed necessary and sufficient conditions for robust path-delay-fault testability are applied to develop synthesis procedures which produce two-level and multilevel circuits with high degrees of robust path delay fault testability. For circuits which can be flattened to two levels, a covering procedure is given which optimizes for robust path delay fault testability. These two-level circuits can then be algebraically factored to produce robustly path-delay-fault testable multilevel circuits. For regular structures which cannot be flattened to two levels, a composition procedure is given which allows for the construction of robustly path-delay-fault testable regular structures. Finally, it is shown how these two techniques can be combined to produce cascaded combinational logic blocks that are robustly path-delay-fault testable. These techniques are demonstrated on a variety of examples. It is possible to produce entire clips that are fully path delay testable using these techniques.<<ETX>>\",\"PeriodicalId\":118552,\"journal\":{\"name\":\"27th ACM/IEEE Design Automation Conference\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"45\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"27th ACM/IEEE Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1990.114858\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"27th ACM/IEEE Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1990.114858","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 45

摘要

应用最近发展的鲁棒路径延迟故障可测试性的充分必要条件,开发了具有高度鲁棒路径延迟故障可测试性的二电平和多电平电路的综合程序。对于可平面化到两层的电路,给出了一种覆盖方法,该方法优化了鲁棒路径延迟故障可测性。然后可以对这些两级电路进行代数分解,以产生鲁棒的路径延迟故障可测试的多电平电路。对于不能平面化到两层的规则结构,给出了一种构造鲁棒路径-延迟-故障可测试规则结构的组合方法。最后,展示了如何将这两种技术结合起来,以产生具有鲁棒路径延迟故障可测试性的级联组合逻辑块。这些技术在各种示例中进行了演示。使用这些技术可以产生完全路径延迟可测试的整个剪辑。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Synthesis and optimization procedures for robustly delay-fault testable combinational logic circuits
Recently developed necessary and sufficient conditions for robust path-delay-fault testability are applied to develop synthesis procedures which produce two-level and multilevel circuits with high degrees of robust path delay fault testability. For circuits which can be flattened to two levels, a covering procedure is given which optimizes for robust path delay fault testability. These two-level circuits can then be algebraically factored to produce robustly path-delay-fault testable multilevel circuits. For regular structures which cannot be flattened to two levels, a composition procedure is given which allows for the construction of robustly path-delay-fault testable regular structures. Finally, it is shown how these two techniques can be combined to produce cascaded combinational logic blocks that are robustly path-delay-fault testable. These techniques are demonstrated on a variety of examples. It is possible to produce entire clips that are fully path delay testable using these techniques.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Design management based on design traces A transistor reordering technique for gate matrix layout An optimal algorithm for floorplan area optimization A heuristic algorithm for the fanout problem Coded time-symbolic simulation using shared binary decision diagram
×
引用
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