dce

2012

Khoa KH & KTMT

B mn K Thut My Tnh
BK
TP.HCM

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

BK
TP.HCM

i s Boole &
cc cng lun l
2012, CE Department

dce
2012

Ni dung
i s Boole
i s chuyn mch
Cc cng lun l

2012, CE Department

dce
2012

i s Boole
i s Boole c th gii bit n ln u tin bi
George Boole qua tc phm An Investigation of the
Laws of Thought vo nm 1854
Cc hng v bin Boole ch c mang 2 gi tr 0
hoc 1 ( LOW / HIGH )
Cc bin Boole biu din cho mt khong in p trn
ng dy hoc ti ng nhp/ng xut ca mch
Gi tr 0 hoc 1 c gi l mc lun l (logic level)
A

Mch
lun l

ng nhp
x

ng xut
y
2012, CE Department

dce
2012

i s Boole
i s Boole, cng tng t nh cc h i s khc,
c xy dng thng qua vic xc nh ngha mt
s nhng vn c bn sau:
Min (domain), l tp hp (set) cc phn t (element) m
trn nh ngha nn h i s
Tp hp cc php ton (operation) thc hin c trn
min
Mt tp hp cc nh (postulate), hay tin (axiom)
c cng nhn khng qua chng minh. nh phi
m bo tnh nht qun (consistency) v tnh c lp
(independence)
Mt tp hp cc h qu (consequence) c gi l nh l
(theorem), nh lut (law) hay quy tc (rule)
2012, CE Department

dce
2012

nh Huntington
Pht biu bi nh ton hc Anh E.V.Huntington trn
c s h thng ha cc cng trnh ca G. Boole
S dng cc php ton trong lun l mnh
(propositional logic)

Tnh ng (closure)
Tn ti min B vi t nht 2 phn t phn bit v 2 php
ton + v sao cho:
Nu x v y l cc phn t thuc B th x + y cng l
1 phn t thuc B (php cng lun l - logical addition)
Nu x v y l cc phn t thuc B th x y cng l
1 phn t thuc B (php nhn lun l - logical
multiplication)
2012, CE Department

dce
2012

nh Huntington
Tnh ng nht (identity)
Nu x l mt phn t trong min B th
Tn ti 1 phn t 0 trong B , gi l phn t ng nht vi
php ton + , tha mn tnh cht x + 0 = x
Tn ti 1 phn t 1 trong B , gi l phn t ng nht vi
php ton , tha mn tnh cht x 1 = x

Tnh giao hon (commutative)

Giao hon ca php + :
x + y = y + x
Giao hon ca php :
x y = y x

2012, CE Department

dce
2012

nh Huntington
Tnh phn phi (distributive)
Php c tnh phn phi trn php
x (y + z) = (x y) +
Php + c tnh phn phi trn php
x + (y z) = (x + y)

+
(x z)

(x + z)

B (complementation)
Nu x l 1 phn t trong min B th s tn ti mt phn t
khc gi l x (hay x ), l phn t b ca x tha mn:
x + x = 1
v
x x = 0

2012, CE Department

dce
2012

Tnh i ngu (duality)

Quan st cc nh Hungtinton, ta thy chng
mang tnh i xng (symmetry) tc l cc nh
xut hin theo cp
Mi nh trong 1 cp c th c xy dng t
nh cn li bng cch
Thay i cc php ton 2 ngi
Thay i cc phn t ng nht

(+ | )
(0 | 1)

C th suy ra mt kt qu no t cc nh
bng cch
Hon i php ton + vi php ton
Hon i phn t ng nht 0 vi phn t ng nht 1

iu ny th hin tnh i ngu i s Boole

2012, CE Department

10

dce
2012

Cc nh l c bn (fundamental theorem)
Cc nh l c chng minh t cc nh
Huntington v cc nh i ngu theo 2 cch
Chng minh bng phn chng (contradiction)
Chng minh bng quy np (induction)
nh l 1

(Null Law)

x + 1 = 1

nh l 2

x 0 = 0

x x = x

x (x + y) = x

(Involution)

(x ) = x
nh l 3

x + x = x

nh l 4

(Idempotency)
(Absorption)

x + xy = x

2012, CE Department

11

dce
2012

