DIGITAL ELECTRONICS-2

BOOLEAN ALGEBRA
Module 2 - Part 2
 BOOLEAN ALGEBRA

It is the Set of Rules used to simplify

the given Boolean expression
without changing its functionalities
 1-COMPLEMENT LAW INPUT OUTPUT

m -
(A)

0
(Y)

* I 1 0

0
- 17 0

!
"="
-
-

DOFD Buffer
 2-AND LAW INPUT
(A)
INPUT
(B)
OUTPUT
(Y)
0 0 0
0 1 0
1 0 0

-
!. ! = ! 1 1 1

!. % = % -

!. & = !
-

!
!. ! = % &

&

↑
 3-OR LAW INPUT
(A)
INPUT
(B)
OUTPUT
(Y)
0 0 0
0 1 1
1 0 1

A A
.
=
A '+'=' 1 1 1

A . 1 = A '+%='
A .
0 = 0 '+&=&
-
0 !
'+' =&
Ad =

&
 OR LAW EXAMPLE
Example 1: Reduce the Boolean Expression
! ", $, % = "% + "$ + $% + 1

+ BC + 1
Act AB
~
--
Y
 4-DISTRIBUTIVE LAW

$(& + C)=AB+AC
&

#
-

! + ($C)=(A+B)(A+C)
S
&
&

&
 4-DISTRIBUTIVE LAW

! + ($C)=(A+B)(A+C)
-
-
2A
--
+ B) (A + 3) -

A + BC
-
DISTRIBUTIVE LAW EXAMPLE
Example 1: Reduce the Boolean Expression
! ", $, % = " + "B ̅

Y
 DISTRIBUTIVE LAW EXAMPLE
Example 1: Reduce the Boolean Expression
! ", $, % = " + "B ̅
-

(A E) (A (! + !)(! + B)
+
+ B)
w
1 (A+B)
↓
A+B
I

&
5 + GB i+ 1
B//
=

A+
k+B
=
-

CfB = C +B
5-COMMUTATIVE LAW

$+&=&+$

$& = &$
 6- ASSOCIATIVE LAW
CAB) C =
A (BC)

!" #) = !("#)

! + # + $) = ! + (# + $)
(A+ B) + c = x + (B + y
7- DEMORGAN’S LAW
NAND =
Bubbled
OR

*+)
') = ' *

*)
'+) =' *
7- DEMORGAN’S LAW 1
*+)
') = ' *

Di Bubbled OR

a
cate
7- DEMORGAN’S LAW 1
*+)
') = ' *

-
7- DEMORGAN’S LAW 2
*)
'+) =' *

# D-
NOR

D
Bubbled AND
7- DEMORGAN’S LAW 2
*)
'+) =' *
 DIGITAL ELECTRONICS

REDUNDANCY THEOREM
REDUNDANCY THEOREM

There must be 3 variables

Each variable is repeated twice
One Variable is complemented
Take the complement variable
DISTRIBUTIVE LAW EXAMPLE
Example 1: Reduce the Boolean Expression
! ", $, % = "$ + "C ̅ + BC

#BEC + BC

X
Are
&
 DISTRIBUTIVE LAW EXAMPLE
Example 1: Reduce the Boolean Expression
! ", $, % = "$ + "C ̅ + BC
-

AB + Ec + BC
̅ + BC.1
Y= AB + "C
AB + Es + BC - I Y= AB + "C̅ + BC. (A + "̅ )
Y= AB + "C ̅ + ABC + "BC
̅
& ̅ [1 +B]
AB + E) +
Bc(A E) +
Y=AB [1 +C] + "C
Y= AB + "C ̅
-
wa
&

AB + EC + ABC E
+

B]
-
-

#+ + < AB[c] + Ec[ +,

DISTRIBUTIVE LAW EXAMPLE
Example 2: Reduce the Boolean Expression
! ", $, % = "$ + B%̅ + AC

↑
DISTRIBUTIVE LAW EXAMPLE
Example 3: Reduce the Boolean Expression
! ", $, % = A$. + BC+ AC

