Quine McCluskey Tabulation

Abstract:

This assignment has three parts. Main part is all about how to minimise Boolean function by
using Quine McCluskey algorithm. And the other two parts are how to write the function in
POS two level (Product of Sum ) and SOP two level (Sum of Product) form, And then to
simulate on multism. And also to show the equivalence of two form. A demonstration of the
working function would be required in the lab.

Introduction:

Quine Mccluskey Tabulation method was developed by W.V.Quine and Edward J.Mccluskey
in 1956. Functionally it is identical to k-map. Karnaugh-map is a graphical representation of
the logic system but only effective up to 6 variables. Function of more than 6 variables can’t
be minimised from k-map. Quine Mccluskey Tabulation method widely used for a function
more than 6 variables. The tabulation form makes it very useful to be used in computer
algorithms. The main part of this method is to find the prime implicants and then use those
prime implicants in a chart to find out the essential prime implicants of the function.

Main Body:

In this assignment a function of 6 variables would be minimised by Quine McCluskey

Tabulation method, which has been stated bellow.

F (UVWXYZ) = ∑ (12,13,14,15,28,29,30,31,44,45,46,47,54,55,60,61,62,63)

A given function with don’t care has to be minimised and simplified in Boolean expression.

With don’t care’s D (UVWXYZ) = ∑ (10, 36, 38, 39, 52)

First of all the truth table has been formed for a 6 variables function, which gives 64 different
combinations of bits. Quine McCluskey algorithm has two main parts. In first part prime
implicants need to be found and then putting those prime implicants in a chart to identified
an essential prime implicant. Finding prime implicants is very straight forward. To find prime
implicants, all the terms from function have to be separated in sanctions of same numbers of
“1” in those terms. And then to collect all the terms which changes by only one bit. And put a
dash (-) in place of that changing bit to merge both of them. And put the new term in a new
table. The same procedure has to be repeated until all the terms which differ by only one bit
have been collected. The terms which have no pair in the tables are the prime implicants.

Make notes of those prime implicants and then put it in the chart to find out the essential
prime implicants. In the chart if there is only one “X” in a column which cannot be collected
from any other mean, so it does mean that the term representing that “X” in the column is the
essential prime implicant, Mark that term with star. So take out that term from the chart with
all the terms which eliminate with this term. And then look for rows which eliminate the
highest rows and columns together. Combining those terms makes the minimised function.
In this assignment the essential prime implicant is “WX”.
The truth table for function F (UVWXYZ) has been given bellow. With don’t care.
F (UVWXYZ) = ∑ (12,13,14,15,28,29,30,31,44,45,46,47,54,55,60,61,62,63)
With don’t care’s D (UVWXYZ) = ∑ (10, 36, 38, 39, 52)

Truth Table: 1

U V W X Y Z Decimal F(UVWXYZ)
0 0 0 0 0 0 0 0
0 0 0 0 0 1 1 0
0 0 0 0 1 0 2 0
0 0 0 0 1 1 3 0
0 0 0 1 0 0 4 0
0 0 0 1 0 1 5 0
0 0 0 1 1 0 6 0
0 0 0 1 1 1 7 0
0 0 1 0 0 0 8 0
0 0 1 0 0 1 9 0
0 0 1 0 1 0 10 X
0 0 1 0 1 1 11 0
0 0 1 1 0 0 12 1
0 0 1 1 0 1 13 1
0 0 1 1 1 0 14 1
0 0 1 1 1 1 15 1
0 1 0 0 0 0 16 0
0 1 0 0 0 1 17 0
0 1 0 0 1 0 18 0
0 1 0 0 1 1 19 0
0 1 0 1 0 0 20 0
0 1 0 1 0 1 21 0
0 1 0 1 1 0 22 0
0 1 0 1 1 1 23 0
0 1 1 0 0 0 24 0
0 1 1 0 0 1 25 0
0 1 1 0 1 0 26 0
0 1 1 0 1 1 27 0
0 1 1 1 0 0 28 1
0 1 1 1 0 1 29 1
0 1 1 1 1 0 30 1
0 1 1 1 1 1 31 1
1 0 0 0 0 0 32 0
1 0 0 0 0 1 33 0
1 0 0 0 1 0 34 0
1 0 0 0 1 1 35 0
1 0 0 1 0 0 36 X
1 0 0 1 0 1 37 0
1 0 0 1 1 0 38 X
1 0 0 1 1 1 39 X
1 0 1 0 0 0 40 0
1 0 1 0 0 1 41 0
1 0 1 0 1 0 42 0
1 0 1 0 1 1 43 0
1 0 1 1 0 0 44 1
1 0 1 1 0 1 45 1
1 0 1 1 1 0 46 1
1 0 1 1 1 1 47 1
1 1 0 0 0 0 48 0
1 1 0 0 0 1 49 0
1 1 0 0 1 0 50 0
1 1 0 0 1 1 51 0
1 1 0 1 0 0 52 X
1 1 0 1 0 1 53 0
1 1 0 1 1 0 54 1
1 1 0 1 1 1 55 1
1 1 1 0 0 0 56 0
1 1 1 0 0 1 57 0
1 1 1 0 1 0 58 0
1 1 1 0 1 1 59 0
1 1 1 1 0 0 60 1
1 1 1 1 0 1 61 1
1 1 1 1 1 0 62 1
1 1 1 1 1 1 63 1
Step -1: Sort into sections and tabulate according to the number of ‘1’s in each term. At this
stage don’t cares should also be included.

