CHNG 1: IU KHIN LOGIC

1.1. KHI NIM QU TRNH IU KHIN iu khin l qu trnh ca mt h thng, trong di tc ng ca mt hay nhiu i lng vo thi i lng ra s thay i theo mt quy lut nht nh. 1.1.1. H thng iu khin H thng iu khin bao gm thit b iu khin v i tng iu khin, c th hin nh s hnh 1.1. Tn hiu nhiu z Dy chuyn sn xut xe1 xe2 xa i tng iu khin xe Tn hiu iu khin

Thit b iu khin

Hnh 1.1. S h thng iu khin

i tng iu khin: Thit b, my mc trong k thut. Thit b iu khin: Cc phn t truyn tn hiu, phn t x l v iu khin, c cu chp hnh, th hin nh s hnh 1.2. P/t truyn tn hiu Phn t x l v iu khin C cu chp hnh

Hnh 1.2. Cc phn t ca h thng iu khin

Trong : Phn t truyn tn hiu: nhn nhng gi tr ca i lng vy l v l i lng vo... V d: cng tc, nt bm, cng tc hnh trnh, cm bin, Phn t x l tn hiu v iu khin: x l tn hiu vo theo mt quy tc logic, lm thay i trng thi ca phn t iu khin, iu khin dng nng lng theo yu cu lm thay i trng thi ca c cu chp hnh. V d: van o chiu, van chn (van mt chiu, van logic OR, van logic AND), van tit lu, van p sut, rle, phn t khuch i, phn t chuyn i tn hiu, C cu chp hnh: thay i trng thi ca i tng iu khin, l i lng ra ca mch iu khin. V d: xilanh, ng c, b bin i p lc.v.v.

Tn hiu iu khin: i lng ra xa ca thit b iu khin v i lng vo xe ca i tng iu khin. Tn hiu nhiu z: i lng c tc ng t bn ngoi vo h thng v gy nh hng xu n h thng iu khin. 1.1.2. Cc loi tn hiu iu khin Thng tin (tn hiu vo xe v tn hiu ra xa) cho mch iu khin hot ng theo mt quy lut nh sn c th thc hin c nh tn hiu p sut, gi tr p sut c gi l thng s tn hiu. Tn hiu tng t (lin tc) v tn hiu rI rc c th hin qua hnh 1.3.
Tng t Ri rc Tn hiu s Tn hiu nh phn Tn hiu b ba

Hnh 1.3. Phn loi tn hiu

1.2. CC PHN T LOGIC Trong iu khin logic c hai trng thi, l trng thi 0 v trng thi 1. V d 1: Nu a = 0 th L = 0 L a Nu a = 1 th L = 1 Ta c th vit L = a Trong : a l nt n thng m; L l n tn hiu. V d 2: Nu b = 0 th L = 1 Nu b = 1 th L = 0 L b Ta c th vit L = b Trong : b l nt n thng ng; L = b l ph nh ca b

V d 3: Mt phn t v s mch iu khin logic kh nn th hin nh hnh 1.3.

1 0 R

A0

A0

1 S

P R A0

P R 1 B 0 A

P R 1 A 0 B Z S P R Y P a A

S P R b B X R

1.2

Khi 1.1 (0) 1.2 li v Khi 1.1 (1) 1.2 dui thng
S1 S2

1.1 1 0 P R
Hnh 1.4. S logic kh nn

1.2

S1

S2

1.1 A+ 1 0 S P R
Hnh 1.5. S logic in kh nn

A-

Khi 1.1 (0) (c tn hiu A-) 1.2 li v Khi 1.1 (1) (c tn hiu A+) 1.2 dui thng Cc phn t logic c bn c k hiu nh bng sau (tiu chun EU v USA):
S TT K hiu
1 Theo tc EU & Theo tc EU & Theo tc EU 1 Theo tc EU 1 Theo tc EU =1 Theo tc EU Theo tc USA Theo tc USA Theo tc USA Theo tc USA Theo tc USA Theo tc USA

