On combinational networks with restricted fan-out
MetadataShow full item record
Kodandapani, K.L.; Seth, S.C.; , "On Combinational Networks with Restricted Fan-Out," Computers, IEEE Transactions on , vol.C-27, no.4, pp.309-318, April 1978 doi: 10.1109/TC.1978.1675103
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.
The full text of this article is not available on SOAR. WSU users can access the article via IEEE Xplore database licensed by University Libraries: http://libcat.wichita.edu/vwebv/holdingsInfo?bibId=1045954