Folie a: Name

Tutorial 4: Karnaugh-Veitch Map

Fundamentals of Computer Engineering 1

Winter Semester 2008/2009 Tutorial 4: Karnaugh-Veitch Map

Dipl.-Ing. M.A. Lebedev Universitt Duisburg-Essen University of Duisburg-Essen Fakultt fr IngenieurwissenschaftenComputer Engineering I Tutorial Fundamentals of Faculty of Engineering Lecturer: Dipl. -Ing. M.A. Lebedev Computer Engineering Fachgebiet Technische Informatik 1 of 11
Prof. Dr.-Ing. Axel Hunger

Table of content

Tutorial 4: Karnaugh-Veitch Map

Tutorial 4: Karnaugh-Veitch Map Dra valid KV Maps Draw alid Truth Table KV Map Boolean Expression KV Map Read Simpified Function from KV Maps Handle Don`t States Read POS Convert SOP POS POS,

University of Duisburg-Essen Faculty of Engineering Computer Engineering Prof. Dr.-Ing. Axel Hunger

Tutorial Fundamentals of Computer Engineering I Lecturer: Dipl. -Ing. M.A. Lebedev 2 of 11

Karnaugh-Veitch Map

Tutorial 4: Karnaugh-Veitch Map

ABC 000 001 010 011 100 101 110 111

f1=(A,B,C) 0 1 0 1 1 0 0 0

A
AB C 0
110

AB C 0
111

A BC 1
011

A BC 0
010

AB C 1
100

AB C 0
101

1 AB C
001

0 AB C
000

University of Duisburg-Essen Faculty of Engineering Computer Engineering Prof. Dr.-Ing. Axel Hunger

Tutorial Fundamentals of Computer Engineering I Lecturer: Dipl. -Ing. M.A. Lebedev 3 of 11

Minimisation with KV Map (1) a

1

Tutorial 4: Karnaugh-Veitch Map

b
1

f f ==(a b c ) abc

+abc c ) ( ab

(abc ( b +abc c) +abc ) (ab

f1 = ac + b c
University of Duisburg-Essen Faculty of Engineering Computer Engineering Prof. Dr.-Ing. Axel Hunger Tutorial Fundamentals of Computer Engineering I Lecturer: Dipl. -Ing. M.A. Lebedev 4 of 11

Minimisation with KV Map (2)

B C A

Tutorial 4: Karnaugh-Veitch Map

2 3

BC
2 1 3

2 1 3

f1

AC

f1 = AC + BC
University of Duisburg-Essen Faculty of Engineering Computer Engineering Prof. Dr.-Ing. Axel Hunger Tutorial Fundamentals of Computer Engineering I Lecturer: Dipl. -Ing. M.A. Lebedev 5 of 11

Karnaugh-Veitch Map - Structure

Tutorial 4: Karnaugh-Veitch Map

10 AC BD 10 11

11

01

00

A B

D
01 00

University of Duisburg-Essen Faculty of Engineering Computer Engineering Prof. Dr.-Ing. Axel Hunger

Tutorial Fundamentals of Computer Engineering I Lecturer: Dipl. -Ing. M.A. Lebedev 6 of 11

KV Map & Dont Cares (1)

ABCD
0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101

Tutorial 4: Karnaugh-Veitch Map

f1=(A,B,C,D)
1 1 0 0 0 0 1 1 1 1 x x x x Read from KV Map 01 00 11 BD 10 AC

10

11

01

00

A
X X X X X 1 1 1 1

X 1 1

University of Duisburg-Essen 1110 x Faculty of Engineering 1111 x Computer Engineering Prof. Dr.-Ing. Axel Hunger

Don`t cares

f1 = A BC D + A BC D + ABC D + ABCD + A BC D + Lecturer: Dipl. -Ing. M.A. Lebedev A BC D 7 of 11

Tutorial Fundamentals of Computer Engineering I

KV Map & Dont Cares (2)

10 AC BD 10 11 11 01 00

Tutorial 4: Karnaugh-Veitch Map

A
X X X X X 1 1 1 1

Without Dont Cares: B

f = bc + abc
With Dont Cares:

D
01 00

X 1 1

f = bc + bc

=bc
= bc

(Equivalence)

University of Duisburg-Essen Faculty of Engineering Computer Engineering Prof. Dr.-Ing. Axel Hunger

Tutorial Fundamentals of Computer Engineering I Lecturer: Dipl. -Ing. M.A. Lebedev 8 of 11

KV Map & single type circuits (1) NAND only circuit (from SOP):

Tutorial 4: Karnaugh-Veitch Map

f1 = bc + bc
3

3 1

= bc + bc = bc bc

De Morgan`s Theorem

2 2 1 3 2 1 3 2 1 3 f1

= (b b ) (c c ) (b c )

All NAND Gates Combinational Circuit

University of Duisburg-Essen Faculty of Engineering Computer Engineering Prof. Dr.-Ing. Axel Hunger

Tutorial Fundamentals of Computer Engineering I Lecturer: Dipl. -Ing. M.A. Lebedev 9 of 11

KV Map & single type circuits (2)

Tutorial 4: Karnaugh-Veitch Map

NOR only circuit (from POS):

f1 = b + c b + c

A X X D 1 1 X 1 X 1 X 0 X 0 C

0 B 0
1 1

De Morgan`s Theorem

( )( ) = (b + c ) (b + c )
= b+c b+c

)(

)
)

= b+b+c b+c+c
B C

)(

3 1

2 1 3 2

University of Duisburg-Essen Faculty of Engineering Computer Engineering Prof. Dr.-Ing. Axel Hunger

Tutorial Fundamentals of Computer Engineering I1 3 2 Lecturer: Dipl. -Ing. M.A. Lebedev 1 3 10 of 11

Summary

Tutorial 4: Karnaugh-Veitch Map

Draw valid KV Maps Truth Table KV Map V p Boolean Expression KV Map Read Simpified Function from KV Maps Handle Don`t States Read POS, Convert SOP POS Next Lecture: Base Conversions

University of Duisburg-Essen Faculty of Engineering Computer Engineering Prof. Dr.-Ing. Axel Hunger

Tutorial Fundamentals of Computer Engineering I Lecturer: Dipl. -Ing. M.A. Lebedev 11 of 11