Tn gi

NOT

AND

NAND

OR

NOR

XOR (EXC-OR)

1.2.1. Phn t logic NOT (Ph nh)

Ta c phng trnh logic L = a Phn t NOT c biu din: khi n nt a, rle c mt in bng n L tt; ngc li khi nh nt a, rle c c in bng n L sng.

a c

c a L L
K hiu
a 1

1 0 1 0

tn hiu vo tn hiu ra S tn hiu L a L

Bng chn l a L 0 1 1 0

Theo tc EU

Theo tc USA

1.2.2. Phn t AND (V) Phng trnh logic L = a.b Phn t AND (v) c bii din: khi n nt a ng thi n nt b, rle c c in bng n L sng. a b c 1 a tn hiu vo 0 L c 1 tn hiu vo b 0

L
Bng chn l a b 0 0 0 1 1 0 1 1

1 0

tn hiu ra S tn hiu a

K hiu

L 0 0 0 1

b & Theo tc EU

L b Theo tc USA

1.2.3. Phn t logic NAND (V - Khng)

Phng trnh logic L = a.b = a + b Phn t logic NAND c biu din: khi n nt a ng thi n nt b, rle c mt in bng n L tt.

a b c

c L

a b L

1 0 1 0 1 0

tn hiu vo tn hiu vo tn hiu ra S tn hiu

a 0 0 1 1

Bng chn l b L 0 1 1 1 0 1 1 0

K hiu
a b L a b L

&

Theo tc EU

Theo tc USA

1.2.4. Phn t logic OR (Hoc) Phng trnh logic L = a + b Phn t hoc c biu din: khi n nt a hoc b, rle c c in bng n L sng.

a b c

c L

a b L

1 0 1 0 1 0

tn hiu vo tn hiu vo tn hiu ra S tn hiu

a 0 0 1 1

Bng chn l b L 0 0 1 1 0 1 1 1

K hiu
a b 1 L a b L

Theo tc EU

Theo tc USA

1.2.5. Phn t logic NOR (Hoc - Khng) Phng trnh logic L = a + b = a.b

Phn t logic NOR c biu din: khi mt trong 2 nt n a hoc b c thc hin, th n L tt. n L sang khi khng c tn hiu no thc hin. a c b c a L b L
Bng chn l b L 0 1 1 0 0 0 1 0 K hiu
a b 1 L a b L

1 0 1 0 1 0

tn hiu vo tn hiu vo tn hiu ra S tn hiu

a 0 0 1 1

Theo tc EU

Theo tc USA

1.2.6. Phn t logic XOR (EXC - OR)

Phng trnh logic L = a.b + a.b Phn t logic XOR c biu din: khi n nt a hoc b, rle c1 hoc c2 c in n L sng; khi n c 2 nt ng thi n L tt. a c1 c2 c1 c 2 c2 c 1
Bng chn l b L 0 0 1 1 0 1 1 0

a b L
K hiu

1 0 1 0 1 0

tn hiu vo tn hiu vo tn hiu ra S tn hiu a L b Theo tc USA

a 0 0 1 1

a L b =1 Theo tc EU

1.2.7. Phn t logic OR/NOR

Phng trnh logic: L1 = a + b; L 2 = a + b = a.b

Phn t OR/NOR c hai tn hiu ra L1, L2 c biu din: khi cha n nt a hoc b, rle c cha c in bng n L1 tt, L2 sng; khi n nt a hoc b, rle c c in bng n L1 sng, L2 tt. 1 a a tn hiu vo c 0 b 1 L1 c tn hiu vo b 0 L2 1 c tn hiu ra L1 0
L2
Bng chn l b L1 0 0 1 1 0 1 1 1

1 0

tn hiu ra S tn hiu

K hiu

a 0 0 1 1

L2 1 0 0 0

L1 a b 1 L2 Theo tc EU

1.2.8. Phn t logic AND - NAND

