This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Previous Investigation of Realization of an Arbitrary Switching Function with a Network of Threshold and Parity Elements
August 1971 (vol. 20 no. 8)
pp. 941-942
K.W. Henderson, Stanford Linear Accel. Cen. Stanford Univ.
Attention is called to previous research on realization of an arbitrary switching function by a network of threshold gates (or threshold elements) and modulo-2 gates (or parity elements), establishment of greatest lower bounds on the number of gates needed, artifices that lead to further network reduction in special cases, and systematic minimization of the number of modulo-2 gates required.
Index Terms:
Arbitrary switching function, linearly separable function, matrix partitioning, minimal network, modulo-2 gate, optimal realization, parity element, threshold element, threshold gate, Walsh matrix, Walsh series.
Citation:
K.W. Henderson, "Previous Investigation of Realization of an Arbitrary Switching Function with a Network of Threshold and Parity Elements," IEEE Transactions on Computers, vol. 20, no. 8, pp. 941-942, Aug. 1971, doi:10.1109/T-C.1971.223377
Usage of this product signifies your acceptance of the Terms of Use.