{"title":"组合电路的强故障安全和强代码分离实现","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":"{\"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}","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}
A strongly fault-secure and strongly code-disjoint realization of combinational circuits
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.<>