Scribd
Upload
49 views31 pages

Unit-2 Boolean Function and Its Minimization: Prof. Tushar Patel M.tech (DC)

This document contains a summary of a lecture on Boolean functions and their minimization. It discusses Boolean theorems and operations, canonical and standard forms such as SOP and POS, and different minimization methods including Karnaugh maps, tabulation method, and don't care conditions. It also covers realizing Boolean functions using only NAND and NOR gates.

Uploaded by

Rutvij Shah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
49 views31 pages

Unit-2 Boolean Function and Its Minimization: Prof. Tushar Patel M.tech (DC)

This document contains a summary of a lecture on Boolean functions and their minimization. It discusses Boolean theorems and operations, canonical and standard forms such as SOP and POS, and different minimization methods including Karnaugh maps, tabulation method, and don't care conditions. It also covers realizing Boolean functions using only NAND and NOR gates.

Uploaded by

Rutvij Shah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 31

Unit-2

Boolean Function and


its Minimization
Prof. Tushar Patel
M.tech(DC)

Contents
Simplification of Boolean Function using Boolean
theorems
Canonical & Standard Forms: SOP and POS
Minimization Methods
Karnaugh Map Method
Karnaugh Map Method with Dont care condition
Tabulation Method

Concept of Prime Implicants


Realization of Boolean Functions Using Only NAND
and NOR Gates

Prof. Tushar Patel (M.tech-DC)

Basic Definitions
Binary Operators
AND
z=xy=xy
AND y=1

z=1 if x=1

OR
z=x+y
y=1

z=1 if x=1 OR

NOT
z = x = x

z=1 if x=0

Boolean Algebra
Binary Variables: only 0 and 1 values
Prof. Tushar Patel (M.tech-DC)

Boolean Algebra Postulates


Commutative Law
xy=yx

x+y=y+x

Identity Element
x1=x

x+0=x

Complement
x x = 0

x + x = 1

Prof. Tushar Patel (M.tech-DC)

Boolean Algebra Theorems


Duality
The dual of a Boolean algebraic
expression is obtained by interchanging
the AND and the OR operators and
replacing the 1s by 0s and the 0s by
1s.
x(y+z)=(xy)+(xz)
x+(yz)=(x+y)(x+z)

Theorem 1

xx=x

x+x=x

Theorem 2

x0=0

x+1=1

Prof. Tushar Patel (M.tech-DC)

Theorem 3: Involution

( x ) = x

(x)=x

Theorem 4: Associative & Distributive

(xy)z=x(yz)
(x+y)
+z=x+(y+z)
x(y+z)=(xy)+(xz)
x+(yz)=(x+y)
(x+z)

Theorem 5: DeMorgan

( x y ) = x + y
y
(xy) =x +y
y

Theorem 6: Absorption

Prof. Tushar Patel (M.tech-DC)

( x + y ) = x
(x+y) = x
6

DeMorgans Theorem
a [b c (d e )]
a [b c (d e )]
a b (c ( d e ))
a b (c (d e ))
a b (c (d e))

a b (c d e)
Prof. Tushar Patel (M.tech-DC)

Boolean Functions
Boolean Expression
Example:

F = x + y z

Truth Table
All possible combinations
of input variables

Logic Circuit

Prof. Tushar Patel (M.tech-DC)

Algebraic Manipulation
Literal:
A single variable within a term that may
be complemented or not.

Use Boolean Algebra to simplify


Boolean functions to produce simpler
circuits
Example: Simplify to a minimum number
of literals
F = x + x y
( 3 Literals)
= x + ( x y )
= ( x + x ) Prof.
( xTushar
+ Patel
y )(M.tech-DC)

Complement of a Function
DeMorgans Theorm

F A B C
F A B C
F A B C

Duality & Literal Complement

F A B C
F

A B C

F A B C
Prof. Tushar Patel (M.tech-DC)

10

Canonical Forms
Minterm
Product (AND function)
0
Contains all variables
1
Evaluates to 1 for a
2
specific combination
3
Example
4
A=0 A
B
C
5
B = 0 (0) (0) (0)
6
C=0
1
=1

A B C

Minterm

0 0 0

m0

ABC

0 0 1

m1

0 1 0

m2

0 1 1

m3

ABC
ABC
ABC

