Previous Investigation of Realization of an Arbitrary Switching Function with a Network of Threshold and Parity Elements
Issue No. 08 - August (1971 vol. 20)
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.
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.
K. Henderson, "Previous Investigation of Realization of an Arbitrary Switching Function with a Network of Threshold and Parity Elements," in IEEE Transactions on Computers, vol. 20, no. , pp. 941-942, 1971.