Minimal Complete Fault Detection Tests for Circuits of Functional Elements in Standard Basis


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

for each Boolean function we calculate the exact value of the minimal possible length of a complete fault detection test for logic networks implementing this function in the basis “conjunction, disjunction, negation” under one-type stuck-at faults at outputs of gates.

About the authors

K. A. Popkov

Keldysh Institute of Applied Mathematics

Author for correspondence.
Email: kirill-formulist@mail.ru
Russian Federation, Miusskaya sq., 4, Moscow, 125047

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2019 Allerton Press, Inc.