Phng trnh logic: L1 = a.b; L 2 = a.b = a + b

Phn t logic AND - NAND c hai tn hiu ra L1, L2 v c biu din: khi cha tc ng nt n a v b L1 tt, L2 sng; khi n a ng thi n b, rle c c in S1 sng, L2 tt. 1 a tn hiu vo 0 c a b 1 tn hiu vo b L1 c 0 c L2 L1 L2
Bng chn l a b L1 0 0 0 0 1 0 1 0 0 1 1 1

1 0 1 0

tn hiu ra tn hiu ra S tn hiu L1 a L2 b & Theo tc EU

L2 1 1 1 0

K hiu

1.3. L THUYT I S BOOLE Trong k thut iu khin, gi tr ca cc tn hiu vo v tn hiu ra c vit di dng bin s ca i s Boole. 1.3.1. Cc quy tc c bn ca i s Boole (ta c th quy c thun tin vic tnh ton: trong l thuyt i s Boole phn t logic AND l "." hoc "" ; phn t logic OR l "+" hoc "" ) Php ton lin kt AND (v): L = a.b.c (hoc c th vit L = a b c ) 1.1.1 = 1 (1 1 1 = 1) 1.0.0 = 0 (1 0 0 = 0 ) 1.1.0 = 0 (1 1 0 = 0 ) C th: 1.0.1 = 0 (1 0 1 = 0 ) 0.1.1 = 0 (0 1 1 = 0) 0.0.0 = 0 (0 0 0 = 0) Php ton lin kt OR (hoc): L = a +b +c (hoc c th vit L = a b c ) 1 + 1 + 1 = 1 (1 1 1 = 1) 1 + 0 + 0 = 1 (1 0 0 = 1) 1 + 1 + 0 = 1 (1 1 0 = 1) C th: 0 + 1 + 1 = 1 (0 1 1 = 1) 1 + 0 + 1 = 1 (1 0 1 = 1) 0 + 0 + 0 = 0 (0 0 0 = 0) Php ton lin kt NOT (ph nh): S = a
C th: 0 =1 1= 0 a. Quy tc hon v: Cc ton t a v b c th hon v cho nhau L1 = a.b = b.a (S = a b = b a )
L 2 = a + b = b + a (S = a b = b a )

Ta c th biu din nh bng di: a.b = b.a S mch in S logic a b

a b b & L a b b a L

a+b=b+a S mch in a b b a S logic

a b 1 L a b L

Theo tc EU Theo tc USA

Theo tc EU Theo tc USA

&

b a 1

b a

Theo tc EU Theo tc USA

Theo tc EU Theo tc USA

b. Quy tc kt hp: L1 = a.b.c = (a.b ).c = a.(b.c ) { L = a b c = (a b ) c = a (b c ) }

L 2 = a + b + c = (a + b ) + c = a + (b + c ) { L = a b c = (a b ) c = a (b c ) } Ta c th biu din nh bng di:

(a.b).c = a.(b.c) S mch in S logic

a

(a + b) + c = a + (b + c) S mch in a
& L

S logic
a b c 1 1 L

b c

&

b c a b c

a b c & & L

a b c 1 1 L

c. Quy tc phn phi: Php ton lin kt AND, OR v NOT c kt hp vi nhau L1 = (a.b) + (c.d) = (a + c).(a + d).(b + c).(b + d) L2 = (a + b).(c + d) = (a.c) + (a.d) + (b.c) + (b.d) L3 = a.(b + c) = (a.b) + (a.c) L4 = a + (b.c) = (a + b).(a + c) Ta c th biu din s mch in v s logic nh sau (ch biu din S3, S4): L3 = a.(b + c) = (a.b) + (a.c) L3 = a.(b + c) S mch in a b
c

S logic
a b c 1 & L3

a 0 0 0 0 1 1 1 1

b 0 0 1 1 0 0 1 1

c 0 1 0 1 0 1 0 1

