dce

2012

Khoa KH & KTMT

B mn K Thut My Tnh

2012, CE Department

dce
2012

Ti liu tham kho

Digital Systems, Principles and Applications,
8th/5th Edition, R.J. Tocci, Prentice Hall
Digital Logic Design Principles, N.
Balabanian & B. Carlson John Wiley &
Sons Inc., 2004

2012, CE Department

dce
2012

Cc mch lun l
t hp
2012, CE Department

dce
2012

Mc tiu
Biu thc logic dng chun SoP, PoS
n gin biu thc dng chun SoP
S dng i s Boolean v ba Karnaugh n
gin biu thc logic v thit k mch t hp
Mch to parity v mch kim tra parity
Mch enable/disable
Cc c tnh c bn ca IC s

2012, CE Department

dce
2012

Mch t hp
Mc logic ng xut ph thuc vic t hp cc mc
logic ca ng nhp hin ti.
Mch t hp khng c b nh nn gi tr ng xut
ph thuc vo gi tr ng nhp hin ti.
2

1
3

2
1
3

2
1

2012, CE Department

dce
2012

Cc dng chun (Standard form)

Tng ca cc tch (Sum of products - SoP)
Mi biu thc dng SoP bao gm cc biu thc AND
c OR li vi nhau.
V d: ABC + ABC
AB + ABC + CD + D

Tch ca cc tng (Product of Sums - PoS)

Mi biu thc dng PoS bao gm cc biu thc OR c
AND li vi nhau.
V d: (A + B + C)(A + C)
(A + B)(C + D)F

2012, CE Department

dce
2012

n gin mch t hp
Bin i cc biu thc logic thnh dng n gin
hn khi xy dng mch ta cn t cng logic v
cc kt ni hn.

2012, CE Department

dce
2012

Cc phng php n gin mch t hp

Phng php i s
Ba Karnaugh (K-map)

2012, CE Department

dce
2012

Phng php i s
S dng cc nh l trong i s Boole n gin
cc biu thc ca mch logic.
Chuyn sang dng SOP (DeMorgan v phn phi).
Rt gn bng cch tm cc nhn t chung.

2012, CE Department

dce
2012

V d
n gin biu thc sau
Z1 =

ABC + AB ( AC )

Z2 =

ABC + ABC + ABC

Z3 =

AC ( ABD) + ABC D + A BC

Z4 =

( A + B )( A + B + D) D

2010, CE Department

dce
2012

Thit k mch t hp

2012, CE Department

11

dce
2012

Thit k mch t hp
1. Lp bng s tht (truth table)
2. Vit biu thc AND cho cc ng xut mc 1
3. Vit biu thc SoP
4. n gin biu thc SoP
5. Hin thc mch t biu thc n gin

2012, CE Department

12

dce
2012

V d 1
Thit k mch logic vi 3 ng nhp A, B, C tho mn
iu kin sau: ng xut = 1 khi v ch khi s ng
nhp mc 1 nhiu hn s ng nhp mc 0

2012, CE Department

13

dce
2012

V d 1
Bng s tht

Biu thc ng xut (SOP): ABC + ABC + ABC + ABC

Rt gn: BC + AC + AB
2012, CE Department

14

dce
2012

V d 2
Thit k mch logic sau: Output = 1 khi in th
(c biu din bi 4 bit nh phn ABCD) ln hn
bng 6V.

2012, CE Department

15

dce
2012

Ba Karnaugh (K-map)
Ba Karnaugh biu din quan h gia ng nhp v
ng xut ca mch.
Theo chiu dc hoc chiu ngang, cc cnh nhau
ch khc nhau mt bin.

2012, CE Department

16

dce
2012

Ba Karnaugh (K-map)
Bng s tht
Biu thc logic
Ba Karnaugh

2012, CE Department

17

dce
2012

Ba Karnaugh (K-map)

2012, CE Department

18

dce
2012

Ba Karnaugh (K-map)

2012, CE Department

19

dce
2012

Ba Karnaugh (K-map)

2012, CE Department

20

dce
2012

Ba Karnaugh (K-map)

2012, CE Department

21

dce
2012

Ba Karnaugh (K-map)

2012, CE Department

22

dce
2012

Ba Karnaugh (K-map)

2012, CE Department

23

dce
2012