E
Ce
BC
+ A
AB +
X
 DISTRIBUTIVE LAW EXAMPLE
Example 4: Reduce the Boolean Expression
! ", $, % = (A + B)($. + %) + (A+C)

(A + B)(i +
1)(A + c)
 DIGITAL ELECTRONICS

DUALITY THEOREM
 160 ORLAND
DUALITY THEOREM
Starting with the Boolean Relation, we can derive another
Boolean Relation called Dual by the following steps

Changing each OR Sign to an AND Sign

Changing each AND Sign to an OR Sign

Complementing all 0’s and 1’s

 DUALITY THEOREM EXAMPLE
Example 1: Dual of A.0=0

A .

0 = 0

A+ 1 = I
"+1=1
 DUALITY THEOREM EXAMPLE
Example 2: Dual of A.(B+C)
H (B.
+ 1) = AB + Ac

A + (B c).
= (A + B) .
(A + c

". $ + % = ". $ + ". %

A+(B.C)= (A+B)(A+C)
DIGITAL ELECTRONICS

SOP AND POS

 BOOLEAN EXPRESSION
• A Boolean expression consisting entirely either of minterm or
maxterm is called canonical expression.

Types of Boolean Expression

Sum of Product of
Products (SOP) Sums (POS)
 Sum of Product (SOP)
• Each SOP Consist of two or more product terms(AND) that ORed together
• A boolean expression consisting purely of Minterms (product terms)
is said to be in canonical sum of products form.

f(A ,
B 1)
,
= ABC + FBL + ABI
we
eneu
 Standard Sop
-

Canonical SOP / Standard SOP

Example 1: Convert the Given Expression in Standard SOP Form
! ", $, % = "% + "$ + $%
 = 1
Canonical SOP / Standard SOP +A
A
Convert the Given Expression in Standard SOP Form
! ", $, % = "% + "$ + $%

f) A, B
, 1) = E +
-
AB + BC
L W W
⑰ B
,
5 % A
,
E

AB ABC + + ABC + AB EBa

H +

⑬x
-

- -
X
AB1 + ABC + B) + ABI B
- -

-
+ EB S

ABC + Ac + ABC + EBC

&
 Canonical SOP / Standard SOP
Example 2 : Convert the Given Expression in Standard SOP Form
! ", $, %, 2 = "! $% + "$%2 + "! $!

#BC + ABCD + EB = F(D ,

B <
, , D/

L L - -

D, T - I5

-
i &
 Product of Sum (POS)
• Each POS Consist of Two or more Sum Terms(OR) that AND ed Together
• A Boolean expression consisting purely of Maxterms (sum terms) is said to be
in canonical product of sums form.

(A + B + c)(E + 5+ x)(E + B+ 3)
-i
a
 Canonical POS / Standard POS
