Minimization of Switching Functions—A Fast Technique

An algorithm is presented in this correspondence which will generate only those prime implicants (PI's) which are essential or necessary for a minimal sum of products (the technique can be extended for product of sums form also) of a given switching function —iven all the minterms. This algorithm eliminates the neces-sity of finding out all the PI's.

[1]  A. Scheinman.  A method for simplifying Boolean functions , 1962 .

[2]  Edward J. McCluskey,et al.  Introduction to the theory of switching circuits , 1965 .

[3]  M. Karnaugh.  The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.