Cc nh l c bn
nh l 5
(Simplification)
x + x y = x + y
x (x + y ) = x y
nh l 6
(Associative Law)
x + (y + z) = (x + y ) + z = x + y + z
x (y z) = (x y) z = x y z
nh l 7
(Consensus)
x y + x z + y z = x y + x z
(x + y) (x + z) (y + z) = (x + y) (x + z)
nh l 8
(De Morgans Law)
(x + y) = x y
(x y) = x + y
2012, CE Department

12

dce
2012

Bng s tht (Truth table)

Phng tin m t s ph thuc ca ng xut vo mc lun
l (logic level) ti cc ng nhp ca mch
Lit k tt c cc t hp c th ca mc lun l ti cc ng
nhp v kt qu mc lun l tng ng ti ng xut ca mch
S t hp ca bng N-ng nhp: 2N

A
B

2012, CE Department

13

dce
2012

i s chuyn mch (switching algebra)

i vi i s Boole, min khng b hn ch (khng c gii
hn t ra i vi s lng cc phn t trong min)
Cc nh Huntington gii hn xem xt i s Boole vi 2
phn t ng nht m thi

i s Boole 2 phn t
Nm 1937, Claude Shannon hin thc i s Boole 2 phn
t bng mch in vi cc chuyn mch (switch)
Chuyn mch l thit b c 2 v tr bn: tt (off) hay m (on)
2 v tr ny ph hp biu din cho 0 hay 1

i s Boole 2 phn t cn c gi l i s chuyn mch

Cc phn t ng nht c gi l cc hng chuyn mch
(switching constant)
Cc bin (variable) biu din cc hng chuyn mch c gi
l cc bin chuyn mch (switching variable)  tn hiu
2012, CE Department

14

dce
2012

Cc php ton chuyn mch

i s chuyn mch s
dng cc php ton trong
lun l mnh vi tn
gi khc
Php ton AND
Php ton 2 ngi tng
ng vi php nhn
lun l

Php ton OR
Php ton 2 ngi tng
ng vi php cng
lun l

xy

x+y

Bng s tht cc php

chuyn mch

Php ton NOT

Php ton 1 ngi
tng ng vi
php b lun l

2012, CE Department

15

dce
2012

Cc php ton chuyn mch

Cc php ton chuyn mch c th c hin thc bi
mch phn cng
Bng s tht c th s dng nh 1 cng c dng xc
minh quan h gia cc php ton chuyn mch
S dng bng s tht chng minh nh l De Morgan
(x + y) = x y
x

x +y

(x + y)

x y

0
2012, CE Department

16

dce
2012

Biu thc (expression) chuyn mch

Biu thc chuyn mch l mt quan h hu hn cc
hng, bin, biu thc chuyn mch lin kt vi nhau
bi cc php ton AND, OR v NOT
V d
y +1 ,
x x + x ,
z ( x + y )
E = ( x + y z ) ( x + y ) + ( x + y )
literal c s dng m ch bin hay b ca bin

2012, CE Department

17

dce
2012

Biu thc (expression) chuyn mch...

Mt biu thc c th c chuyn thnh nhiu dng
tng ng bng cch s dng cc lut Boole
E = (x + y z) (x + y) + (x + y)
E1 = x x + x y + x y z + y y z + x y
E2 = x + x (y + y z) + x y

E3 =x + x y
E4 =x + y

Ti sao phi chuyn i dng ca cc biu thc ?

Cc thnh phn tha (redundant) trong biu thc
literal lp ( x x hay x + x)
bin v b ( x x hay x + x)
hng (0 hay 1)

Khng hin thc cc thnh phn tha ca biu

thc vo mch
2012, CE Department

18

dce
2012

Hm (function) chuyn mch

Hm chuyn mch (switching function) l mt php gn xc
nh v duy nht ca nhng gi tr 0 v 1 cho tt c cc t
hp gi tr ca cc bin thnh phn
Hm c xc nh bi danh sch cc tr hm ti mi t hp
gi tr ca bin (bng s tht)
Tn ti nhiu biu thc biu din cho 1 hm

S lng hm chuyn mch vi n bin l 2 lu tha 2n

x

x y

E1 = x + x y

E2 = x + y

1
2012, CE Department

19

dce
2012

Cc php ton chuyn mch khc

Php ton Exclusive OR

Php ton NAND

E = x y = x y + x y

Php ton 2 ngi tng

ng vi (NOT AND)

Php ton NOR

Php ton XNOR (Ex. NOR)

E = ( x y ) = x y + x y