b.c 0 1 1 1 0 1 1 1

L3 0 0 0 0 0 1 1 1

10

L3 = (a.b) + (a.c)

S mch in
a a b c

S mch logic
b c & 1 & L3

a 0 0 0 0 1 1 1 1

b 0 0 1 1 0 0 1 1

c 0 1 0 1 0 1 0 1

a.b 0 0 0 0 0 0 1 1

a.c 0 0 0 0 0 1 0 1

L3 0 0 0 0 0 1 1 1

L4 = a + (b.c) = (a + b).(a + c) L4 = (a + b).(a + c) a b a c

a b c 1 & 1 L4

a 0 0 0 0 1 1 1 1

b 0 0 1 1 0 0 1 1

c a+b a+c 0 0 0 1 0 1 0 1 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1

L4 0 0 0 1 1 1 1 1

11

L4 = a + (b.c) a b c
a b c & 1 L4

a 0 0 0 0 1 1 1 1

b 0 0 1 1 0 0 1 1

c 0 1 0 1 0 1 0 1

b.c 0 0 0 1 0 0 0 1

L4 0 0 0 1 1 1 1 1

d. Quy tc nghch o (quy tc Morgan) Php ton lin kt AND c chuyn i thnh php ton lin kt OR bng php ton ph nh NOT v php ton lin kt OR c chuyn i thnh php ton lin kt AND bng php ton ph nh NOT:
a.b = a + b; a.b.c = a + b + c

a 0 0 1 1

b 0 1 0 1

a 1 1 0 0

b a.b 1 0 0 0 1 0 0 1

a b

a.b 1 1 & 1 0

a b

a+b 1 1 1 1 1 1 0

12

a + b = a.b; a + b + c = a.b.c a b a 1 1 0 0 b 1 0 1 0 a+b

a+b a 1 0 b 1 0 0

0 0 1 1

0 1 0 1

0 1 1 1

a b

1 1

a.b 1 0 & 0 0

e. Quy tc hp th a + (a.b) = a

a a b

a 0 0 1 1

b 0 1 0 1

a.b a+(a.b) 0 0 0 0 0 1 1 1

a.(a + b) = a

a b

a 0 0 1 1

b 0 1 0 1

a+b 0 1 1 1

a.(a+b) 0 0 1 1

f. Quy tc b

a + a.b = a + b

( )

a
a

a c b

a 0 0 1 1

b 0 1 0 1

a.b 0 1 1 1

a + a.b 0 0 1 1

a+b 0 1 1 1

13

a. a + b = a.b
a

a b a b

a 0 0 1 1

b 0 1 0 1

a+b

a. a + b

a.b 0 0 0 1

1 1 0 1

0 0 0 1

g. Quy tc n gin cc lin kt

0.a = 0 0 a 1

1.a = a a a

a.a = a a

a. a = 0

0+a = 0 0 a

1+a = 1 1 a

a+a = a a a

a + a =1 a

1.3.2. V d minh ho i s Boole V d 1: T phng trnh logic sau y

L = a.b.c.d + a.b.c.d

) (

Hy thit k s mch logic, sao cho s phn t logic t nht v s dng s phn t logic n gin vi s cng vo cng t cng tt. T phng trnh logic S, ta c th thit k c s mch logic nh sau:
a b c d

1 & 1 & L

Hnh1.6. S logic

S logic trn bao gm: 4 phn t NOT: a , b, c, d 2 phn t AND vi 4 cng vo 1 phn t OR vi 2 cng vo ta c 7 phn t Theo quy tc Morgan, ta bin i nh sau: a.b.c.d = a + b + c + d V a.b.c.d = a.b. c + d

)
14

Ta c: L = a + b + c + d + a.b. c + d
a b c d

) ( [ ])
1 1 1 1 Hnh1.7. S logic & L

