Scribd
Upload
126 views29 pages

Simplification: The Karnaugh Map

The document discusses the Karnaugh map technique for simplifying Boolean functions. It begins by explaining why simplification is important to minimize gates. It then covers terminology like minterms and maxterms. The majority of the document explains how to use Karnaugh maps with 2, 3, and 4 variables through examples. Key steps include grouping adjacent 1's, identifying prime implicants and essential prime implicants, and simplifying using techniques like folding and don't cares. It concludes by discussing converting a sum of products to a product of sums form.

Uploaded by

Gyananshu Upadhyay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
126 views29 pages

Simplification: The Karnaugh Map

The document discusses the Karnaugh map technique for simplifying Boolean functions. It begins by explaining why simplification is important to minimize gates. It then covers terminology like minterms and maxterms. The majority of the document explains how to use Karnaugh maps with 2, 3, and 4 variables through examples. Key steps include grouping adjacent 1's, identifying prime implicants and essential prime implicants, and simplifying using techniques like folding and don't cares. It concludes by discussing converting a sum of products to a product of sums form.

Uploaded by

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

Simplification

The Karnaugh Map

Why Simplify?

Minimize no. of gates

How ??

DD-4

Boolean Algebra
Karnaugh Map (K-Map)
Quine & McCluskey (QM)

Terminologies

Minterms

Maxterms

Canonical Forms
SOP
POS

Two level -representation

DD-4

Karnaugh Map

DD-4

Click icon to add picture

Like Truth Table shows relationship between i/ps


and o/ps

Matrix of squares

Each square represents a minterm or maxterm

Arrangement of squares such that redundancies


are visible

DD-4

K- Map Format

K-Map
K-Map
A

AB

AB

AB

AB

0
1

AB

AB

AB

AB

m0
m2

m1

m3
DD-3

Two variables - AB

f(A,B) = AB + AB
How?

A
0
1

1
1

1
0

f(A,B) = B

0
0

Create matrix

Fill in the squares 1 based


on minterm in exp
AB
AB

Rest of squares fill with 0

Find adjacent squares with


adjacent 1

Looping

DD-3

K-MAP

3 variable K MAP
0
1

01

11

10

m0

m1

m3

m2

m4

m5

m7

m6

DD-3

BC 00

f(A,B,C) = ABC+ABC+ABC+ABC
0
1

0
0

01
0

1
1

11
1

1
1

10
3

0
0

f(A,B,C) = C
DD-3

BC 00

f(A,B,C) = ABC+ABC+ABC+ABC
BC 00

01

m0

m1

m3

m2

m4

m5

m7

m6

11

10

DD-3

f(A,B,C) = AB+BC
10

f(A,B,C) = (0,2,4,6)
BC 00

01

11

10

m0

m1

m3

m4

m5

m7

1
1

m2

m6

DD-3

f(A,B,C) = C
11

Folding
00 01 11 10

0
1

DD-4

01 11
00 10

12

f(A,B,C) = (0,2,4)
BC 00

01

11

10

m0

m1

m3

m4

m5

m7

m2

m6

DD-3

f(A,B,C) = AC +BC
13

f(A,B,C) = ABC+ABC+ABC+ABC+ABC
BC 00

A
0

m0

m4

01

11

10

m1

m3

m2

m5

m7

m6

AB
BC
AC
BC

f(A,B,C) = AB +BC+ BC

DD-3

Redundant Group PI & EPI


14

XOR
0
1

m0

m4

01

11
m1

m5

Odd Function

10
m3

m7

m2

m6

DD-3

BC 00

15

XNOR
0
1

01

m0

m4

11
m1

m5

Even Function

10
m3

m7

m2

m6

DD-3

BC 00

16

4 variable K MAP
00

01

11

10

m0

m1

m3

m2

m4

m5

m7

m6

11

m12

m13

m15

m14

10

m8

m9

m11

m10

01

DD-4

AB

CD 00

17

4 variable K MAP

00

11

m0

m1

m3

m2

m4

m5

m7

m6

11

m12

m13

m15

m14

10

m8

m9

m11

m10

01

01

C
10

B
D

DD-4

AB

CD 00

18

AB
00
01
11
10

CD 00
m0
m4
m12
m8

01
m1
m5
m13
m9

11
m3
m7
m15
m11

10
m2
m6
m14
m10

0000

1100

0001

1101

0011

1111

0010

1110

0110

1010

0111

1011

0101

1001

0100

1000

Grey

DD-4

4 variable K MAP-order

19

Decimal

Grey

Decimal

Grey

0000

1100

0001

1101

0011

10

1111

0010

11

1110

0110

12

1010

0111

13

1011

0101

14

1001

0100

15

1000

DD-4

Grey Code

20

Pairs

Quad

Octets

DD-4

Looping

21

f(A,B,C,D) = (0,1,4,5,9,11,13,15)

00

1m

01

1m

01
0

1
1

11

10

m1

m3

m2

m5

m7

m6

11

m12

1m

13

1m

15

m14

10

m8

m9

1m

11

m10

f(A,B,C,D) = AC +AD

PI
EPI
AC
AD
CD

DD-4

AB

CD 00

22

f(A,B,C,D) = AC +AD- Implementation


A
C

AC

A
D

AD

Level -1

Level -2

DD-4

AC +AD

23

f(A,B,C,D) = (0,2,5,7,8,10,13,15)

00
01
11
10

1m

01

m12

1m

m3

m1

m4

11

m5

1m

13

m9

m7

1m

15

m11

10

1m

m6

PI
BD
BD

m14

1m

10

DD-4

AB

CD 00

24

f(A,B,C,D) = (0,2,5,7,8,10,13,15)
f(A,B,C,D) = BD +BD
f(A,B,C,D) = B D

DD-4

B
D

25

f(A,B,C,D) = (0,2,4,6,8,10,12,14)

00

1m

01

1m

11

1m

10

1m

01
0

12

11

10

1m

m1

m3

m5

m7

m13

m15

1m

m9

m11

1m

f(A,B,C,D) = D

m6

PI
D

14

10

DD-4

AB

CD 00

26

SOP use 0s

Use Maxterms

Complement

Combine Maxterms

DeMorgans

POS
DD-4

POS - Canonical

27

f(A,B,C,D) = (2,6,7,8,12,13)
00

0m

01

0m

11

1m

10

1m

01
0

12

0
0

m1
m5

1m
0

11

10

0m

1m

m7

m6

13

0m

15

0m

m9

0m

11

0m

PI
AC
AC
BD

14

10

DD-4

AB

CD 00

28

F = AC + AC +BD

F = (AC)(AC)(BD)

F = (A+C).(A+C).(B+D)

DD-4

POS Form

29

You might also like