Simplification of SOP Expression

Prime Implicant (PI) is a product which is

obtained from the number of maximum
minterm combination from a square next to
K-map
Use largest possible cluster

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

Simplification of SOP Expression

No extra cluster

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

Simplification of SOP Expression

Algorithm 1
1. Count adjacent minterm number for each minterm in
K-map
2. Choose uncovered minterm with the least adjacent
minterm number. Choose only one if more than one
exist
3. Execute PI for that minterm and placed inside a loop.
If the minterm has been looped with more than one PI,
choose PI with the most minterm number
4. Repeat step 2 and 3 until all minterm is looped

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

Simplification of SOP Expression

Algorithm 2
1. Looped all PI in the K-map
2. Determine and choose all EPI to be looped
3. Choose minimum subset for the remained PI
to complete the loop (which used to loop
minterm which is not looped by the EPI)

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

Simplification of SOP Expression

Example

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

Simplification of SOP Expression

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

Simplification of SOP Expression

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

Obtaining POS Expression

Simplified POS expression can be obtained by

collecting maxter (I.e. 0) for the given function.
Example
Given F=m(0,1,2,3,5,7,8,9,10,11), we start with
draw K-map, then cluster the maxterm

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

Obtaining POS Expression

Given SOP for F is:

To obtain POS for F, we do:

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

Dont Care Condition

In certain problems, some

of the output is not
determined
The output can be 1 or 0
This is known as dont care
which is mark by X
Example: In odd parity
executor for BCD code, 6
is not used

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

10

Dont Care Condition

Dont care condition can be used to help us

in simplifying Boolean expression in Kmap
It can be 1 or 0 depends on which
expression is simpler

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

11

Dont Care Condition

As a comparison

Without dont cares

With dont cares

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

12

Simplification of SOP Expression

Example 1

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

13

Simplification of SOP Expression

Example 1

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

14

Simplification of SOP Expression

Example 1

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

15

Simplification of SOP Expression

Example 1

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

16

Simplification of SOP Expression

Example 1

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

17

Simplification of SOP Expression

Example 2

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

18

Simplification of SOP Expression

Example 2

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

19

Simplification of SOP Expression

Example 2

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

20

Simplification of SOP Expression

Example 3

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

21

Simplification of POS Expression

To obtain POS expression for example 2
Draw K-map for f complement which is f

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

22

Simplification of POS Expression

To obtain POS expression for example 3
Draw K-map for f complement which is f

MOHD. YAMANI IDRIS/ NOORZ

AILY MOHAMED NOOR

23