An Approach to Multilevel Boolean Minimization
Eugene L. Lawler · Journal of the ACM · 1964
An approach to the problem of multilevel Boolean minimization is described.The conventional prime implicant is generalized to the multilevel case, and the properties of multilevel prime implicants are investigated.A systematic procedure for computing multilevel prime implicants is described, and several examples are worked out.It is shown how ,'absolutely minimal" forms can be obtained by carrying out multilevel minimization to a sutSciently large number of levels.This constitutes a major revision of the paper, "Minimal Boolean Expressions with ~[ore than Two Levels of Sums and Products," presented at the Third Annual Symposium ~r~ Switching Circuit Theory and Logical Design, AIEE Fall General Meeting, Chicago, October 1962.The revision was supported by Air Force Contract 33(657)-7811.