Synthesis of Symmetric Switching Functions Using Threshold Logic Elements

The problem of minimal multilevel synthesis of symmetric switching functions with threshold logic elements is studied. A weight matrix representation of a threshold logic network is given. A number of theorems are presented which give necessary and sufficient conditions for minimal synthesis of symmetric functions with a maximum of eight positive transitions. In each case the minimal network is specified. An example has been worked out.