Prime Implicants Table: 2

Section No of ‘1’s Binary Decimal

001010 10 
1 2 001100 12 
100100 36 
001101 13 
001110 14 
2 3 011100 28 
100110 38 
101100 44 
110100 52 
001111 15 
011101 29 
011110 30 
3 4 100111 39 
101101 45 
101110 46 
110110 54 
111100 60 
011111 31 
101111 47 
4 5 110111 55 
111101 61 
111110 62 
5 6 111111 63 

Step -2: Form all possible combinations between section 1 & 2, 2 & 3, 3 & 4 and 4 & 5

Table: 3

Section No of Binary Decimal Binary 2nd Column

st
‘1’s 1’ Column Sec 1 & 2 Combined

001010 10 001–10 10,14×

1 2 001100 12 00110– 12,13
100100 36 0011–0 12,14
001101 13 0–1100 12,28
001110 14 1001–0 36,38
 2 3 011100 28 1–0100 36,44
100110 38 1–0100 36,52
101100 44 Binary 2nd Column
110100 52 Sec 2 & 3 Combined
001111 15 0011–1 13,15
011101 29 0–1101 13,29
011110 30 –01101 13,45
3 4 100111 39 00111– 14,15
101101 45 0–1110 14,30
101110 46 –01110 14,46
110110 54 01110 – 28,29
111100 60 0111–0 28,30
011111 31 –11100 28,60
101111 47 10011– 38,39
4 5 110111 55 10–110 38,46
111101 61 1–0110 38,54
111110 62 10110– 44,45
5 6 111111 63 1011–0 44,46
1–1100 44,60
1101–0 52,54
11–100 52,60
Binary 2nd Column
Sec 3 & 4 Combined

0–1111 15,31
–01111 15,47
0111–1 29,31
–11101 29,61
01111– 30,31
–11110 30,62
10–111 39,47
1011–1 45,47
1–1101 45,61
10111– 46,47
1–1110 46,62
11011– 54,55
11–110 54,62
11110– 60,61
1111–0 60,62
Binary 2nd Column
Sec 4 & 5 Combined

–11111 31,63
1–1111 47,63
11–111 55,63
1111–1 61,63
11111– 62,63

Step -3: On completion of 2nd column, a 3rd and 4th column has been formed to combine
terms in adjacent sections of column 2 and then in column 4.

Table: 4
 Column - 2 Decimal Column - 3 Decimal Column - 4 Decimal

001–10 10,14× 0011–– 12,13,14,15 0–11–– 12,28,13,29,14,15,30,31

