This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued Inputs
February 1985 (vol. 34 no. 2)
pp. 131-140
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.
Index Terms:
switching theory, Complement of logical expression, logic design, minimization of logical expressions, multiple valued logic, prime implicants, programmable logic array
Citation:
T. Sasao, "An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued Inputs," IEEE Transactions on Computers, vol. 34, no. 2, pp. 131-140, Feb. 1985, doi:10.1109/TC.1985.1676549
Usage of this product signifies your acceptance of the Terms of Use.