This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Number of Functions Realized by Cascades and Disjunctive Networks
July 1975 (vol. 24 no. 7)
pp. 681-690
J.T. Butler, Department of Electrical Engineering, Northwestern University
In this paper, the number of functions realized by certain networks of two-input one-output gates are presented. Two networks are considered; one is the disjunctive network, which is characterized by the restriction that each gate output and each network input connect to exactly one gate input. The other network, the cascade, is the special case of the disjunctive networks in which each gate has at least one input which connects to a network input. For both networks, a recursion relation is derived for the number of realized switching functions dependent on exactly k variables. Both expressions have been solved by computer for k up to 15. Also, expressions are derived for the number of functions realized by cascades and disjunctive networks of two-input one-output cells, where each cell realizes any of the 16 functions on two variables.
Index Terms:
Cascades, disjunctive networks, polyfunctional nets, switching function decomposition, switching function enumeration, niversal cells.
Citation:
J.T. Butler, "On the Number of Functions Realized by Cascades and Disjunctive Networks," IEEE Transactions on Computers, vol. 24, no. 7, pp. 681-690, July 1975, doi:10.1109/T-C.1975.224288
Usage of this product signifies your acceptance of the Terms of Use.