Boolean Algebra and

Simplifications

Microlink Info Tech College

Boolean Algebra &

Minimization
A mathematical analysis of logics
Boolean deals with variables having value

either 0 = False or 1 = True

Two valued Boolean algebra

X+Y

X.Y

X or Y = True if X or Y are
= True
X and Y = True if X & Y =
True
And =
Or=

Not =

Boolean algebra
minimization
Each literal in the function designates an

input to a gate, and each term is

implemented with a gate
Minimization of the number of variables
results in circuit with less equipment
Minimization can be achieved by algebraic
manipulation

RULES

Rule

And form

OR form

Null

X.0=0

X+1=1

Idempotent

X.X=X

X+X=X

Inverse

X. X = 0

X+X=1

Identity

X .1 = X

X+0=X

Absorption

X. (X + Y) = X

X +( X.Y) = X

Commutative

X.Y = Y.X

X+Y = Y +X

Distributive

X.(Y+Z) = (X.Y) +
(X.Z)

X +(Y.Z) = (X+Y).(X+Z)

Demorgans law

X .Y = X + Y

X+Y = X . Y

Double Negation X = X

X=X

Simplification Example

Simplify the following Using

algebra manipulation
1) x + (x +y) + x(x + y)
2)(x + y)(x + z) (y + z)
3)x + y.z + z.y

Logic Gate Symbols

Inverter (logical NOT,
x
Boolean complement).
x
AND gate (Boolean
y
product).
x
OR gate (Boolean sum).
y
XOR gate (exclusive-OR,
x
sum mod 2).
y
7

xy
x+y
xy

NAND, NOR, XNOR

Just like the earlier icons,
but with a small circle on
the gates output.
Denotes that output is
complemented.

The circles can also be

placed on inputs.
Means, input is complemented
before being used.

x
y
x
y
x
y

Exercise: Draw the logic

Diagrams of
F1=
F2 =

Exercise
Given F = A.B.C construct a circuit using

NOR gate
Given F = A.B (A + B) construct a circuit
using NAND gate

10