digital design lecture 4: k-map

28
CKV Lecture 4: K-Map [For simplification of Boolean expressions] 8/29/2020 1 Digital Design

Upload: others

Post on 20-Jul-2022

3 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Digital Design Lecture 4: K-Map

CKV

Lecture 4: K-Map [For simplification of Boolean expressions]

8/29/2020 1

Digital Design

Page 2: Digital Design Lecture 4: K-Map

8/29/2020 2

CKV

Boolean FunctionsEach input entry will be represented by a term

x y

0 0

0 1

1 0

1 1

Minterms

Designation

Standard Product

F3

1

0

1

1

(Canonical form-Type1)Sum of Products

Page 3: Digital Design Lecture 4: K-Map

8/29/2020 3

Boolean Functions

Page 4: Digital Design Lecture 4: K-Map

8/29/2020 4

CKV

Boolean FunctionsEach input entry will be represented by a term

x y

0 0

0 1

1 0

1 1

Maxterms

Designation

Standard Sums

F3

0

1

0

0

(Canonical form-Type2)Product of Sums

Page 5: Digital Design Lecture 4: K-Map

8/29/2020 5

Boolean Functions

Page 6: Digital Design Lecture 4: K-Map

8/29/2020 6

CKV

Why to use K-Maps?

Canonical Expression can be simplified by algebraic means

Algebraic method lacks specific rules

K-map method simple, straight forward and pictorial understanding and gives both SOP and POS forms

Page 7: Digital Design Lecture 4: K-Map

8/29/2020 7

CKV

2-Variable K-Map

Truth-table to K-map

minterm 0 ➔

minterm 1 ➔

minterm 2 ➔

minterm 3 ➔

XY

0

1

0 1

1 0

1 1

Page 8: Digital Design Lecture 4: K-Map

8/29/2020 8

CKV

2-Variable K-Map

XY

0

1

0 1

1 0

1 1

Representation of cells

Page 9: Digital Design Lecture 4: K-Map

8/29/2020 9

CKV

2-Variable K-Map

XY

0

1

0 1

One bit variation between adjacent cells

What is the importance of 1-bit variation ??

Page 10: Digital Design Lecture 4: K-Map

8/29/2020 10

CKV

2-Variable K-Map

XY

0

1

0 1

1 1

0 0

X’Y’

X’Y+

X’Y’ + X’Y = X’(Y’ + Y) = X’

Simplification

If there are 1’s in adjacent cells then they can be grouped andMinimized functions can be obtained

Page 11: Digital Design Lecture 4: K-Map

8/29/2020 11

CKV

2-Variable K-Map

XY

0

1

0 1

1 1

0 0

Simplification

X = 0 constant Y varies from 0 → 1

X’

Page 12: Digital Design Lecture 4: K-Map

8/29/2020 12

CKV

2-Variable K-Map

XY

0

1

0 1

0 0

1 1

Simplification

X = 1 constant Y varies from 0 → 1

X

Page 13: Digital Design Lecture 4: K-Map

8/29/2020 13

CKV

2-Variable K-Map

XY

0

1

0 1

1 1

1 1

Simplification

X’

X

X’ + X = 1

Page 14: Digital Design Lecture 4: K-Map

8/29/2020 14

CKV

2-Variable K-Map

XY

0

1

0 1

1 1

1 1

Simplification

Adjacent cells can be grouped

1

2- cells at a time

4- cells at a time

Page 15: Digital Design Lecture 4: K-Map

8/29/2020 15

CKV

2-Variable K-Map

XY

0

1

0 1

1 0

1 1

Simplification

X

Y’

F = X + Y’

**A term can be grouped multiple times if it helps in simplifying theexpression

Page 16: Digital Design Lecture 4: K-Map

8/29/2020 16

CKV

3-Variable K-Map

X

Y Z

Should the next entry be (0, 1, 0) ?

(0,0,1) → (0,1,0)

0

1

**Two bit variation here, what to do ??

00 01 11 10

