1) Mapping Non-standard SOP expression

Following is an example of non-standard SOP expression:

A+BC'

As there are 3 variables in the SOP expression therefore there will be total 8 (23) cells in
the k-map. In the table given below, the left most column represents the variable A and B
whereas the top row represents the variable C. There are 2 variables in the left most
column therefore there will be 4 (22) possible input combinations. Similarly, the top row
has only one variable therefore there will be total 2 (21) input combinations.

The expression A+BC' can be mapped directly to k-map without converting into standard
SOP form.

Mapping A to k-map

First, the term A from the expression A+BC' will be mapped to k-map. All the cells in the
k-map will be marked as 1 where A = 1. As third and fourth input combination in the left
most column has value A =1 therefore all such cells will be marked as 1.

AB\C 0 1

00

A=1 01

11 1 1

10 1 1

Mapping BC’ to k-map

Then term BC' will be mapped to the k-map. All the cells in the k-map will be marked as
1 where B =1 and C = 0. As second and third input combinations in the left most column
has value B =1 and first input combination in the top row has value C = 0 therefore all
such cells will be marked as 1.
C=0

AB\C 0 1
00
B=1 01 1
11 1
10

Final table for the expression A+BC' will be as follow:

AB\C 0 1
00 0 0
01 1 0
11 1 1
10 1 1

Example 2

As there are 4 variables in the above SOP expression therefore there will be total 16 (24)
cells in the k-map. In the table given below, the left most column represents the variable
A and B whereas the top row represents the variable C and D. There are 2 variables in
the left most column therefore there will be 4 (22) possible input combinations. Similarly,
the top row has two variables therefore there will be total 4 (24) input combinations.

Mapping D to k-map

First, the term D from the above expression will be mapped to k-map. All the cells in the
k-map will be marked as 1 where D = 1. As second and third input combination in the top
row has value D =1 therefore all cells corresponding to these columns will be marked as
1.
D=1

AB\CD 00 01 11 10

00 1 1

01 1 1

11 1 1

10 1 1
 Mapping AC’ to k-map

Then term AC' will be mapped to the k-map. All the cells in the k-map will be marked as
1 where A =1 and C = 0. As third and fourth input combinations in the left most column
has value A =1. Similarly, first and second input combination in the top row has value C
= 0 therefore such cells will be marked as 1.
C=0

AB\CD 00 01 11 10

00

A=1 01

11 1 1

10 1 1

Mapping BC to k-map

Then term BC will be mapped to the k-map. All the cells in the k-map will be marked as
1 where B =1 and C = 1. As second and third input combinations in the left most column
has value B =1. Similarly, third and fourth input combination in the top row has value C
= 1 therefore such cells will be marked as 1.

C =1

B=1 AB\CD 00 01 11 10

00

01 1 1

11 1 1

10

Final table will be as follow:

 AB\C 00 01 11 10
00 0 1 1 0
01 0 1 1 1
11 1 1 1 1
10 1 1 1 0

2) Quin McCluskey Method

The Quin McCluskey method is based on exhaustive search. It is a two step method. In
the first step prime implicants are found by exhaustive search. In the second step,
minimal prime implicants are found.

A handout example of Quin McCluskey method having minterms 1, 3, 6, 7, 8, 9, 11, 12,

13, 14, 15 is given below:

Step1:

The table of minterm is given below:

Minterms A B C D

1 0 0 0 1

3 0 0 1 1

6 0 1 1 0

7 0 1 1 1

8 1 0 0 0

9 1 0 0 1

11 1 0 1 1

12 1 1 0 0

13 1 1 0 1

14 1 1 1 0
 15 1 1 1 1

In the table given bellow, the minterms are arranged in the groups of 1, 2, 3 and 4 1s.

The first group contains minterm (1 and 8) having one 1s.

The second group contains minterm (3, 6, 9, 12) having two 1s.

The third group contains minterm (7, 11, 13, 14) having three 1s.

The fourth group contains minterm (15) having four 1s.

Minterms A B C D

1 0 0 0 1

8 1 0 0 0

3 0 0 1 1

6 0 1 1 0

9 1 0 0 1

12 1 1 0 0

7 0 1 1 1

11 1 0 1 1

13 1 1 0 1

14 1 1 1 0

15 1 1 1 1

Each minterm in one group is compared with minterm of other group. The minterm 1 in
the first group is compared with each minterm in the second group. When we compare 1
with 3 then one variable will be removed which is C. When we compare 1 with 6 then no
variable will be removed. The comparison of others minterm will continue in the same
manner. The minterms which have been used will be marked.
The exhaustive search for finding prime implicants has not completed. The three variable
terms in table 12.4 are compared to eliminate another single variable. All terms that
combine to eliminate a variable are represented in table 12.5.

The searching will stop here as no more minterms can be compared.

The minterm marked as unused are prime implicants.

Step 2:

The cells are marked to determine the essential prime implicants and to simplify the
Boolean expression. The prime implicants found in the first step of Quin McCluskey
method are listed in left most column of prime implicant table whereas all minterms are
listed in the top row.
In the second step, all essential prime implicants are found. We mark the cell which is
covered by only one prime implicant.

In handouts table 12.6, minterm 1 has only one prime implicant B’D therefore we mark
this cell

The minterm 6 has only 1 prime implicant BC therefore we mark this cell.

The minterm 8 has only one prime implicant AC’ therefore we mark this cell.

If you notice then you can see that identified prime implicants B’D, BC and AC’ covers
all minterms. The prime implicants CD, AD and BD are redundant and are not required.

The Simplified Expression is: B’D + BC + AC’

3) Canonical Form

Generally, in mathematics, a canonical form (often called normal form or standard form)
of an object is a standard way of presenting that object.

Boolean Expression can be defined using a function such as SOP Boolean expression can
be defined as canonical sum.
Following Boolean expression can be expressed in canonical sum as:

A'B'C + A'BC + AB'C + ABC

Canonical Sum = ∑(A,B,C)(1,3, 5, 7)

All the canonical terms defined in canonical sum will have output 1 in the truth table.

4) Odd Parity Generator Circuit

Parity method is used to detect errors while transmitting information from one end to
other end. There are two methods: even parity bit method and odd parity bit method. An
extra bit is appended at the end of binary information to detect error. We can use both
even parity and odd parity method to detect errors.

Odd parity method: With odd bit parity method, the total number of 1s is counted to
make it equal to odd number of 1s. If the number of 1s is odd then appended bit is 0
otherwise the appended bit is 1 so that total number of 1s becomes odd.
For example, 8 bit binary information to be transmitted is 11001000. The total number of
1s in the information is odd so we append 0 at the end of binary information to make it
equal to odd number of 1s such as 110010000. Similarly, if the 8 bit binary information is
11001001 then we append 1 at the end of binary data to make the number of 1s equal to
odd such as 110010011.

In the function table of odd-parity generator circuit given below, if the number of 1s in
the output is odd then output will be 0 otherwise if the total numbers of 1s in the input is
even then output will be 1.

Inputs Output
D3 D2 D1 D0 F
0 0 0 0 1
0 0 0 1 0
0 0 1 0 0
0 0 1 1 1
0 1 0 0 0
0 1 0 1 1
0 1 1 0 1
0 1 1 1 0
1 0 0 0 0
1 0 0 1 1
1 0 1 0 1
1 0 1 1 0
1 1 0 0 1
1 1 0 1 0
1 1 1 0 0
1 1 1 1 1