This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Combinational Networks with Restricted Fan-Out
April 1978 (vol. 27 no. 4)
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.
Index Terms:
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
Citation:
K.L. Kodandapani, S.C. Seth, "On Combinational Networks with Restricted Fan-Out," IEEE Transactions on Computers, vol. 27, no. 4, pp. 309-318, April 1978, doi:10.1109/TC.1978.1675103
Usage of this product signifies your acceptance of the Terms of Use.