This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Number of Multivalued Switching Functions Realizable by Cascades
May 1979 (vol. 28 no. 5)
pp. 371-374
T. Hikita, Department of Mathematics, Tokyo Metropolitan University
Butler [6] gave recurrence relations for computing the number Nr(n) of r-valued (r = 2) switching functions of n variables realizable by a cascaded network of n - 1 r-valued cells. The cascades are assumed to have a fixed-input variable assignment. In this correspondence similar recurrence relations are presented for the number Mr(n) of such cascade realizable functions that
Index Terms:
universal logical cells., Cascades, multivalued switching functions, switching function enumeration
Citation:
T. Hikita, H. Enomoto, "On the Number of Multivalued Switching Functions Realizable by Cascades," IEEE Transactions on Computers, vol. 28, no. 5, pp. 371-374, May 1979, doi:10.1109/TC.1979.1675369
Usage of this product signifies your acceptance of the Terms of Use.