Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Negation trees: a unified approach to Boolean function complementation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Yuke Wang ; Dept. of Comput. Sci., Saskatchewan Univ., Saskatoon, Sask., Canada ; McCrosky, C.

Boolean function complementation is a basic operation of Boolean algebra. For functions given in SOP form, the complementation methods include the DeMorgan's Law, sharp, disjoint sharp, unate complementation, recursive, and Sasao's method. This paper accomplishes three purposes: (1) It exposes an underlying unification of the existing complementation algorithms. It is proven that (a) unate-complementation and sharp are the same as the DeMorgan Law algorithm; (b) Sasao's algorithm is the same as disjoint sharp; (c) disjoint sharp is a special case of the recursive method. (2) It proposes negation trees for the representation of functions and their complements. (3) It gives faster algorithms for finding complements of functions in SOP form based on negation trees

Published in:

Computers, IEEE Transactions on  (Volume:45 ,  Issue: 5 )