Issue No. 02 - February (1985 vol. 34)
T. Sasao , Department of Electronic Engineering, Osaka University
A recursive algorithm to obtain a complement of a sum-of-products expression for a binary function with p-valued inputs is presented. It produces at most pn/2 products for n-variable functions, whereas a conventional elementary algorithm produces O(tn?n(1-t)/2) products where t = 2P -1. It is 10-20 times faster than the elementary one when p = 2 and n = 8. For large practical-problems, it produces many fewer products than the disjoint sharp algorithm used by MINI. Appplications of the algorithm to PLA minimization are also presented.
switching theory, Complement of logical expression, logic design, minimization of logical expressions, multiple valued logic, prime implicants, programmable logic array
T. Sasao, "An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued Inputs," in IEEE Transactions on Computers, vol. 34, no. , pp. 131-140, 1985.