S mch logic sau khi bin i gm 5 phn t: 1 phn t NOT 1 phn t NOR vi 4 cng vo 1 phn t OR vi 2 cng vo 1 phn t NOR vi 2 cng vo 1 phn t AND vi 3 cng vo Nh vy sau khi bin i th s phn t s t hn. V d 2: Hy n gin mch iu khin c phng trnh logic sau y: L = a.b + a.b
a b

( ) ( )

T phng trnh trn, ta c s logic v bng chn l sau: a 0 0 1 1 b 0 1 0 1 L 0 1 1 0

1 & 1 & L

Hnh1.8. S logic v bng chn l

Theo quy tc phn phi, ta bin i nh sau:

L = a.b + a.b = a + a .(a + b ). b + a . b + b

( ) ( ) (

)(

Theo quy tc n gin lin kt, ta c:

(a + a ) = 1 v (b + b) = 1
L = (a + b ). b + a

Nh vy phng trnh c vit li nh sau:

15

Theo quy tc Morgan:

(b + a ) = b.a

Phng trnh logic n gin: L = (a + b ). b.a

a b

( )
a 0 0 1 1 b 0 1 0 1 L 0 1 1 0

Ta c s mch logic n gin vi 3 phn t:

& & 1 L

Hnh1.9. S logic v bng chn l

1.4. BIU KARNAUGH n gin mch logic hay mch cng tc bng quy tc i s Boole th kh phc tp. Vo nm 1953 nh ton hc Karnaugh (ngi Anh) pht trin mt phng php gii bng biu din th, gi l biu Karnaugh. Nh phng php biu Karnaugh m ta c th s dng t quy tc n gin nhng phng trnh logic phc tp vi nhiu bin. Biu Karnaugh bao gm nhiu khi v biu din tt c kh nng dng php hi t ton phn. Dng php hi t ton phn l php ton lin kt AND, bao gm tt c cc bin v ph nh ca bin. 1.4.1. Biu Karnaugh vi 2 bin
b
1

b
2

00
a .b
3

01 a .b
4

10 a. b

11 a.b

a 0 0 1 1

b 0 1 0 1

L 0 1 0 1

Cc khi ca dng th nht (1 v 2) gm ph nh ca bin a, khi ca dng th 2 (3 v 4) bin a. Tng t khi ca ct th nht (1 v 3) bao gm ph nh ca bin b, khi ca ct th 2 (2 v 4) bao gm bin b. V d: C phng trnh logic vi 2 bin sau:
L = (a.b ) + a.b

( )

16

iu kin phng trnh trn c tn hiu 1 cng ra L l khi 2 v 4. Vi 2 bin ta c 22 = 4 dng php hi ton phn. Khi 2 v 4 c gch cho. Trong biu Karnaugh l 2 dng php hi ton phn c trong phng trnh nm k cn nhau (ct 2). Hai dng php hi ton phn k cn nhau c tnh cht l mt trong hai bin c gi tr thay i, th bin th 2 khng thay i. Nh trn, bin c gi tr thay i l b ta bin i phng trnh trn nh sau:
b. a + a = L a + a =1 b.1 = S b = L

Ta thy tho mn phng trnh logic trn, do ch cn tn hiu b. Trong biu Karnaugh c 2 dng php hi ton phn nm k cn nhau, th lc no ta cng c th n gin c. (Nm k cn nhau c ngha l trong cng mt dng hoc trong cng mt ct) 1.4.2. Biu Karnaugh vi 3 bin Vi 3 bin ta c 23 = 8 dng php hi ton phn nm trong 8 vng (c k hiu vng 1 n vng 8) v c biu din trn biu Karnaugh sau:
c
1

c
2

000 a .b.c
3

001
a . b .c
4

010
a .b. c
5

011
a .b.c
6

110 a.b. c
7

111 a.b.c
8

100 a. b . c

101 a. b .c

Dng th 1 gm: a , b, c, c Dng th 2 gm: a , b, c, c Dng th 3 gm: a , b, c, c Dng th 4 gm: a , b, c, c Ct th 1 gm: a v a , b v b, c

17

Ct th 2 gm: a v a , b v b, c
V d: ta c phng trnh logic vi 3 bin sau:
L = a.b.c + a.b.c + a.b.c + (a.b.c )

) (

) (

Theo biu Karnaugh, ta c phng trnh logic trn vi 4 khi c gch cho tng ng. Phng trnh logic trn gn c: 3 phn t NOT 4 phn t AND vi 3 cng ra 1 phn t OR vi 4 cng vo S mch logic v bng chn l ca phng trnh trn l:
a b c

1 & & 1 & & L

a 0 0 0 0 1 1 1 1

b 0 0 1 1 0 0 1 1

c 0 1 0 1 0 1 0 1

L 0 0 1 0 0 1 1 1

Hnh1.10. S mch logic v bng chn l

Ta s dng biu Karnaugh n gin s mch logic trn: Trong biu c 2 min ln cn, l: Min th 1 gm khi 3 a.b.c v 5 a.b.c Min th 2 gm khi 6 (a.b.c ) v 8 a.b.c Min th 1: khi 3 v 5 ta c: Hay vi

( ) ( ) L = (b.c )(a + a ) . (a + a ) = 1 L = b.c

L = a.b.c + a.b.c

Min th 2: khi 6 v 8 ta c:
L = (a.b.c ) + a.b.c

Hay

L = (a.c ). b + b

vi b + b = 1

L = a.c Vy phng trnh logic c n gin bng biu Karnaugh l:

18

L = b.c + (a.c ) V s logic lc ny s l:

a b c

( )

1 & 1 & L

a 0 0 0 0 1 1 1 1

b 0 0 1 1 0 0 1 1

c 0 1 0 1 0 1 0 1

L 0 0 1 0 0 1 1 1

Hnh 1.11. S logic v bng chn l

S ny ch cn li 4 phn t (n gin hn rt nhiu so vi s ban u).

1.4.3. Biu Karnaugh vi 4 bin Vi 4 bin ta c 24 = 16 dng php hi ton phn nm trong 16 khi. Thit lp biu Karnaugh vi 4 bin cng tng t nh biu 3 bin, tuy nhin s khi tng gp i. Biu Karnaugh c lp nh sau:

c
1

c
2

c
3

c
4

0000
5

0001
6

0011
7

0010
8

0100
9

0101
10

0111
11

0110
12

1100
13

1101
14

1111
15

1110
16

1000
d

1001
d

1011
d

1010
d

19

V d 1: n gin phng trnh logic sau bng biu Karnaugh:

L = a.b.c.d + a.b.c.d + a.b.c.d + a.b.c.d + a.b.c.d + (a.b.c.d ) + a.b.c.d

) (

) (

) (

) (

S mch logic ca phng trnh logic trn l:

a b c

d
1 1 & & & & & & & Hnh 1.12. S logic 1 L

7 phn t AND vi 4 cng vo 4 phn t NOT 1 phn t OR vi 7 cng vo 12 phn t By gi ta n gin mch logic trn bng biu Karnaugh. Theo phng trnh logic trn, ta nh du cc khi tng ng v chia ra thnh cc min (c 3 min c chia). Min th 1 gm: khi 5, 6, 7 v 8 Min th 2 gm: khi 6, 7, 10 v 11 Min th 3 gm: khi 11 v 15 Min th 1: khi 5, 6, 7 v 8

S ny gm:

(a.b.c.d )+ (a.b.c.d )+ (a.b.c.d )+ (a.b.c.d )

Ta chia min th nht thnh 2 min nh: A + B Trong : +/ Min nh A gm khi 5 v 6, ta c:

A = a.b.c.d + a.b.c.d = a.b.c . d + d m d + d = 1

) (

) (

)(

Vy sau khi n gin min nh A, ta c:

20

A = a.b.c

)
) ( ) ( )( )