Page 17: Digital Design Lecture 4: K-Map

8/29/2020 17

CKV

3-Variable K-Map

X

Y ZAdjacent Cells

0

1

00 01 11 10

Any more adjacent cells ??

Page 18: Digital Design Lecture 4: K-Map

8/29/2020 18

CKV

3-Variable K-Map

X

Y Z

0

1

00 01 11 10

0 0 1 0

1110

2- cells or 4-cells or 8-cells at a time

YZ XYXZX=1, Z=1 constant , Y varies

Y=1, Z=1 constant , X varies

X=1, Y=1 constant , Z varies

F = XY + YZ + XZ

Page 19: Digital Design Lecture 4: K-Map

8/29/2020 19

CKV

3-Variable K-Map

X

Y Z

0

1

00 01 11 10

1 0 0 1

1011

2- cells or 4-cells or 8-cells at a time F (X,Y,Z) = ∑ (0,2,4,5,6)

XY’

Page 20: Digital Design Lecture 4: K-Map

8/29/2020 20

CKV

3-Variable K-Map

X

Y Z

0

1

00 01 11 10

1 0 0 1

1011

2- cells or 4-cells or 8-cells at a time F (X,Y,Z) = ∑ (0,2,4,5,6)

XY’ Z’

Z=0, constant , X , Y ChangeF = XY’ + Z’

Page 21: Digital Design Lecture 4: K-Map

8/29/2020 21

CKV

3-Variable K-Map

X

Y Z

0

1

00 01 11 10

0 0 1 1

0011

2- cells or 4-cells or 8-cells at a time F (X,Y,Z) = ∑ (2,3,4,5)

F = XY’ + X’Y

Page 22: Digital Design Lecture 4: K-Map

8/29/2020 22

CKV

3-Variable K-Map

X

Y Z

0

1

00 01 11 10

0 0 1 0

1101

2- cells or 4-cells or 8-cells at a time F (X,Y,Z) = ∑ (3,4,6,7)

Is the third grouping necessary ?

All ones should get covered atleast once

If all of them are covered then there is no need to group them again

Page 23: Digital Design Lecture 4: K-Map

8/29/2020 23

CKV

3-Variable K-Map

X

Y Z

0

1

00 01 11 10

0 0 1 0

1101

2- cells or 4-cells or 8-cells at a time F (X,Y,Z) = ∑ (3,4,6,7)

F = YZ + XZ’ F = YZ + XZ’ + XZ’

Both expressions will result in same truth table

But only first expression is minimized

Page 24: Digital Design Lecture 4: K-Map

8/29/2020 24

CKV

2-Variable K-Map

XY

0

1

0 1

1 0

1 1

Simplification

X

Y’

F = X + Y’

A term can be grouped multiple times if it helps in simplifiedexpression

Page 25: Digital Design Lecture 4: K-Map

8/29/2020 25

CKV

2-Variable K-Map

XY

0

1

0 1

1 0

1 1

Simplification

X

X’Y’

F = X + Y’

Which of the two is a minimized function ??

F = X + X’Y’

Page 26: Digital Design Lecture 4: K-Map

8/29/2020 26

CKV

3-Variable K-Map

X

Y Z

0

1

00 01 11 10

0 0 1 0

1101

2- cells or 4-cells or 8-cells at a time F (X,Y,Z) = 𝝅 (0,1,2,5)

F = (Y + Z’) (X + Z)

(Y+Z’) (X+Z)Y=0, Z=1 constant , X varies

X=0, Z=0 constant , Y varies

Page 27: Digital Design Lecture 4: K-Map

8/29/2020 27

CKV

3-Variable K-Map

X

Y Z

0

1

00 01 11 10

0 0 1 1

0011

2- cells or 4-cells or 8-cells at a time F (X,Y,Z) = π (2,3,4,5)

F = (X+Y)(X’+Y’)

Page 28: Digital Design Lecture 4: K-Map

8/29/2020 28

CKV

Next Class4/5-variable K-map

K-map with don’t care conditions