i s Boole i s logic

Nguyn Quc Cng 3I

Ni dung
Gii thiu Cc tin trong i s logic Cc nh l Nguyn l ca tnh i ngu (duality) Cch biu din hm logic

Ti liu tham kho

Digital Design: Principles & Practices John F Wakerly Printice Hall

Gii thiu
1854 nh ton hc Anh, Gorge Boole (18151864) pht minh ra h thng i s ch c hai gi tr Nm 1938, ti Bell Lab, Claude E. Shannon ch ra cch p dng i s Boole vo phn tch v m t cc mch s dng rle (cn gi l switching algebra), v cng c p dng cho cc phn tch mch s hin nay.

Tin
Tin 1:
(A1) X = 0 if X 1 (A1) X = 1 if X 0

Tin 2: (nh ngha ton t o)

(A2): If X = 0 then X = 1 (A2): If X = 1 then X = 0 Ton t l ton t o hay b (mt s k hiu khc ca ton t o: ~ X , X ) Tuy nhin vic s dng thng c s dng trong cc ngn ng lp trnh HDLs)
5

Tin 3 , 4 v 5 :nh ngha cc ton V v HOC logic:

Ton t AND s dng k hiu Ton t OR s dng k hiu + Tt c cc h thng logic u c th m t v phn tch da trn 5 tin trn
6

K hiu cc phn t logic trn s

nh l cho mt bin

Vic chng minh cc nh l ny c th s dng phng php quy np hon ton (v s gi tr ca cc bin ch c 0 v1 nn rt d p dng phng php quy np)

cho 2 v ba bin

Ch : thun tin thng vit X Y thay cho ( X Y )

Cho n bin

chng minh s dng phng php quy np hu hn: chng minh ng vi n = 2 gi thit ng vi n = i, chng minh ng vi n = i+1

10

Nguyn l i ngu
Cc nh l hay ng nht thc trong i s logic s lun ng nu thay 0 v 1 tro i cho nhau v ng thi v + cng c tro i cho nhau. Hm i ngu:
Cho hm logic F(X1,X2,,Xn, + , , ) Hm i ngu ca F c nh ngha l hm c cng dng biu thc vi cc ton t v + c i ch cho nhau FD(X1,X2,,Xn, + , , ) = F(X1,X2,,Xn, , + , )
+ v i ch
11

Nguyn l i ngu v nh l DeMorgan

[F(X1,X2,,Xn)] = FD(X1, X2,,Xn) F(X1,X2,,Xn) = [FD(X1, X2,,Xn)] (nh l DeMorgan)

12

Biu din hm logic thng qua bng

Bng s thc (khng bao gm hng ROW), tuy nhin thng c s dng ch gi tr t hp ca cc bin

13

14

Mt s khi nim
H s ch (literal): l mt bin n , hoc phn b ca n. V d: X, Y, X,... S hng tch (product term): l mt literal hoc tch logic ca nhiu literal V d: Z, X Y, X Y Z Biu thc tng ca cc tch: l mt tng logic ca cc s hng tch S hng tng (sum term): l mt literal hoc tng logic ca nhiu literal V d: X, X+Y+Z Biu thc tch ca cc tng: l tch logic ca cc s hng tng
15

Mt s hng chun (normal term): l mt s hng tch hoc tng m trong khng c bin no xut hin hn mt ln V d cc s hng khng chu n: X + Y + X, Y X X Z V d cc s hng chun: X + Y, X Y Z minterm n bin: l mt s hng tch chun ca n literal maxterm n bin: l s hng tng chun ca n literal

16

17

Minterm: c th c nh ngha l s hng tch ng vi mt hng ca bng chn l sao cho tch bng 1 Maxterm: c th c nh ngha l s hng tng ng vi mt hng ca bng chn l sao cho tng bng 0

18

19

Biu din hm qua minterm v maxterm

Hm logic c th biu din di dng:
canonical sum: tng ca cc minterm ng vi cc hng ca bng chn l m ti gi tr hm bng 1 canonical product: tch ca cc maxterm ng vi cc hng ca bng chn l m ti gi tr hm bng 0

20

21

n gin trong k hiu, ngi ta thng s dng dng vit rt gn sau:

X, Y , Z l cc bin, i km vi ch s cc hng tng ng ca cc minterm hoc maxterm

22

Ti thiu ha hm logic
Hm logic c th biu din thng qua:
canonical sum canonical product

Tuy nhin l cc dng cha c ti thiu. gim s input hay s gate s dng trong mch cn phi ti thiu ha mch.

23

Ba Karnaugh
L cch biu din ha ca bng chn l

24

K-map : n bin s c 2n Mi mt trong K-map ng vi mt hng trong bng chn l. Quy c cc k nhau th t hp cc bin ch c khc nhau mt gi tr K-map ch thun tin s dng cho hm logic c 6 bin tr xung T K-map c th vit c cc canonical sum hoc canonical product tng t nh bng chn l
25

Ti thiu ha dng tng cc tch

26

 Quy tc nhm cc ca K-map:

Nhm 2k cc c gi tr 1 k nhau sao cho k l max ( 1 k n, vi n l s bin) C chnh xc (n-k) bin c gi tr khng i trong s cc c nhm

Dng tch:
nu bin c gi tr l 1 trong 2k c nhm th product term s cha bin nu bin c gi tr 0 trong 2k c nhm th product term s cha b ca bin nu bin c c gi tr 1 v 0 trong 2k c nhm th n s khng xut hin trong product term
27

cc nhm khng ng

28

v d

29

Dng ti gin s dng K-map khng phi l duy nht

30

Ti thiu ha dng tch cc tng

Nhm 2k cc c gi tr 0 k nhau sao cho k l max:
nu bin c gi tr l 1 trong 2k c nhm th sumterm s cha b ca bin nu bin c gi tr 0 trong 2k c nhm th sumterm s cha bin nu bin c c gi tr 1 v 0 trong 2k c nhm th n s khng xut hin trong sum term

31

Cc t hp u vo Dont-Care
Trong trng hp ng vi mt s t hp gi tr cc inputs gi tr hm logic c th ty (bng 0 hoc bng 1) cc t hp dont-care S dng cc t hp dont-care trong ti gin hm:
Cho php t hp dont-care tham gia vo cc sao cho s 2k l ln nht Khng nhm cc ch ton dont-care

32

33

Cc phng php ti gin s dng chng trnh

Khi s bin ln, s dng thut ton:
Queen-McCluskey (tham kho) Espresso II, Espresso-MV (tham kho)

34