Maxterm Type Expressions of Switching Functions and Their Prime Implicants

TLDR: Algorithms have been formulated for this purpose which first generate all possible prime implicants corresponding to a specified switching function and then select minimal subsets of these primeimplicants for use in the formation of the minimal networks.

Abstract: One of the basic problems of combinational switching circuit theory is that of designing circuits with a minimum number of AND-gates or prime implicants. Algorithms have been formulated for this purpose which first generate all possible prime implicants corresponding to a specified switching function and then select minimal subsets of these prime implicants for use in the formation of the minimal networks [1]-[6]. In practically all the currently available methods of simplification of switching functions, use is made of the minterm type expression specified in the algebraic or its equivalent binary or decimal form. Operations with binary or decimal numbers have become very popular because of their inherent advantages.