00110– 12,13 0–110– 12,13,28,29 ––110– 12,28,13,29,44,45,60,61
0011–0 12,14 –0110– 12,13,44,45 ––11–0 12,28,44,60,14,30,46,60
0–1100 12,28 0–11–0 12,14,28,30 –011–– 12,14,13,15,44,45,46,47
1001–0 36,38 –011–0 12,14,44,46 1––1–0 36,38,44,46,52,54,60,62x
1–0100 36,44 ––1100 12,28,44,60 ––11–1 13,15,45,47,29,31,61,63
1–0100 36,52 10–1–0 36,38,44,46 ––111– 14,15,30,31,46,47,62,63
0011–1 13,15 1–01–0 36,38,52,54 –111–– 28,29,30,31,60,61,62,63
0–1101 13,29 1––100 36,44,52,60 1––11– 38,39,46,47,54,55,62,63x
–01101 13,45 0–11–1 13,15,29,31 1–11–– 44,45,46,47,60,61,62,63
00111– 14,15 –011–1 13,15,45,47
0–1110 14,30 ––1101 13,45,29,61 Column - 5 Decimal
–01110 14,46 0–111– 14,15,30,31
01110 – 28,29 –0111– 14,15,46,47 ––11–– 12,28,13,29,14,15,30,31,
44,45,46,47,60,61,62,63x
0111–0 28,30 – –1110 14,30,46,62
–11100 28,60 0111–– 28,29,30,31
10011– 38,39 –1110– 28,29,60,61
10–110 38,46 –111–0 28,30,60,62
1–0110 38,54 10–11– 38,39,46,47
10110– 44,45 1–011– 38,39,54,55
1011–0 44,46 1––110 38,46,54,62
1–1100 44,60 1011– – 44,45,46,47
1101–0 52,54 1–110– 44,45,60,61
11–100 52,60 1–11–0 44,60,46,62
0–1111 15,31 11–1–0 52,54,60,62
–01111 15,47 ––1111 15,31,47,63
0111–1 29,31 –111–1 29,31,61,63
–11101 29,61 –1111– 30,31,62,63
01111– 30,31 1––111 39,47,55,63
–11110 30,62 1–111– 46,47,62,63
10–111 39,47 1–11–1 45,47,61,63
1011–1 45,47 11–11– 54,55,62,63
1–1101 45,61 1111–– 60,61,62,63
10111– 46,47
1–1110 46,62
11011– 54,55
11–110 54,62
11110– 60,61
1111–0 60,62
–11111 31,63
1–1111 47,63
11–111 55,63
1111–1 61,63
11111– 62,63

All terms not ticked are ‘Prime Implicants’ (PI) of the function generate Boolean form of PI’s.
In this function four prime implicants have been identified from the above tables.

Table: 5

Boolean Form Prime Implicant Decimal

 \U\VWY/Z 001–10 10,14
UX/Z 1––1–0 36,38,44,46,52,54,60,62
UXY 1––11– 38,39,46,47,54,55,62,63
WX ––11–– 12,28,13,29,14,15,30,31,
44,45,46,47,60,61,62,63,

If a column has only on ‘X’ then that prime implicant is essential. Column highlighted with red
strips has only one ‘X’ which can’t be collected from any other combination. Prime implicant
‘WX’ is essential, which has been indicated with star. As shown in table: 6

Chart: 1

PI 12 1 14 15 28 2 30 3 44 45 4 47 54 55 6 61 6 63 K-map
3 9 1 6 0 2

/U/VWY/Z X 10,14,

UX/Z X X X X X 36,38,44,46,
52,54,60,62
38,39,46,47,
UXY X X X X X X 54,55,62,63

12,28,13,29,14,
WX * X X X X X X X X X X X X X X X X 15,30,31,44,45,
46,47,60,61,62,
63,

Chart: 2

PI 1 1 1 1 2 2 3 3 4 4 4 4 5 5 6 6 6 6
2 3 4 5 8 9 0 1 4 5 6 7 4 5 0 1 2 3

/U/ X
VWY/Z

UX/Z X X X X X

UXY X X X X X X

WX * X X X X X X X X X X X X X X X X

F = WX + UXY

Part 2:

In second part the function is required to be implemented using AND/OR 2-level form, And
simulation proof need to verify the function is correct. First of write the function in Boolean
expression with all variables included.

F (UVWXYZ) = ∑ (12,13,14,15,28,29,30,31,44,45,46,47,54,55,60,61,62,63)
F = /u/vwx/y/z + /u/vwx/yz + /u/vwxy/z + /u/vwxyz +/uvwx/y/z + /uvwx/yz + /uvwxy/z +
/uvwxyz + u/vwx/y/z + u/vwx/yz + u/vwxy/z + u/vwxyz + uv/wxy/z + uv/wxyz +uvwx/y/z
+uvwx/yz + uvwxy/z + uvwxyz

Part 3:

Conclusion:

References: