Scribd
Upload
33 views27 pages

Lec 12

The document discusses digital logic design topics including comparator circuits, Karnaugh maps, and the Quine-McCluskey method. It provides examples of using these techniques to minimize logic for a comparator that compares 2-bit and 3-bit numbers, and a circuit to detect odd prime numbers from a 5-bit input. It includes the detailed steps and tables used in the Quine-McCluskey method for several example functions.

Uploaded by

Aqeel Abbas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
33 views27 pages

Lec 12

The document discusses digital logic design topics including comparator circuits, Karnaugh maps, and the Quine-McCluskey method. It provides examples of using these techniques to minimize logic for a comparator that compares 2-bit and 3-bit numbers, and a circuit to detect odd prime numbers from a 5-bit input. It includes the detailed steps and tables used in the Quine-McCluskey method for several example functions.

Uploaded by

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

Digital Logic & Design

Dr. Waseem Ikram

Lecture 12
Recap
 Karnaugh Maps
 Mapping Standard POS expressions
 Mapping Non-Standard POS expressions
 Simplification of K-maps for POS
expressions
 SOP-POS conversion using K-map
 5-variable K-map
 Functions having multiple outputs
Comparator Circuit
 Inputs two 2-bit binary numbers A and B
 Has three outputs
 A>B
 A=B
 A<B
Function Table for A>B

Inputs Output Inputs Output


A1 A0 B1 B0 A>B A1 A0 B1 B0 A>B
0 0 0 0 0 1 0 0 0 1
0 0 0 1 0 1 0 0 1 1
0 0 1 0 0 1 0 1 0 0
0 0 1 1 0 1 0 1 1 0
0 1 0 0 1 1 1 0 0 1
0 1 0 1 0 1 1 0 1 1
0 1 1 0 0 1 1 1 0 1
0 1 1 1 0 1 1 1 1 0
Function Table for A=B

Inputs Output Inputs Output


A1 A0 B1 B0 A=B A1 A0 B1 B0 A=B
0 0 0 0 1 1 0 0 0 0
0 0 0 1 0 1 0 0 1 0
0 0 1 0 0 1 0 1 0 1
0 0 1 1 0 1 0 1 1 0
0 1 0 0 0 1 1 0 0 0
0 1 0 1 1 1 1 0 1 0
0 1 1 0 0 1 1 1 0 0
0 1 1 1 0 1 1 1 1 1
Function Table for A<B

Inputs Output Inputs Output


A1 A0 B1 B0 A<B A1 A0 B1 B0 A<B
0 0 0 0 0 1 0 0 0 0
0 0 0 1 1 1 0 0 1 0
0 0 1 0 1 1 0 1 0 0
0 0 1 1 1 1 0 1 1 1
0 1 0 0 0 1 1 0 0 0
0 1 0 1 0 1 1 0 1 0
0 1 1 0 1 1 1 1 0 0
0 1 1 1 1 1 1 1 1 0
Karnaugh Map for A>B

A 1 B1  A 0 B1 B 0  A 1 A 0 B 0
A1A0/
00 01 11 10
B1B0

00 0 0 0 0

01 1 0 0 0

11 1 1 0 1

10 1 1 0 0
Karnaugh Map for A=B

A 1 A 0 B1 B 0  A 1 A 0 B1B 0  A 1 A 0B1B 0  A 1 A 0B1 B 0


A1A0/
00 01 11 10
B1B0

00 1 0 0 0

01 0 1 0 0

11 0 0 1 0

10 0 0 0 1
Karnaugh Map for A<B

A 1B1  A 1 A 0B 0  A 0B1B 0
A1A0/
00 01 11 10
B1B0

00 0 1 1 1

01 0 0 1 1

11 0 0 0 0

10 0 0 1 0
Quine-McCluskey Method
 Difficult to manage K-maps of more than 4
variables
 With a 4-varaible K-map optimum groups
of 1s and 0s are not formed
Karnaugh Map

AB/
00 01 11 10
CD

00 0 1 1 0

01 0 0 1 1

11 1 1 1 1

10 1 1 1 0
Karnaugh Map

AB/
00 01 11 10
CD

00 0 1 0 0

01 0 1 1 1

11 1 1 1 0

10 0 0 1 0
Quine-McCluskey Method
 Programmed based approach
 Two step method
 Find Prime Implicants through exhaustive
search
 Selecting minimal set of essential prime
implicants
Quine-McCluskey Method (table1)
Minterm 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
Quine-McCluskey Method (table2)
Minterm A B C D used
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 
Quine-McCluskey Method (table3)
A B C D used
1,3 0 0 - 1 
1,9 - 0 0 1 
8,9 1 0 0 - 
8,12 1 - 0 0 
3,7 0 - 1 1 
3,11 - 0 1 1 
6,7 0 1 1 - 
6,14 - 1 1 0 
9,11 1 0 - 1 
9,13 1 - 0 1 
Quine-McCluskey Method (table3)
A B C D used
12,13 1 1 0 - 
12,14 1 1 - 0 
7,15 - 1 1 1 
11,15 1 - 1 1 
13,15 1 1 - 1 
14,15 1 1 1 - 
Quine-McCluskey Method (table4)
A B C D used

1,3,9,11 - 0 - 1

8,9,12,13 1 - 0 -

3,7,11,15 - - 1 1

6,7,14,15 - 1 1 -

9,11,13,15 1 - - 1

12,13,14,15 1 1 - -
Quine-McCluskey Method (table5)

1 3 6 7 8 9 11 12 13 14 15
BD x x x x
AC x x x x
CD x x x x
BC x x x x
AD x x x x
AB x x x x
Example 2
 Slightly different method that uses binary
values
Quine-McCluskey Method (table1)
Minterm A B C D

1 0 0 0 1
5 0 1 0 1
6 0 1 1 0
7 0 1 1 1
11 1 0 1 1
12 1 1 0 0
13 1 1 0 1
15 1 1 1 1
Quine-McCluskey Method (table2)
Minterm A B C D Used

1 0 0 0 1 
5 0 1 0 1 
6 0 1 1 0 
12 1 1 0 0 
7 0 1 1 1 
11 1 0 1 1 
13 1 1 0 1 
15 1 1 1 1 
Quine-McCluskey Method (table3)

Minterms Variable removed used


1,5 4
5,7 2 
5,13 8 
6,7 1
12,13 1
7,15 8 
11,15 4
13,15 2 
Quine-McCluskey Method (table4)

Minterms Term removed used

5,7,13,15 2,8
Quine-McCluskey Method (table5)

1 5 6 7 11 12 13 15

A CD x x

x x
ABC
x x
ABC

ACD x x

BD x x x x
Quine-McCluskey Method
 Comparator that compares two 3-bit
numbers
 6 variables, 64 input combinations
 Representing the comparator function
through function table long and tedious
 Represent three output functions in terms
of minterms
 Solve by Quine-McClusky method
Odd Prime Number Circuit
 Circuit detects odd prime numbers for a 5-
bit input number
 Function represented by minterms
1, 3, 5, 7, 11, 13, 17, 19, 23, 29 and 31

You might also like