+/ Min nh B gm khi 7 v 8, ta c:

B = a.b.c.d + a.b.c.d = a.b.c . d + d m d + d = 1

Vy sau khi n gin min nh B, ta c:

B = a.b.c

Nh vy min th 1 c vit li l: A + B = a.b.c + a.b.c Theo quy tc phn b, ta vit li nh sau:

) (

(a.b.c)+ (a.b.c) = (a.b)(c + c) m c + c = 1 . Min th 1 c vit n gin thnh: (a.b )

(a.b.c.d )+ (a.b.c.d ) + (a.b.c.d ) + (a.b.c.d ) ( ) ( )( )

Min 2: khi 6, 7, 10 v 11

Tng t ta cng chia min 2 thnh 2 min nh: C + D Trong : +/ Min nh C gm khi 6 v 7, ta c:

) ( C = (a.b.d )

C = a.b.c.d + a.b.c.d = a.b.d . c + c m c + c = 1

+/ Min nh D gm khi 10 v 11, ta c

D = a.b.c.d + (a.b.c.d ) = (a.b.d ). c + c D = (a.b.d ) Min th 2 c n gin thnh: (b.d) Min th 3: gm khi 11 v 15, ta c:

)
( ) ( )

Nh vy min th 2 c vit li l: C + D = a.b.d + (a.b.d ) = (b.d ). a + a