Php ton 2 ngi tng

ng vi (NOT OR)
Bin

NAND

NOR

Ex. OR

XNOR

(x . y)

(x + y)

xy

(x y)

1
2012, CE Department

20

dce
2012

Cng lun l
i s chuyn mch c th thc hin cc cng
vic trong i tht, cn phi c
Thit b vt l thc hin cc php ton chuyn mch
Tn hiu vt l (in p, ) thay th cho cc bin chuyn
mch

Cng (gate) hay cng lun l (logic gate) l tn

chung dng gi cc thit b vt l thc hin cc
php ton chuyn mch vi chnh xc (accuracy)
v thi gian tr (delay) chp nhn c

2012, CE Department

21

dce
2012

Cng lun l
Mi cng c biu din bi 1 biu tng
(schematic symbol) c trng cng vi 1 s chn
(pin, terminal) tng trng cho cc bin chuyn
mch
Mt biu thc chuyn mch bt k lun c th c
hin thc trong i tht bng cch kt ni cc cng
lun l li vi nhau

Mch lun l (logic circuit) hay mch chuyn mch

(switching circuit)

2012, CE Department

22

dce
2012

Biu tng ca cc cng lun l

Cng AND

x
y

x.y

Cng NOR

Cng OR
x
y

(x + y)

x
y

xy

x+y

Cng XOR

Cng NOT
(cng o - inverter)
x

x
y

Cng XNOR

x
y

(x y)

Cng NAND
x
y

(x . y)

Cc cng nhiu
hn 2 ng nhp
2012, CE Department

23

dce
2012

Dng tng ng

2012, CE Department

24

dce
2012

Din dch biu tng cng lun l

Dng tng ng ca cng AND

Ng xut mc cao khi tt c cc ng nhp mc cao

Ng xut mc thp khi mt trong cc ng nhp mc
thp

Mt s cu trc ca cng XOR

E =

x y = x y + x y = ( x y + x y )

2012, CE Department

25

dce
2012

Tch cc cao Tch cc thp

Hai trng thi hot ng ca thit b l tch cc
(activity) v khng tch cc (inactivity)
Xt cc th d i vi in thoi, n, ng c, v.v

Do thi quen, qui c tch cc ng vi lun l 1

cn khng tch cc ng vi lun l 0
Tch cc cao (active high)
tch cc lun l 1 mc in p cao H

Tch cc thp (active low)

tch cc lun l 0 mc in p thp L

2012, CE Department

26

dce
2012

Mch tch hp
Cng NOT

7404

Cng OR

7432

Cng AND

7408

Cng NOR

7402

Cng NAND

7400

Cng Ex-OR

7486

2012, CE Department

27

dce
2012

Tp ph bin ca cc php ton

Mt tp cc php ton c gi l ph bin (universal) nu
mi hm chuyn mch u c th c biu din mt cch
tng minh ch bi cc php ton ca tp trn
i vi cc php ton chuyn mch xt, ta c mt s cc
tp ph bin sau
Tp
Tp
Tp
Tp
Tp
Tp

{ NOT , AND , OR }
{ NOT , AND }
{ NOT , OR }
{ NAND }
{ NOR }
...

Bt k hm chuyn mch no cng u c th c biu din mt

cch tng minh ch bi cc php ton NOT v AND
...
2012, CE Department

28

dce
2012

Tnh ph bin ca cng NAND

2012, CE Department

29

dce
2012

Tnh ph bin ca cng NOR

2012, CE Department

30

dce
2012

Xc nh gi tr ng xut mch lun l

S dng biu thc Boole cho ng xut ca mch lun l
Vi A = 0, B = 1, C = 1, D = 1
x = A B C ( A + D )
= 0. 1 . 1 . (0 + 1)
= 1 . 1 . 1 . 1 = 1 . 1 . 1 . 0 = 0

S dng trc tip s mch lun l m khng cn s

dng biu thc Boolean

2012, CE Department

31

dce
2012

Gin xung theo thi gian (Timing Waveform)

2012, CE Department

32

dce
2012

c thm
Chng 3: Logic Gates and Boolean Algebra trong
sch Digital system ca Ronal Tocci

2012, CE Department

33

dce
2012

Bi tp
Tt c bi tp trong sch Digital System
ca Ronal Tocci
Chng 3: Logic Gates and Boolean Algebra

Thy

Nguyn Quang Huy

Email

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

34