A Method for the Design of Pattern Recognition Logic

The general problem of pattern recognition is regarded as a problem wherein the recognition device is presented with a plane array of black-or-white elements and must decide to which general class (pattern) this array belongs. A method for reducing the necessary amount of logic is presented. It is basically a method for reducing Boolean equations in many variables which contain large numbers of redundant or ``don´t care´´ terms. The reduced logic is in the form of Boolean functions of the black-or-white elements. Some experimental results, in which this logic was mechanized with diodes, are discussed.