(a.b.c.d ) + (a.b.c.d ) = (a.c.d ).(b + b )

L = a.b + (b.d ) + (a.c.d )

Nh vy min 3 sau khi n gin l: (a.c.d) Vy phng trnh logic sau khi n gin bng biu Karnaugh c vit li l:

( )

Ta c s mch logic sau khi n gin bng biu Karnaugh l:

a b c d

1 & & & 1 L

21

S ny cn 5 phn t (nh biu Karnaugh gim c 7 phn t). V d 2: n gin phng trnh logic bng biu Karnaugh:
L = a.b.c.d + a.b.c.d + a.b.c.d + a.b.c.d + (a.b.c.d ) + a.b.c.d + a.b.c.d + a.b.c.d

) (
a

) (
b

) (

) (

) (

Ta c s mch logic nh sau:

c

d
1 1 & & & & & & & & Hnh 1.13. S logic 1 L

4 phn t NOT 8 phn t AND vi 4 cng vo 1 phn t OR vi 8 cng vo 13 phn t. Ta c biu Karnaugh ca phng trnh trn l: c c c c
1 2 3 4

S mch logic ny gm:

a a a a

0000
5

0001
6

0011
7

0010
8

0100
9

0101
10

0111
11

0110
12

1100
13

1101
14

1111
15

1110
16

b
b 13

16

1000
d

1001
d

1011
d

1010 d

22

(a.b.c.d ) + (a.b.c.d ) = (a.b.c)(d + d ) = (a.b.c) . Sau khi n gin min 1, ta c: (a.b.c )

Khi biu Karnaugh c cun li thnh dng hnh tr thng ng, th khi 13 v khi 16 s l nhng khi nm ln cn nhau. Theo biu ta c 4 min ln cn, l: Min th 1: khi 1 v 2 Min th 2: khi 6 v 7 Min th 3: khi 11 v 12 Min th 4: khi 13 v 16 Min th 1: khi 1 v 2, ta c:

(a.b.c.d ) + (a.b.c.d ) = (a.b.d )(c + c) = (a.b.d ) . Sau khi n gin min 2, ta c: (a.b.d )
Min th 3: khi 11 v 12

Min th 2: khi 6 v 7

(a.b.c.d ) + (a.b.c.d ) = (a.b.c ).(d + d ) = (a.b.c )

(a.b.c.d ) + (a.b.c.d ) = (a.b.d )(c + c) = (a.b.d ) . Sau khi n gin min 4, ta c: (a.b.d )
Vy phng trnh logic sau khi n gin bng biu Karnaugh l:
L = a.b.c + a.b.d + (a.b.c ) + a.b.d
a b c d

Sau khi n gin min 3, ta c: (a.b.c) Min th 4: khi 12 v 16

) (

S mch logic ca phng trnh sau khi n gin l:

1 & & 1 & & L

Hnh 1.14. S logic

Sau khi n gin cn li 9 phn t, ta c th tip tc n gin bng quy tc Morgan:

23

) ( ) ( ) (a.b.c) = (a + b + c) Ta c: (a.b.d ) = a.(b + d ) L = (a + b + c ) + (a.b.d ) + (a.b.c ) + [a.(b + d )]