1 0 0

m4

ABC

1 0 1

m5

1 1 0

m6

1 1 1

m7

ABC
ABC
ABC

Prof. Tushar Patel (M.tech-DC)

11

Maxterm
Sum (OR function)
0
Contains all variables 1
Evaluates to 0 for a 2
specific combination
3
Example
4
A=1 A
B
C
5
B = 1 (1) + (1) + (1) 6
C=1
7
0 +
=0

+ 0

A B C

Maxterm

0 0 0

M0 A B C
M1 A B C

0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

Prof. Tushar Patel (M.tech-DC)

M2 A B C
M3 A B C
M4 A B C
M5 A B C
M6 A B C
M7 A B C
12

Truth Table to Boolean Function


A B C

0 0 0

0 0 1

0 1 0

0 1 1

1 0 0

1 0 1

1 1 0

1 1 1

F A BC A BC A BC ABC

Prof. Tushar Patel (M.tech-DC)

13

Sum of Minterms (SOP)


F ABC A BC A BC ABC
F m1 m4 m5 m7

F (1,4,5,7)

A B C

0 0 0

0 0 1

0 1 0

0 1 1

0 0

Product of Maxterms (POS)


4 1
F A BC ABC ABC ABC

1 0 1

F A BC ABC ABC ABC

1 1 0

1 1 1

F A BC ABC ABC ABC


F ( A B C )( A B C )( A B C )( A B C )
F M0
M2
M3
M6

F (0,2,3,6)Prof. Tushar Patel (M.tech-DC)

14 / 28

Standard Forms
Sum of Products (SOP)
F A BC ABC A BC ABC

A B(C C )
AB (1)
AB

AC ( B B )
AC
BC ( A A)
BC
F BC ( A A) A B (C C ) AC ( B B )
F BC A B AC
Prof. Tushar Patel (M.tech-DC)

15

Product of Sums (POS)


AB (C C )
F A BC ABC ABC ABC
BC ( A A)
AC ( B B )
F AC ( B B ) AB(C C ) BC ( A A)
F AC AB BC
F ( A C )( A B )( B C )
Prof. Tushar Patel (M.tech-DC)

16

Two - Level Implementations


Sum of Products (SOP)
F BC A B AC

Product of Sums (POS)


F ( A C )( A B )( B C )

Prof. Tushar Patel (M.tech-DC)

17

Examples

Prof. Tushar Patel (M.tech-DC)

18

Exercise

Prof. Tushar Patel (M.tech-DC)

19

2-10 Draw the logic diagrams for the following Boolean


expressions:
(a) Y = AB + B (A + C)

(b) Y = BC + AC

(c) Y = A + CD

(d) Y = (A + B) (C + D)

2-12 Simplify the Boolean function T1 and T2 to a minimum


number of literals.
A
0
0
0
0
1
1
1
1

B
0
0
1
1
0
0
1
1

Prof. Tushar Patel (M.tech-DC)

C
0
1
0
1
0
1
0
1

T1
1
1
1
0
0
0
0
0

T2
0
0
0
1
1
1
1
1
20

Minimization Method
Karnaugh Map Method
Karnaugh Map Method with Dont care
condition
Tabulation Method
KMap:

Karnaugh map provides a


systematic method for simplifying Boolean
expressions and, if properly used, will produce
the simplest SOP or POS expression possible,
known as the minimum expression.
Prof. Tushar Patel (M.tech-DC)

21

Two-Variable KMap:

Three-Variable KMap:

Prof. Tushar Patel (M.tech-DC)

22

Four-Variable KMap:

Prof. Tushar Patel (M.tech-DC)

23

Prof. Tushar Patel (M.tech-DC)

24

Prof. Tushar Patel (M.tech-DC)

25

Dont Care Condition

Prof. Tushar Patel (M.tech-DC)

26

Five-Variable KMap

Prof. Tushar Patel (M.tech-DC)

27

Exercise

Prof. Tushar Patel (M.tech-DC)

28

Tabulation Method:

Prof. Tushar Patel (M.tech-DC)

29

Realization of Boolean Fun. Using Only

&NOR

NAND

Gates

Prof. Tushar Patel (M.tech-DC)

30

Using Only NOR

Prof. Tushar Patel (M.tech-DC)

31

You might also like