A strongly fault-secure and strongly code-disjoint realization of combinational circuits

T. Nanya, Masatoshi Uchida
{"title":"A strongly fault-secure and strongly code-disjoint realization of combinational circuits","authors":"T. Nanya, Masatoshi Uchida","doi":"10.1109/FTCS.1989.105601","DOIUrl":null,"url":null,"abstract":"Strongly fault-secure (SFS) circuits are known to achieve the totally self-checking (TSC) goal of producing a noncodeword as the first erroneous output due to a fault. Strongly code-disjoint (SCD) circuits are known to always map noncodeword inputs to noncodeword outputs, even in the presence of faults, as long as the faults remain undetected. The authors present a general design method for SFS and SCD combinational circuits for the previously proposed fault model that covers the broad classes of likely faults in VLSI. In the design, the input and output of a combinational circuit are encoded in systematic unordered codes whose check part is obtained by adding two extra bits to the check part of any known systematic unordered code. Thanks to the uniform input/output encoding and the SCD property for the proposed combinational circuits, a number of the circuits can be interconnected in cascade to construct a larger SFS combinational circuit if each interface is sufficiently exercised.<<ETX>>","PeriodicalId":230363,"journal":{"name":"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTCS.1989.105601","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Strongly fault-secure (SFS) circuits are known to achieve the totally self-checking (TSC) goal of producing a noncodeword as the first erroneous output due to a fault. Strongly code-disjoint (SCD) circuits are known to always map noncodeword inputs to noncodeword outputs, even in the presence of faults, as long as the faults remain undetected. The authors present a general design method for SFS and SCD combinational circuits for the previously proposed fault model that covers the broad classes of likely faults in VLSI. In the design, the input and output of a combinational circuit are encoded in systematic unordered codes whose check part is obtained by adding two extra bits to the check part of any known systematic unordered code. Thanks to the uniform input/output encoding and the SCD property for the proposed combinational circuits, a number of the circuits can be interconnected in cascade to construct a larger SFS combinational circuit if each interface is sufficiently exercised.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
组合电路的强故障安全和强代码分离实现
众所周知,强故障安全(SFS)电路可以实现完全自检(TSC)的目标,即产生一个非码字作为由于故障引起的第一个错误输出。强码不连接(SCD)电路总是将非码字输入映射到非码字输出,即使在存在故障的情况下,只要故障未被检测到。针对先前提出的故障模型,作者提出了一种通用的SFS和SCD组合电路设计方法,该模型涵盖了VLSI中广泛的可能故障类别。在本设计中,组合电路的输入和输出用系统无序码编码,系统无序码的校验部分通过在任意已知的系统无序码的校验部分上加两个额外的比特得到。由于所提出的组合电路具有统一的输入/输出编码和SCD特性,如果每个接口都得到充分利用,则许多电路可以级联连接以构建更大的SFS组合电路。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Replication within atomic actions and conversations: a case study in fault-tolerance duality Byte unidirectional error correcting codes F-T in telecommunications networks: state, perspectives, trends Evaluation of fault-tolerant systems with nonhomogeneous workloads Control-flow checking using watchdog assists and extended-precision checksums
×
引用
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