L = a.b.c + a.b.d + (a.b.c ) + a.b.d S mch logic l:
a b c d

(y l kt qu cui cng)

1 1 & 1 & 1 & L

Hnh 1.15. S logic

1 phn t NOT 3 phn t AND 2 phn t NOR 1 phn t OR vi 4 cng vo. V d 3: trang 151 (iu khin kh nn ca Nguyn Ngc Phng) 1.5. PHN T NH Cc phn t c trnh by c c im l tn hiu ra trong mmen thi gian ph thuc vo tn hiu vo, iu c ngha l khi tn hiu vo mt, th tn hiu ra cng mt. Trong thc t tn hiu thng l dng xung, khi tn hiu tc ng vo l dng xung, tn hiu ra thng l tn hiu duy tr. Nh vy cn phi c phn t duy tr tn hiu. V d: trong k thut in, ta gi l t duy tr
24V b K K SOL a K 0V

S ny cn li 7 phn t:

Khi n nt b, dng in i qua rle K lm tip im K c ng li c dng in qua cun dy. Nh vy dng in trong mch vn duy tr, mc d nt n b nh ra.

24

Dng in duy tr cho n lc no n nt a. Thi gian t duy tr dng in trong mch, l kh nng nh ca mch in. Trong k thut iu khin gi l phn t nh Flipflop. Phn t Flipflop c 2 cng vo, cng th nht k hiu S (SET) v cng th 2 k hiu R (RESET), nh vy phn t Flipflop cng c th gi cch khc l phn t RSFlipflop.
1.5.1. Phn t RS - Flipflop a. Phn t RS - Flipflop c RESET tri hn: b K a K
a S 1 b R & L

Hnh 1.16. Phn t nh (mch in t duy tr v phn t RS Flipflop c RESET tri hn)

Nu cng SET (b) c gi tr 1, th tn hiu ra L c gi tr 1 v c nh (mc d ngay sau tn hiu cng SET mt i) cho n khi cng RESET (a) c gi tr 1, th phn t Flipflop s quay tr v v tr ban u. Khi cng SET v cng RESET c cng gi tr 1, th L c gi tr 0. Ta c bng gi tr ca phn t RS - Flipflop nh sau: a b L 1 0 1 0
tn hiu vo tn hiu vo

1 tn hiu ra 0 b. Phn t RS - Flipflop c SET tri hn:

b K a K

a 0 0 1 1

b L 0 Khng thay i 1 1 0 0 1 0

a R
b S

&

Hnh Phn t nh (mch in t duy tr v phn t RS Flipflop c SET tri hn)

Nu cng SET (b) c gi tr 1, th tn hiu ra L c gi tr 1 v c nh (mc d ngay sau tn hiu cng SET mt i) cho n khi cng RESET (a) c gi tr 1, th phn t Flipflop s quay tr v v tr ban u. Khi cng SET v cng RESET c cng gi tr 1, th L c gi tr 1.

25

Ta c bng gi tr ca phn t RS - Flipflop nh sau:

a b L

1 0 1 0 1 0

tn hiu vo tn hiu vo tn hiu ra

a 0 0 1 1

b L 0 Khng thay i 1 1 0 0 1 1

Phn t RS - Flipflop vi 2 phn t NOR c 2 cng ra Q v Q , c biu din nh sau:

S 1 R

Q
1 Q

Hnh1.17. Phn t RS Flipflop vi 2 cng ra Q v Q

26