Title :
On Combinational Networks with Restricted Fan-Out
Author :
Kodandapani, K.L. ; Seth, Sharad C.
Author_Institution :
Department of Computer Science, Wichita State University
fDate :
4/1/1978 12:00:00 AM
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.
Keywords :
Characterization of fan-out-free networks; combinational networks; counting of fan-out-free; fan-out-free networks; functional decomposition; localized fan outs; multiple fault detection; single fault location; Boolean functions; Computer science; Fault detection; Fault diagnosis; Fault location; Network synthesis; Testing; Characterization of fan-out-free networks; combinational networks; counting of fan-out-free; fan-out-free networks; functional decomposition; localized fan outs; multiple fault detection; single fault location;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1978.1675103
