A Simplified Procedure for the Realization of Linearly-Separable Switching Functions

A previous paper gives a procedure for the testing and realization of linearly-separable switching functions, i.e., functions which can be realized by a single threshold component. That procedure can be considerably simplified, particularly when the given function is symmetric in sets of two or more variables. The simplifications arise due to a reduction of the number of functions in the function tree in view of the coefficient ordering. Although this procedure was derived with the aim of reducing the amount of computation below that required for straightforward solution of the simultaneous inequalities that define the problem, the resulting method has some interesting relationships to that due to Winder.

[1]  Robert C. Minnick,et al.  Linear-Input Logic , 1961, IRE Trans. Electron. Comput..

[2]  Robert McNaughton,et al.  Unate Truth Functions , 1961, IRE Trans. Electron. Comput..

[3]  P. M. Lewis,et al.  Linearly separable switching functions , 1961 .

[4]  Robert O. Winder,et al.  Single stage threshold logic , 1961, SWCT.