Abstract
Under consideration is the problem of synthesis of irredundant logic circuits in the basis {&, ∨, ¬} which implement Boolean functions of n variables and allow some short single diagnostic tests regarding uniform constant faults at outputs of gates. For each Boolean function permitting implementation by an irredundant circuit, the minimal possible length value of such a test is found. In particular, we prove that this value is at most 2.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.