The Community for Technology Leaders
Green Image
Issue No. 04 - April (1978 vol. 27)
ISSN: 0018-9340
pp: 309-318
K.L. Kodandapani , Department of Computer Science, Wichita State University
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.
single fault location, 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

S. Seth and K. Kodandapani, "On Combinational Networks with Restricted Fan-Out," in IEEE Transactions on Computers, vol. 27, no. , pp. 309-318, 1978.
87 ms
(Ver 3.3 (11022016))