Scribd
Upload
54 views26 pages

Boolean Functions: Simplification

The document discusses Boolean algebra simplification techniques including: - Boolean functions and their properties such as x + 0 = x, x.(y+z) = x.y + x.z, etc. - Postulates and theorems for Boolean algebra - Examples of simplifying Boolean expressions using properties, postulates and theorems - Standard forms for Boolean expressions such as Sum of Products (SOP) and Product of Sums (POS) - Relationship between minterms and maxterms and how they sum to 1 and 0 respectively - Why canonical forms such as SOP and POS are important for implementation with fewer gates

Uploaded by

Gyananshu Upadhyay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
54 views26 pages

Boolean Functions: Simplification

The document discusses Boolean algebra simplification techniques including: - Boolean functions and their properties such as x + 0 = x, x.(y+z) = x.y + x.z, etc. - Postulates and theorems for Boolean algebra - Examples of simplifying Boolean expressions using properties, postulates and theorems - Standard forms for Boolean expressions such as Sum of Products (SOP) and Product of Sums (POS) - Relationship between minterms and maxterms and how they sum to 1 and 0 respectively - Why canonical forms such as SOP and POS are important for implementation with fewer gates

Uploaded by

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

Boolean

Functions
Simplification

x + 0 = 0 +x = x

x +y = y +x

x.(y+z) = x.y + x.z

x+x = 1

x.1 = 1.x =x

x.y = y.x

x +(y.z) = (x+y) (y+z)

x.x = 0

DD-3

Postulates

x+x=x
x+1=1

(x) = x

x + (y+z) = (x+y)+z

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

x.x = x

x.0 = 0

x.(y.z) = (x.y).z

(x.y) = x+y

x(x+y) = x

x + xy = x+y
DD-3

Theorems

Example 1 - Simplification
= ABD + ABD
= AB(D+D)
= AB

DD-3

Example 2 - Simplification
= (A+B ) (A+B)
= AA + AB + AB + B.B
= 0 + AB + AB + B
= B (A+A+1)
= B

DD-3

Example 3 - Simplification
= (A+B ) (ABC)(AC)
= [(A+B) + ABC + AC]
= [ A + B + ABC + AC]
= [A + B + AC]
= [A + B + C]
= ABC
DD-3

Example

A lift door control


Lift stops at a floor door will open
Passenger movement indicated by signal that is high
Passenger at door another signal high
Door should not close if passenger is moving or at door
Door close if call button is pressed or button inside lift
pressed

Switching equation

DD-3

Door close input to door should be 1

Y = B+BCD+BCD+AB+AB+BC

Y = (AB+C+D)(C+D)(C+D)(C+D+E)

Y = BC(C+AC) + (A+C)(AB+AC)

DD-3

Examples

Example

A lift door control


Lift stops at a floor door will open
Passenger movement indicated by signal that is high
Passenger at door another signal high
Door should not close if passenger is moving or at door
Door close if call button is pressed or button inside lift
pressed

Switching equation

DD-3

Door close input to door should be 1

Y = B+BCD+BCD+AB+AB+BC

Y = (AB+C+D)(C+D)(C+D)(C+D+E)

Y = BC(C+AC) + (A+C)(AB+AC)

DD-3

Examples

10

Example

A lift door control


Lift stops at a floor door will open
Passenger movement indicated by signal that is high
Passenger at door another signal high
Door should not close if passenger is moving or at door
Door close if call button is pressed or button inside lift
pressed

Switching equation

DD-3

Door close input to door should be 1

11

Y = B+BCD+BCD+AB+AB+BC

Y = (AB+C+D)(C+D)(C+D)(C+D+E)

Y = BC(C+AC) + (A+C)(AB+AC)

DD-3

Examples

12

(i) B+C

(ii) ABC + D

(iii) B(A+C)+AC

DD-3

Solutions

13

Why Simplify?

Minimize no. of gates

How ??

DD-3

Boolean Algebra
Karnaugh Map (K-Map)
Quine & McCluskey (QM)

14

Product term (P Term)

AND of n variables

1s

A.B.C.D

DD-3

Minterms

15

Sum Term (S Terms)

OR of n variables

0s

A+B+C

DD-3

Maxterms

16

Minterms & Maxterms


B

0
0
1
1
1
1
1
1
1

1
1
0
0
1
0
1
1
1

Minter
ms
m0 =
AB
m1 = AB

Maxter
ms
M0 =
A+B
M1 =
A+B
m2 = AB M2 =
A+B
m2 = AB M3 =
A+B

DD-3

17

Relationship btwn m0 and M0


m0

= AB

m 0

= (AB)

= (A) + (B)
=A+B

DD-3

M0

18

Minterms
2n -1

mi = 1

Proof
AB + AB + AB + AB
= A(B+B) + A(B+B)
= A + A
=1

DD-3

i=0

19

Maxterms
2n -1

Mi = 0

Proof
(A + B) (A +B )(A+B)(A+B)
= (A+ AB + AB + BB)(A+AB+AB+BB)
= (A+ AB + AB)(A+AB+AB)
= (A)(A)
=0

DD-3

i=0

20

Standard Form of Boolean


Expression

Canonical

Sum of Products (SOP)

F = ABC + ABC + ABC + ABC

Product of sums (POS)

F = (A+B+C)(A+B+C)(A+B+C)

DD-3

21

Canonical Form - SOP


f(A,B,C) = A(BC) + ABC

Standard Form

A(BC + BC) + ABC


ABC+ABC+ABC
ABC + ABC + ABC
m1 + m5 + m6
(1, 5, 6)

DD-3

f(A,B,C) = (1,5,6)

22

Canonical Form - POS


f(A,B,C) = (1,5,6)
f(A,B,C) = (0,2,3,4,7)
f(A,B,C) = (m0 + m2 + m3 + m4 + m7)
f(A,B,C) = (f(A,B,C,))
f(A,B,C) = (m0 + m2 + m3 + m4 + m7)
f(A,B,C) = m0m2m3m4m7
f(A,B,C) = M0 M2M3M4M7

(A+B+C)(A+B+C)(A+B+C)(A+B+C)(A+B+C)

DD-3

f(A,B,C) = (0,2,3,4,7)

23

Two level of implementation

AB+C(D+E)

DD-3

Why Canonical ???

24

Non-Std Repsn
A
B

AB

E
D
C

D+E

AB+C (D+E)

DD-3

C (D+E)

25

Std Rep
AB

C
D

CD

C
E

CE

AB +CD +CE

DD-3

A
B

26

You might also like