You are on page 1of 13

Boolean Expression Simplification

Algebra Method Map Method

Algebraic Manipulation
The use of identities to simplify boolean expressions De Morgans, Associativity, etc. Awkward since it lacks specific rules to predict each succeeding step in the manipulative process Difficult to determine whether the simplest expression has been achieved.

Map Method
Provides a straightforward procedure for simplifying Boolean functions up to four variables. The map is also known as the Karnaugh map or K-map. The map is a diagram made up of squares with each square representing one minterm of the function. A Boolean function is recognized graphically in the map by those squares whose minterms are included in the function.

Map Method
By recognizing various patterns, the user can derive alternative algebraic expressions for the same function, from which the simplest can be selected. The simplified expressions produced by the map are always in sum-of-products or product-of-sum form. It is sometimes possible to produce two or more expressions that satisfy the simplification criterion.

Types of Maps
- According to number of variables Two-Variable Map Three-Variable Map Four-Variable Map

Two-variable map
A

AB A B AB
Fig. (a)

m0
B

m2 m3

AB

m1
Fig. (b)

A B

0 1

0 0 1
Fig. (c)

1 2 3

Two-variable map
Example : f(A,B)= m(0,3) A B

0 1

0 1

1 What is the algebraic expression represented by the map?

Two-variable map
Example B A

0 1
B A

1 1 1 1 1 3

1 0 0 2

What is the logical sum and the boolean expression represented by the map?

0 1

AB A B

A B AB

Two-variable map
Simplifying B A

0 1 1 AB A B

1 1 1 A B

m1+m2+m3= AB+AB+AB = AB+A(B+B) = A+AB = A+B

A+B AB

Three-variable map
Three-variable map has eight squares. Notice that the last two columns are not in numeric order. That is the key idea that makes the map work.

AB C

00

01

11 6 ABC 7 ABC

10 4 ABC 5 ABC

0 1

0 ABC 2 ABC 1 ABC 3 ABC

Three-variable map
Example: F(A,B,C)= m(2,3,4,5)
C AB 00 01 2 1 ABC 3 ABC 11 6 ABC 7 ABC 10 4 1 ABC 5 1 ABC

0 1

0 ABC 1 ABC

What is the simplified expression?

Exercise
Plot the following on a Karnaugh map
F(a,b,c)= m(0,1,3,6)

Determine the simplified Boolean expression in terms of sum-of-products using K-map. Show also algebraic manipulation for simplification to verify your answer. F(A,B,C)= m(0,1,4,5) g= pqr+pqr+pqr+pqr+pqr

Next meeting
Four-variable map Product-of-sums simplification

You might also like