Short complete diagnostic tests for circuits with two additional inputs in some basis

IF 0.3 Q4 MATHEMATICS, APPLIED

Discrete Mathematics and Applications Pub Date : 2023-08-01 DOI:10.1515/dma-2023-0020

K. A. Popkov

引用次数: 0

Abstract

Abstract We prove that any Boolean function in n variables can be modeled by a testable Boolean circuit with two additional inputs in the basis “conjunction, oblique conjunction, disjunction, negation” so that the circuit admits a complete diagnostic test of the length at most 2n + 3 with respect to stuck-at faults of the type 1 at gate outputs.

查看原文本刊更多论文

在某些基础上对具有两个附加输入的电路进行完整的短路诊断测试

摘要我们证明了n个变量中的任何布尔函数都可以用一个可测试的布尔电路来建模，该电路在“连接、斜连接、析取、否定”的基础上有两个额外的输入，因此该电路允许对门输出处的1型卡在故障进行长度最多为2n+3的完整诊断测试。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Mathematics and Applications MATHEMATICS, APPLIED-

CiteScore

0.60

自引率

20.00%

发文量

期刊介绍： The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.