Scribd
Upload
9 views33 pages

Tabular Method

The document discusses gate-level minimization techniques, focusing on Karnaugh maps and the Quine-McClusky method for simplifying Boolean functions with up to four variables. It outlines the steps for using the tabular method, including identifying prime implicants and essential prime implicants, and provides an example of simplifying a function using both K-map and tabular methods. The final result demonstrates the optimal expression derived from the prime implicant table.

Uploaded by

Ibnu Hussain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views33 pages

Tabular Method

The document discusses gate-level minimization techniques, focusing on Karnaugh maps and the Quine-McClusky method for simplifying Boolean functions with up to four variables. It outlines the steps for using the tabular method, including identifying prime implicants and essential prime implicants, and provides an example of simplifying a function using both K-map and tabular methods. The final result demonstrates the optimal expression derived from the prime implicant table.

Uploaded by

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

Gate-level Minimization - 02

Vimukthi Pathirana
MEng. (AIT), BSc Eng. (AIT), reading MBA(UOP)
Content Today
• Karnaugh map / K-map
• 2 variables
• 3 variables
• 4 variables

• Tabular Method
• 4 variables
Quine Mcclusky Method
(Tabular Method)
Step 1
• In the 1st column, list all the minterms in binary for
which the output is a 1 or don’t care.
Step 2
• Arrange the terms present in column 1 and column 2
considering the number of 1’s in each term.
Step 3
• Identify terms that differ from another by only 1 digit
and list them in the 3rd column.
• Replace the different digit by hyphen (-).
Step 4
• Repeat step 3 until no more combination can be
made.
Step 5
• The term which are not carried to the next column are
called “PRIME IMPLICANTS”.
• Select sufficient prime implicants to cover all the
minterms.
• For this purpose, prepare a “table of choice” (prime
implicant table).
Prime Implicant (PI)
• To prepare a table of choice, write PI’s in rows and
minterms in columns and check the minterms covered by
each PI.
• If a Minterm is present only in one PI, that PI is called and
“Essential PI”

• Implicants – Groups of 1’s


• Prime Implicants – Largest groups of 1’s
• Essential Prime implicant – Having at least 1 minterm that cannot group any
other way
Step 6
• Select the optimal set of PI; which covers all the
original minterms, and this gives the solution.
Example
• Z = f (A, B, C, D)
• Z= 1 for the minterms (0, 3, 5, 11, 13)
• Z = don’t care for the minterms (1, 4, 12)
• Z = 0 for the remaining minterms

• Simplify Z using:
• K – Map method
• Tabular method
Z = f (A, B, C, D)
Z= 1 for the minterms (0, 3, 5, 11, 13)
Step 1
Z = don’t care for the minterms (1, 4, 12)
Z = 0 for the remaining minterms

col1 col2 col3 col4


MT ABCD MT ABCD MT ABCD MT ABCD
Z = f (A, B, C, D)
Z= 1 for the minterms (0, 3, 5, 11, 13)
Step 1
Z = don’t care for the minterms (1, 4, 12)
Z = 0 for the remaining minterms

col1 col2 col3 col4


MT ABCD MT ABCD MT ABCD MT ABCD
0
3
5
11
13
1
4
12
Z = f (A, B, C, D)
Z= 1 for the minterms (0, 3, 5, 11, 13)
Step 1
Z = don’t care for the minterms (1, 4, 12)
Z = 0 for the remaining minterms

col1 col2 col3 col4


MT ABCD MT ABCD MT ABCD MT ABCD
0 0000
3 0011
5 0101
11 1011
13 1101
1 0001
4 0100
12 1100
Step 2
col1 col2 col3 col4
MT ABCD MT ABCD MT ABCD MT ABCD
0 0000 0 0000
3 0011
5 0101
11 1011
13 1101
1 0001
4 0100
12 1100
Step 2
col1 col2 col3 col4
MT ABCD MT ABCD MT ABCD MT ABCD
0 0000 0 0000
3 0011 1 0001
5 0101 4 0100
11 1011
13 1101
1 0001
4 0100
12 1100
Step 2
col1 col2 col3 col4
MT ABCD MT ABCD MT ABCD MT ABCD
0 0000 0 0000
3 0011 1 0001
5 0101 4 0100
11 1011 3 0011
13 1101 5 0101
1 0001 12 1100
4 0100
12 1100
Step 2
col1 col2 col3 col4
MT ABCD MT ABCD MT ABCD MT ABCD
0 0000 0 0000
3 0011 1 0001
5 0101 4 0100
11 1011 3 0011
13 1101 5 0101
1 0001 12 1100
4 0100 11 1011
12 1100 13 1101
Step 3
col1 col2 col3 col4
MT ABCD MT ABCD MT ABCD MT ABCD
0 0000 0 0000 (0,1) 000 –
(0,4) 0 – 00
3 0011 1 0001
5 0101 4 0100
11 1011 3 0011
13 1101 5 0101
1 0001 12 1100
4 0100 11 1011
12 1100 13 1101
Step 3
col1 col2 col3 col4
MT ABCD MT ABCD MT ABCD MT ABCD
0 0000 0 0000 (0,1) 000 –
(0,4) 0 – 00
3 0011 1 0001 (1,3) 00 – 1
(1,5) 0 – 01
5 0101 4 0100 (4,5) 010 –
(4,12) – 100
11 1011 3 0011
13 1101 5 0101
1 0001 12 1100
4 0100 11 1011
12 1100 13 1101
Step 3
col1 col2 col3 col4
MT ABCD MT ABCD MT ABCD MT ABCD
0 0000 0 0000 (0,1) 000 –
(0,4) 0 – 00
3 0011 1 0001 (1,3) 00 – 1
(1,5) 0 – 01
5 0101 4 0100 (4,5) 010 –
(4,12) – 100
11 1011 3 0011 (3,11) – 011
13 1101 5 0101 (5,13) – 101
1 0001 12 1100 (12,13) 110 –
4 0100 11 1011
12 1100 13 1101
Step 3
col1 col2 col3 col4
MT ABCD MT ABCD MT ABCD MT ABCD
0 0000 0 0000 (0,1) 000 – (0,1,4,5) 0–0–
(0,4) 0 – 00 (0,4,1,5) 0–0–
3 0011 1 0001 (1,3) 00 – 1
(1,5) 0 – 01
5 0101 4 0100 (4,5) 010 –
(4,12) – 100
11 1011 3 0011 (3,11) – 011
13 1101 5 0101 (5,13) – 101
1 0001 12 1100 (12,13) 110 –
4 0100 11 1011
12 1100 13 1101
Step 3
col1 col2 col3 col4
MT ABCD MT ABCD MT ABCD MT ABCD
0 0000 0 0000 (0,1) 000 – (0,1,4,5) 0–0–
(0,4) 0 – 00 (0,4,1,5) 0–0–
3 0011 1 0001 (1,3) 00 – 1 (4,5,12,13) – 10 –
(1,5) 0 – 01 (4,12,5,13) – 10 –

