Digital Logic Design

1. M. Morris Mano, “Digital Logic Design”, Prentice Hall, 2018.

2. Anand Kumar, “Fundamentals of Digital Circuits”, Prentice Hall, 2014.
3. R. P. Jain, “Modern Digital Electronics”, Tata McGraw Hill, 2009.
 Karnaugh Map

• Karnaugh Map offers a visual solution

• Basic idea
– Arrange minterms/maxterms in 2D/3D map, one cell: one
minterm/maxterm
– Adjacent cell: only one variable change
– Use of gray code
 Karnaugh Map for 3 and 4 variables

• Three variable K-Map for • Four variable K-Map for

minterms minterms
A’ A A’B’ A’B AB AB’
B’C’ 0 4 C’D’ 0 4 12 8
B’C 1 5 C’D 1 5 13 9
BC 3 7 CD 3 7 15 11
BC’ 2 6 CD’ 2 6 14 10
 Karnaugh Map for 3 and 4 variables

• Three variable K-Map for • Four variable K-Map for

minterms minterms
A’ A A’B’ A’B AB AB’
B’C’ 000 100 C’D’ 0000 0100 1100 1000
B’C 001 101 C’D 0001 0101 1101 1001
BC 011 111 CD 0011 0111 1111 1011
BC’ 010 110 CD’ 0010 0110 1110 1010

• Adjacent terms can be united

• Adjacencies are rotatory in nature
• Group of 2, 4 or 8 can be formed (2N)
 Examples

• F(A, B, C) = ∑ m(1, 3, 7)

F = A’C + BC
A
0 1 A’C
00
01 1 BC
BC
11 1 1
10
 Examples

• F(A, B, C) = ∏ M(0, 2, 4 , 5, 6)

F = C(A’ + B)
A
0 1
00 0 0 B + A’

01 0
BC
11 C
10 0 0
 Examples

• F(A, B, C, D) = ∑ m(1, 3, 5, 7, 9) + ∑ d(6, 12, 13)

F = A’D + B’C’D
AB
(without don’t care)
00 01 11 10

00 X C’D

01 1 1 X 1 B’C’D
CD
11 1 1 A’D

10 FX = A’D + C’D
(including don’t care)
 Examples

• F(A, B, C) = ABC’ + B’C + A’ (minimize it further)

F = A’ + B’C
A A’ + BC’
0 1
00 1 B’C
01 1 1
BC
11 1 BC’
10 1 1
 Examples

• F(A, B, C, D) = ∑ m(2, 3, 5, 7, 10, 11, 13, 14, 15)

1. Implicant
AB
2. Prime Implicant
00 01 11 10
3. Essential Prime Implicant
00 (5,13), (7,15), (3,7), …
01 (5,13,7,15)
1 1 = BD
CD (3,7,15,11)
11 1 1 1 1
(2,3,10,11) = CB’
10 1 (15,14,11,10)
1 1 = AC
F = BD + CB’ + AC
 Examples

• F(A, B, C, D) = ∑ m(0, 1, 2, 4, 5, 7, 11, 15)

(0,2)
AB = A’B’D’
(11,15) = ACD
00 01 11 10
(0,4,1,5) = A’C’
00 1 1

01 1 (7,15)
1 = BCD Either one
CD
11 (5,7)
1 =1 A’BD
1 will do

10 1

F = A’C’ + A’B’D’ + ACD + [BCD or A’BD]

 K-Map for five variables

A=0 A=1

BC BC

00 01 11 10 00 01 11 10

00 0 4 12 8 00 16 20 28 24

01 1 5 13 9 01 17 21 29 25
DE DE
11 3 7 15 11 11 19 23 31 27

10 2 6 14 10 10 18 22 30 26
 K-Map for five variables

• F(A,B,C,D,E) = ∑ m(0,7,8,9,12,13,15,18,20,22,24,25,28,29,31)
A=0 A=1

BC BC

00 01 11 10 00 01 11 10

00 1 1 1 00 1 1 1

01 1 1 01 1 1
DE DE
11 1 1 11 1

10 10 1 1

(0,8), (7,15), (20,28), (18,22), (28,24,12,8,29,13,25,9), (29,31,13,15)

F = A’C’D’E’ + ACD’E’ + BD’ + BCE + A’CDE + AB’DE’
 Issues with K-Maps

• Gets more complex with more number of variables

• Can not be automated
• More than one solution
• Solution: Tabular method (Quine-McCluskey)