Iterative method of realisation of linearly separable switching functions

The minterms of the switching function expressed as decimal numbers are first partitioned into different groups according to the number of true inputs. An order of the weights and their signs can now be found easily. Secondary and higher orderings can also be found partially. An iteration procedure is next started by assigning values to the weights until a contradiction is reached. A new assignment is then chosen, guided by the nature of the contradiction, and this process is continued until the realisation is achieved. An example is worked out.