Simplifying Boolean Functions
Simplifying Boolean Functions
Algebra
OR AND
F1 = x + y’z
x
F1
z
mplementation of Boolean Functions
Draw the logic diagram for:
F2 x' y ' z x' yz xy '
F2
z
mplementation of Boolean Functions
Simplify F2 of previous example using Boolean rules
F2 x' y ' z x' yz xy '
x' z ( y ' y ) xy ' Distributive
x' z xy '
x
y
F2
This implementation has fewer gates and fewer inputs to the gates (or wires) than
the previous one.
Simplifying Boolean Functions
Simplify following Boolean function to a min number of literals.
F= x(+ y)
= xx+ xy = 0 + xy = xy Note:
Functions F and F1 are
the dual of each other,
F1= x + (x’.y) hence output is also
= (x+x’)(x+y) = 1(x+y) = x+y dual.
F2= (x + y) (x + y’)
= x+ xy +xy’ +yy’ = x(1+y+y’) = x (solving via expansion)
F4= (x+y)(x’+z)(y+z)
By principle of duality F4 = xy + x’z + yz = F3 . Hence, ans = xy + x’z
x
y
F3
z
Complement of a Function
• The complement of a Function F is F’ is obtained by taking dual of the function
and then complementing each literal.
• Consider: A+B
• Dual: AB
• Complement: A'B’