DIGITAL DESIGN

Boolean
Algebra

LOGIC OPERATIONS
n variables
22n
2 bit (x,y)
16

DD-2 K.R.ANUPAMA

LOGIC OPERATIONS
Boolean Func
F0 = 0

Op symbol

Name
Null

F1 = x.y

x.y

AND

F2 = x

Transfer

F3 = y

Transfer

F4 = xy

y/x

Inhibition

F5 = x.y

x/y

Inhibition

F6 = xy+xy

x y

XOR

F7 = x+y

x+y

OR
DD-2 K.R.ANUPAMA

LOGIC OPERATIONS
Boolean Func
F8 = (x+y)

Op symbol
xy

Name
NOR

F9 = xy + xy

xy

Equivalence

F10 = x+y

x y

Implication

F11 = x+y

x y

Implication

F12 = y

Complement

F13 = x

Complement

F14 = (xy)

xy

NAND

F15 = 1

Identity
DD-2 K.R.ANUPAMA

BOOLEAN FUNCTION
f(A,B,C,D) = ABC + CD + B
Switching equation
Truth Table
Logic Diagram

DD-2 K.R.ANUPAMA

TRUTH TABLE
A

0
0
0

0
0
0

0
0
0

0
1
1

1
1
1

1
1
1

0
0
0

0
0
0

0
1
1

1
1
1

0
0
0
0
0
0

0
0
0
0
0
0

1
1
1
1
1
1

0
0
0
1
1
1

1
1
1
1

1
1
1
1
1
1

0
0
0
0
0
0

1
1
1
1
1
1

0
0
0
1
1
1

1
1
1
1

0
0
0
0

1
1
1
1

0
0
0
0

0
0
1
1

0
0

1
1
1
1

0
0
0
0

0
0
1
1

1
1

1
1
1
1

0
0

1
1

1
1

0
0

1
1

1
1

1
1

0
0

0
0

1
1

1
1

1
1

1
1

1
1

1
1

1
1

DD-2 K.R.ANUPAMA

LOGIC DIAGRAM
B
A
B
C

ABC

ABC + CD+
B

CD
D

DD-2 K.R.ANUPAMA

IMPORTANT LOGIC
PROPERTIES
Duality
Complement
Equivalance

DD-2 K.R.ANUPAMA

DUALITY
Replace AND by OR and vice versa
Replace 1 by 0 and vice versa
f(A,B,C,D) = ABC + CD + B
fd(A,B,C,D) = (A+B+C)(C+D)B

DD-2 K.R.ANUPAMA

COMPLEMENTARY
Take Dual
Invert Literals
f(A,B,C,D) = ABC + CD + B
fd(A,B,C,D) = (A+B+C)(C+D)B
f(A,B,C,D) = (A+B+C)(C+D)B

DD-2 K.R.ANUPAMA

10

EQUIVALENT
Two functions are equivalent provided they have same
value (1 or 0) for each of the possible combinations of
variables

DD-2 K.R.ANUPAMA

11

SWITCHING
ALGEBRA/
BOOLEAN

Postulates &
Theorem

HUNTINGTON
POSTULATES
Postulate 1 Closure
(a) +
(b).
Postulate 2 Identity
(a) x+0 = 0 +x = x
(b)x.1 = 1.x =x
DD-2 K.R.ANUPAMA

13

HUNTINGTON
POSTULATES
Postulate 3 Commutative
(a) x+y = y+x
(b)x.y = y.x
Postulate 4 Distributive
(a) x.(y+z) = (x.y) + (x.z)
(b)x+(y.z) = (x+y).(x+z)
DD-2 K.R.ANUPAMA

14

HUNTINGTON
POSTULATES
Postulate 5 Complement
(a) x+x = 1
(b)x.x = 0

DD-2 K.R.ANUPAMA

15

THEOREM 1 INDEMPOTENCY
a) x + x = x
b)

x.x = x

Proof
x+x
= (x+x).1
= (x+x).(x+x)
= x+xx
= x+0
=x
DD-2 K.R.ANUPAMA

16

THEOREM 2 INTERSECTION
(ANNULMENT)

a) x + 1 = 1
b) x.0 = 0
Proof
x+1

= (x+1).1
= (x+1).(x+x)
= x + (x.1)
= x+x
=1

DD-2 K.R.ANUPAMA

17

THEOREM 3
INVOLUTION (DOUBLE
INVERSION)
(x) = x

DD-2 K.R.ANUPAMA

18

THEOREM 4 ASSOCIATIVE
a) x + (y+z) = (x+y)+z
b) x.(y.z) = (x.y).z
Proof
Truth Table

DD-2 K.R.ANUPAMA

19

THEOREM 5
DEMORGANS LAW
a) (x +y) = x.y
b) (x.y) = x+y
Proof
Truth Table

DD-2 K.R.ANUPAMA

20

THEOREM 6 ABSORPTION

a) x + xy = x

b) x(x+y) = x
Proof
x + xy
= x.1 + x.y
= x.(1+y)
= x.(y+1)
= x.1
=x

DD-2 K.R.ANUPAMA

21

THEOREM 7
CONSENSUS
a) x + xy = x +y
b) x + xy = x+y
Proof
x + xy

= (x+x) (x+y)
= 1.(x+y)
= (x+y).1
= x+y

DD-2 K.R.ANUPAMA

22

AND BEFORE OR

.. Unless OR in
brackets

DD-2 K.R.ANUPAMA

23

EXAMPLE 1 SIMPLIFICATION
Y

= ABD + ABD
= AB(D+D)
= AB

DD-2 K.R.ANUPAMA

24

EXAMPLES
Y = B+BCD+BCD+AB+AB+BC
Y = (AB+C+D)(C+D)(C+D)(C+D+E)
Y = B+ABD+ ABC+ ABD+ACD

DD-2 K.R.ANUPAMA

25