5 0101 4 0100 (4,5) 010 –


(4,12) – 100
11 1011 3 0011 (3,11) – 011
13 1101 5 0101 (5,13) – 101
1 0001 12 1100 (12,13) 110 –
4 0100 11 1011
12 1100 13 1101
Step 3
col1 col2 col3 col4
MT ABCD MT ABCD MT ABCD MT ABCD
0 0000 0 0000 (0,1) 000 – (0,1,4,5) 0–0–
(0,4) 0 – 00 (0,4,1,5) 0–0–
3 0011 1 0001 (1,3) 00 – 1 (4,5,12,13) – 10 –
(1,5) 0 – 01 (4,12,5,13) – 10 –

5 0101 4 0100 (4,5) 010 –


(4,12) – 100
11 1011 3 0011 (3,11) – 011
13 1101 5 0101 (5,13) – 101
1 0001 12 1100 (12,13) 110 –
4 0100 11 1011
12 1100 13 1101
Step 3
col1 col2 col3 col4
MT ABCD MT ABCD MT ABCD MT ABCD
0 0000 0 0000 (0,1) 000 – (0,1,4,5) 0–0–
P
(0,4) R 0 – 00 (0,4,1,5) 0–0–
3 0011 1 0001 (1,3) 00 – 1 (4,5,12,13) – 10 –
(4,12,5,13) – 10 – Q
(1,5) 0 – 01
5 0101 4 0100 (4,5) 010 –
(4,12) – 100
S
11 1011 3 0011 (3,11) – 011
13 1101 5 0101 (5,13) – 101
1 0001 12 1100 (12,13) 110 –
4 0100 11 1011
12 1100 13 1101
Prime Implicant Table

MT 0 3 5 11 13 1 4 12
PI
!𝑪
𝑨 ! P
!
𝑩𝑪 Q
!𝑩
𝑨 !𝑫 R
! 𝑪𝑫
𝑩 S
Prime Implicant Table

MT 0 3 5 11 13 1 4 12
PI
!𝑪
𝑨 ! P √ √ √ √
!
𝑩𝑪 Q
!𝑩
𝑨 !𝑫 R
! 𝑪𝑫
𝑩 S
Prime Implicant Table

MT 0 3 5 11 13 1 4 12
PI
!𝑪
𝑨 ! P √ √ √ √
!
𝑩𝑪 Q √ √ √ √
!𝑩
𝑨 !𝑫 R √ √
! 𝑪𝑫
𝑩 S √ √

Z = P + Q+ S
Prime Implicant Table

MT 0 3 5 11 13 1 4 12
PI
!𝑪
𝑨 ! P √ √ √ √
!
𝑩𝑪 Q √ √ √ √
!𝑩
𝑨 !𝑫 R √ √
! 𝑪𝑫
𝑩 S √ √

Z = P + Q+ S Z = 𝐴̅𝐶̅ + 𝐵𝐶̅ + 𝐵𝐶𝐷


&
Z = f (A, B, C, D)
Z= 1 for the minterms (0, 3, 5, 11, 13) using K – Maps
Z = don’t care for the minterms (1, 4, 12)
X Z = 0 for the remaining minterms
CD
AB
00 01 11 10
0 1 3 2
00
1 X 1 Z = 𝐴̅𝐶̅ + 𝐵𝐶̅ + 𝐵𝐶𝐷
&
4 5 7 6
01
X 1
12 13 15 14
11
X 1
8 9 11 10
10
1
Exercise - 01
• Z = f (A, B, C, D)
• Z= 1 for the minterms (0, 2, 5, 11, 13, 15)
• Z = don’t care for the minterms (7, 8 ,10)
• Z = 0 for the remaining minterms

• Simplify Z using:
• K – Map method
• Tabular method
Exercise - 02
• Z = f (A, B, C, D)
• Z= 1 for the minterms (3, 6, 8, 12, 13, 14)
• Z = don’t care for the minterms (2, 7, 9)
• Z = 0 for the remaining minterms

• Simplify Z using:
• K – Map method
• Tabular method
Exercise - 03
• Z = f (A, B, C, D)
• Z= 1 for the minterms (7, 8, 9, 10, 14, 15)
• Z = don’t care for the minterms (6, 12)
• Z = 0 for the remaining minterms

• Simplify Z using:
• K – Map method
• Tabular method

You might also like