Example 1 : Convert Canonical POSin Standard POS Form
the Given Expression
! ", $, % = (" + $)($ + %)(" + %)
 A A .

= A
Canonical POS / Standard POS
Example 1 : Convert Canonical POSin Standard POS Form
the Given Expression
! ", $, % = (" + $)($ + %)(" + %)

f (A , B , c) = (A + B) (B + 1) (A + C)
--
um
5 E
-
2
, A ,
B , b

(A + B+ 1)(A + B + T)( + B +
x(E + b+ 1)
- -
H+ B
B + 2
 Canonical POS / Standard POS
Example 2 : Convert Canonical POSin Standard POS Form
the Given Expression
! ", $, %, 2 = (" + $ + %′)(" + $ + % + 2)("′ + %′)
zum
D B BD
E BD B I
 Minterm and Maxterm
Each individual term in Standard SOP is called Minterm
Each individual term in Standard POS is called Maxterm
 of comp (Sop]

=>
.

(M)
(m)

+ 5+ D

O I
Minterm and Maxterm 0 0 0 0 0
0 0 0 1 1
0 0 1 0 2
0 0 1 1 3
0 1 0 0 4
0 1 0 1 5
0 1 1 0 6
0 1 1 1 7
1 0 0 0 8
1 0 0 1 9
1 0 1 0 10
1 0 1 1 11
1 1 0 0 12
1 1 0 1 13
1 1 1 0 14
1 1 1 1 15
 Minterm and Maxterm A
0
B
0
C
0
D
0 0
Minterm and Maxterm of 7 (4 Bit) Minterm and Maxterm of 10 (4 Bit) 0 0 0 1 1
EBCD 0 0 1 0 2
0111 1010
A+ B+ c + 5 0 0 1 1 3

Minterm and Maxterm of 7 (3 Bit) Minterm and Maxterm of 12 (4 Bit)

0 1 0 0 4
0 1 0 1 5

# 1108
0
0
1
1
1
1
0
1
6
7

Minterm and Maxterm of 11 (4 Bit) Minterm and Maxterm of 0 (4 Bit) 1 0 0 0 8

-
1 0 0 1 9
1 0 1 0 10
1011 0000 1 0 1 1 11

Minterm and Maxterm of 15 (4 Bit) Minterm and Maxterm of 2 (4 Bit) 1 1 0 0 12

1 1 0 1 13

111I 0018
1 1 1 0 14
1 1 1 1 15
 Minterm and Maxterm A
0
B
0
C
0
D
0 0
Minterm and Maxterm of 7 (4 Bit) Minterm and Maxterm of 10 (4 Bit) 0 0 0 1 1
0 0 1 0 2
0 0 1 1 3

Minterm and Maxterm of 7 (3 Bit) Minterm and Maxterm of 12 (4 Bit)

0 1 0 0 4
0 1 0 1 5
0 1 1 0 6
0 1 1 1 7

Minterm and Maxterm of 11 (4 Bit) Minterm and Maxterm of 0 (4 Bit) 1 0 0 0 8

1 0 0 1 9
1 0 1 0 10
1 0 1 1 11

Minterm and Maxterm of 15 (4 Bit) Minterm and Maxterm of 2 (4 Bit) 1 1 0 0 12

1 1 0 1 13
1 1 1 0 14
1 1 1 1 15
 Minterm and Maxterm A
0
B
0
C
0
D
0 0
Minterm and Maxterm of 7 (4 Bit) Minterm and Maxterm of 10 (4 Bit) 0 0 0 1 1
0 0 1 0 2
0 0 1 1 3

Minterm and Maxterm of 7 (3 Bit) Minterm and Maxterm of 12 (4 Bit)

0 1 0 0 4
0 1 0 1 5
0 1 1 0 6
0 1 1 1 7

Minterm and Maxterm of 11 (4 Bit) Minterm and Maxterm of 0 (4 Bit) 1 0 0 0 8

1 0 0 1 9
1 0 1 0 10
1 0 1 1 11

Minterm and Maxterm of 15 (4 Bit) Minterm and Maxterm of 2 (4 Bit) 1 1 0 0 12

1 1 0 1 13
1 1 1 0 14
1 1 1 1 15
 Minterm and Maxterm A
0
B
0
C
0
D
0 0
Minterm and Maxterm of 7 (4 Bit) Minterm and Maxterm of 10 (4 Bit) 0 0 0 1 1
0 0 1 0 2
0 0 1 1 3

Minterm and Maxterm of 7 (3 Bit) Minterm and Maxterm of 12 (4 Bit)

0 1 0 0 4
0 1 0 1 5
0 1 1 0 6
0 1 1 1 7

Minterm and Maxterm of 11 (4 Bit) Minterm and Maxterm of 0 (4 Bit) 1 0 0 0 8

1 0 0 1 9
1 0 1 0 10
1 0 1 1 11

Minterm and Maxterm of 15 (4 Bit) Minterm and Maxterm of 2 (4 Bit) 1 1 0 0 12

1 1 0 1 13
1 1 1 0 14
1 1 1 1 15
Minterm and Makterm of 42

IEF
2
#010 E + B + c +
-
Eth
D +-
2

2
⑪

DEF
-
2 ⑪
M42
: ABC E+=
D +
+
c + 2
+ b
M42 =

①
 Boolean Algebra -

F
Gates-
togic
TI MAND
,
NOR
implement

2
3 ,
4 ,

KMAP
,
CSE

- iT
it' Meckus key Method
Quine
.

lammin
 DIDUREM HAP
YE ** MEPARNAW
DIGITAL ELECTRONICS

KARNAUGH MAP
 KARNAUGH MAP
• We have simplified the Boolean functions using Boolean
postulates and theorems. It is a time consuming process and
we have to re-write the simplified expressions after each step.
• To overcome this difficulty, Karnaugh introduced a method for
simplification of Boolean functions in an easy way. This method
is known as Karnaugh map method or K-map method. It is a
graphical method, which consists of 2n cells for ‘n’ variables.
The adjacent cells are differed only in single bit position.

CODE + 24.
GRA +
27 4 cell
4- 16 cell
3 - 811
57 22 cells
 TYPES OF KARNAUGH MAP

Q
①
② ②

W 9 : 25
VARIABLE
B
BRA BJ

* ·
10
00

t A BT

0132

① 2003, 4576
I ask

#
 As?
ID CD CD
jet 01 Il 18

·
Mo m2

18
m6
EB T
03,
1213 1514 11 A BIT
1100 ABIE
8 91110
As
ABIE M1o
10 FECD ABET
-

10
TYPES OF KARNAUGH MAP

0132
4576
1213 1514

89 11/10
RULES OF KMAP
 Groups may not include any cell
RULE 1 containing a zero
 Groups may be horizontal or vertical,
RULE 2 but not diagonal
 Groups must contain 1, 2, 4, 8,16 or in
RULE 3 general 2n cells.

↑
 Each group should be as large as
RULE 4 possible.

4 variable : 16 ,
8
,
4
, 2
,
1
 Each cell containing a one must be in at
RULE 5 least one group.
RULE 6 Groups may overlap
 Groups may wrap around the table. The leftmost cell
in a row may be grouped with the rightmost cell and
RULE 7 the top cell in a column may be grouped with the
bottom cell.

#
 There should be as few groups as possible, as long
RULE 8 as this does not contradict any of the previous
rules.
Representation of Truth Table on KMAP
Representation of Truth Table on KMAP
Representation of Truth Table on KMAP
Representation of Boolean Expression on KMAP
Representation of Boolean Expression on KMAP
Representation of Boolean Expression on KMAP

! " 1,5,7,9,15
 Grouping of Cells

111 1

-
-
-
E
Grouping of Cells

-
D
*

⑳
 Grouping of two adjacent ones

O O G G

E
A
-

AC Bu//
 Grouping of two adjacent ones

⑧
0
Etip
Ec + BC//E
Simplify Using Knap

- (A , B , <, D) =
B5 + ABID + EED +
-
-
-

B
-

EBC1

I -
 Reduce the boolean Expression Using Kmap
-

F(k , B, C
,
D) = EBC + ABCD + ABD + 5
ABCD +
um
D, G
um
C T
A

e
,

FBT5
 boolean
due
the Expression USins Knap

& (g 137)
f(A B C D) =
3
,
1 9
7 10
1,
,

12
,

, , , , ,

·
,

AB

0132

4576

12 13 1514

8 91110
=>
& B2 B B2 B
00

Reduce the truth table

Using kmap
Reduce the boolea Expression USms Kmar

· L 0132

4576
12 13

89/118
1514
Grouping of Four adjacent ones

= A/
f &
·
 Grouping of Four adjacent ones

*
⑤ O

B
=

By #Ey &

[
Grouping of Four adjacent ones

~ &

55
&, M
-
Grouping of Four adjacent ones

1 1 1 1

1 1 1
 Grouping of Eight adjacent ones

& I

O
- ·

Bo
Grouping of Eight adjacent ones

][
Thank You