Karnaugh map K-map

1. Gate Level
Minimization
Nugroho Adi P, S.Si, M.Sc
nugnux@gmail.com, aravir@me.com
http://aravir-rose.blogspot.com

2. untuk mendapatkan jumlah gerbang yang optimal

3. Map Method
lebih tersturktur dari metode aljabar

4. Karnaugh Map
K-map

5. Karnaugh Map

6. Karnaugh Map

7. Karnaugh Map
m1 +m2 +m3
=x’y+xy’+xy
=x+y

8. xy

9. x+y

10. K-map 3 variabel

11. K-map 3 variabel

12. m5+m7
m5 +m7
=xy’z+xyz
=xz(y’+y)
=xz

13. F(x,y,z) = (2,3,4,5)

14. F(x,y,z) = (2, 3, 4, 5)
F = x’y + xy’

15. m0 dan m2
m0 +m2
=x’y’z’+x’yz’
=x’z’(y’+y)
=x’z’

16. m4 dan m6
m4 + m6
= xy’z’ + xyz’
= xz’+(y’ + y)
=xz’

17. F (x, y, z) = (3, 4, 6, 7)

18. F(x,y,z) = ( 3, 4, 6, 7)
F = yz + xz’

19. m0 +m2 +m4 +m6
F(x,y,z) = Σ(0,2,4,5,6)
F = A’C + A’B + AB’C + BC
!
!

20. K-map 4 variabel

21. K-map 4 variabel

22. F(w,x,y,z) = Σ(0,1,2,4,5,6,8,9,12,13,14)

23. F(w,x,y,z) = Σ(0,1,2,4,5,6,8,9,12,13,14)
F = y’ + w’z’ + xz’

24. F = A’B’C’ + B’CD’ + A’BCD’ + AB’C’

25. F = A’B’C’ + B’CD’ + A’BCD’ + AB’C’
F = B’D’ + B’C’ + A’CD’