Computing, School of
School of Computing: Faculty Publications
Accessibility Remediation
If you are unable to use this item in its current form due to accessibility barriers, you may request remediation through our remediation request form.
Document Type
Article
Date of this Version
4-1978
Abstract
Fan-out-free networks of AND, OR, NOT, EXOR, and MAJORITY gates are considered. Boolean functions for which such networks exist are defined to be fan-out free. The paper solves the following problems regarding the fan-out-free networks and functions.
1) Characterization of the class of fan-out-free functions: The characterization given is constructive in the sense that if a given function is fan-out free one obtains a fan-out-free network to realize it.
2) Counting the class of fan-out-free functions: After establishing a correspondence between a fan-out-free function and a normalized network realizing it, a series of formulas are developed to count distinct normal networks for any subset of the five gates mentioned above.
3) Fault Diagnosis: Methods are developed to detect multiple faults and to locate single faults in arbitrary fan-out-free networks.
Comments
Published in IEEE TRANSACTIONS ON COMPUTERS, VOL. c-27, NO. 4, APRIL 1978, pp. 309-318. doi: 10.1109/TC.1978.1675103 Copyright 1978 IEEE. Used by permission.