Quy tc rt gn ba Karnaugh
Khoanh vng (looping) l qu trnh kt hp cc k
nhau li vi nhau. Thng thng ta khoanh cc
cha gi tr 1.
Ng xut c th c n gin ha bng cch
khoanh vng.

2012, CE Department

24

dce
2012

Qui tc tnh gi tr ca 1 vng

Khi mt bin xut hin c dng o v khng o
trong mt vng, bin s c n gin khi biu
thc.
Cc bin chung cho mi trong mt vng phi xut
hin trong biu thc cui cng.

2012, CE Department

25

dce
2012

Khoanh vng 2 k nhau

2012, CE Department

26

dce
2012

Khoanh vng 2 k nhau

2012, CE Department

27

dce
2012

Khoanh vng 4 k nhau

2012, CE Department

28

dce
2012

Khoanh vng 4 k nhau

2012, CE Department

29

dce
2012

Khoanh vng 4 k nhau

2012, CE Department

30

dce
2012

Khoanh vng 8 k nhau

2012, CE Department

31

dce
2012

Khoanh vng 8 k nhau

2012, CE Department

32

dce
2012

Qu trnh n gin ha
Xy dng bng K-map v t 1 hoc 0 trong cc tng ng
vi bng s tht.
Khoanh vng cc gi tr 1 n l, khng tip gip vi cc
gi tr 1 khc (vng n).
Khoanh vng cc cp gi tr 1 khng tip gip vi cc gi tr
1 no khc na (vng kp).
Khoanh vng cc 8 gi tr 1 (nu c) ngay c nu n cha 1
hoc nhiu c khoanh vng.
Khoanh vng cc 4 gi tr 1 (nu c) cha mt hoc nhiu
cha c khoanh vng. Phi m bo s vng l t nht.
Khoanh vng cc cp gi tr 1 tng ng vi cc gi tr 1
cha c khoanh vng. Phi m bo s vng l t nht.
To cng OR cc s hng c to bi mi vng
2012, CE Department

33

dce
2012

V d

2012, CE Department

34

dce
2012

V d

2012, CE Department

35

dce
2012

V d

2012, CE Department

36

dce
2012

V d

X = ABC + AC D + ABC + ACD

2012, CE Department

37

dce
2012

Dont-care
iu kin dont-care l iu kin vi mt tp cc ng nhp
no , mc lun l ng xut khng c m t.
Gi tr Dont-care nn c gn bng mt hoc 0 sao cho
vic khoanh vng K-map to ra biu thc n gin nht.
V d:

2012, CE Department

38

dce
2012

PP bng Karnaugh - Tm tt
So snh vi phng php i s, phng php
dng K-map c tnh h thng hn, t bc hn v
lun to ra c biu thc ti gin nht.
Bng Karnaugh c th dng ti a l vi hm 6 bin.
i vi nhng mch c s ng nhp ln (>=6),
ngi ta dng thm cc k thut phc tp thit
k.

2012, CE Department

39

dce
2012

Exclusive-OR v Exclusive-NOR
EXclusive-OR (XOR)
Y = A B = AB + AB
EXclusive-NOR (XNOR)
Y = (A B) = (AB + AB)
Bin

Ex. OR

XNOR

AB

(A B)

1
2012, CE Department

40

dce
2012

V d
Thit k mch t hp vi 4 input x1, x0, y1, y0
z = 1 khi x1x0 = y1y0

0000, 0101, 1010, 1111

2012, CE Department

41

dce
2012

Mch to bit Parity

D3D2D1D0 = 1010
PE = 0
D3D2D1D0 = 1110
PE = 1

2012, CE Department

42

dce
2012

Mch kim tra bit Parity

2012, CE Department

43

dce
2012

Mch enable

2012, CE Department

44

dce
2012

Mch disable

2012, CE Department

45

dce
2012

V d
Thit k mch t hp cho php 1 tn hiu truyn n
ng xut khi mt trong 2 tn hiu iu khin mc 1
(khng ng thi). Cc trng hp khc ng xut
mc 1 (HIGH).

2012, CE Department

46

dce
2012

c thm
Chng 4: Combinational logic circuits trong sch
Digital System ca Ronal Tocci

2012, CE Department

47

dce
2012

Bi tp
Tt c bi tp trong sch Digital System
ca Ronal Tocci
Chng 4: Combinational Logic Circuits

Thy

Nguyn Quang Huy

Email

huynguyen@cse.hcmut.edu.vn
2012, CE Department

48