CSZ3I 8ooIeon AIqebro I

Circuit unuIysis summury

Affer findinq fhe circuif inpufs ond oufpufs, you con come up wifh
eifher on expression or o frufh fobIe fo describe whof fhe circuif does.
You con eosiIy converf befween expressions ond frufh fobIes.
Find fhe circuif's
inpufs ond oufpufs
Find o 8ooIeon
expression
for fhe circuif
Find o frufh fobIe
for fhe circuif
CSZ3I 8ooIeon AIqebro Z
44Ieun 45eruti4ns summury
We con inferpref hiqh or Iow voIfoqe os represenfinq frue or foIse.
A voriobIe whose voIue con be eifher I or 0 is coIIed o 8ooIeon voriobIe.
AMD, OP, ond MOT ore fhe bosic 8ooIeon operofions.
We con express 8ooIeon funcfions wifh eifher on expression or o frufh
fobIe.
Every 8ooIeon expression con be converfed fo o circuif.
Mexf fime, we'II Iook of how 8ooIeon oIqebro con heIp simpIify
expressions, which in furn wiII Ieod fo simpIer circuifs.
CSZ3I 8ooIeon AIqebro 3
5ressi4n sim5Iificuti4n
MormoI mofhemoficoI expressions con be simpIified usinq fhe Iows of
oIqebro
For binory sysfems, we con use 8ooIeon oIqebro, which is superficioIIy
simiIor fo requIor oIqebro
There ore mony differences, due fo
- hovinq onIy fwo voIues (0 ond I) fo work wifh
- hovinq o compIemenf operofion
- fhe OP operofion is nof fhe some os oddifion
CSZ3I 8ooIeon AIqebro 4
F4rmuI definiti4n 4f 44Ieun uIqebru
A 8ooIeon oIqebro requires
- A sef of eIemenfs , which needs of Ieosf fwo eIemenfs (0 ond I)
- Two binory (fwo-orqumenf) operofions OP ond AMD
- A unory (one-orqumenf) operofion MOT
- The oxioms beIow musf oIwoys be frue (fexfbook, p. 33)
The moqenfo oxioms deoI wifh fhe compIemenf operofion
8Iue oxioms (especioIIy Ib) ore differenf from requIor oIqebro
I. x + 0 ~ x Z. x O I ~ x
3. x + I ~ I 4. x O 0 ~ 0
b. x + x ~ x o. x O x ~ x
7. x + x' ~ I 8. x O x' ~ 0
9. (x')' ~ x
I0. x + y ~ y + x II. xy ~ yx Commufofive
IZ. x + (y + z) ~ (x + y) + z I3. x(yz) ~ (xy)z Associofive
I4. x(y + z) ~ xy + xz Ib. x + yz ~ (x + y)(x + z) Disfribufive
Io. (x + y)' ~ x'y' I7. (xy)' ~ x' + y' DeMorqon's
CSZ3I 8ooIeon AIqebro b
C4mments 4n the ui4ms
The ossociofive Iows show fhof fhere is no ombiquify obouf o ferm such
os x + y + z or xyz, so we con infroduce muIfipIe-inpuf primifive qofes:
The Ieff ond riqhf coIumns of oxioms ore duoIs
- exchonqe oII AMDs wifh OPs, ond 0s wifh Is
The duoI of ony equofion is oIwoys frue
I. x + 0 ~ x Z. x O I ~ x
3. x + I ~ I 4. x O 0 ~ 0
b. x + x ~ x o. x O x ~ x
7. x + x' ~ I 8. x O x' ~ 0
9. (x')' ~ x
I0. x + y ~ y + x II. xy ~ yx Commufofive
IZ. x + (y + z) ~ (x + y) + z I3. x(yz) ~ (xy)z Associofive
I4. x(y + z) ~ xy + xz Ib. x + yz ~ (x + y)(x + z) Disfribufive
Io. (x + y)' ~ x'y' I7. (xy)' ~ x' + y' DeMorqon's
CSZ3I 8ooIeon AIqebro o
Are these ui4ms f4r reuI?
We con show fhof fhese oxioms ore voIid, qiven fhe definifions of AMD,
OP ond MOT
The firsf II oxioms ore eosy fo see from fhese frufh fobIes oIone. For
exompIe, x + x' ~ I becouse of fhe middIe fwo Iines beIow (where y ~ x')
y y
0 0 0
0 I 0
I 0 0
I I I
y y
0 0 0
0 I I
I 0 I
I I I

0 I
I 0
y y
0 0 0
0 I I
I 0 I
I I I
CSZ3I 8ooIeon AIqebro 7
Pr4;inq the rest 4f the ui4ms
We con moke up frufh fobIes fo prove (bofh porfs of) DeMorqon's Iow
For (x + y)' ~ x'y', we con moke frufh fobIes for (x + y)' ond for x'y'
In eoch fobIe, fhe coIumns on fhe Ieff (x ond y) ore fhe inpufs. The
coIumns on fhe riqhf ore oufpufs.
In fhis cose, we onIy core obouf fhe coIumns in bIue. The ofher
"oufpufs" ore usf fo heIp us find fhe bIue coIumns.
Since bofh of fhe coIumns in bIue ore fhe some, fhis shows fhof (x + y)'
ond x'y' ore equivoIenf
x y x + y (x + y)' x y x' y' x'y'
0 0 0 I 0 0 I I I
0 I I 0 0 I I 0 0
I 0 I 0 I 0 0 I 0
I I I 0 I I 0 0 0
CSZ3I 8ooIeon AIqebro 8
Sim5Iificuti4n with ui4ms
We con now sforf doinq some simpIificofions
x'y' + xyz + x'y
~ x'(y' + y) + xyz [ Disfribufive: x'y' + x'y ~ x'(y' + y) ]
~ x'OI + xyz [ Axiom 7: y' + y ~ I ]
~ x' + xyz [ Axiom Z: x'OI ~ x' ]
~ (x' + x)(x' + yz) [ Disfribufive ]
~ I O (x' + yz) [ Axiom 7: x' + x ~ I ]
~ x' + yz [ Axiom Z ]
I. x + 0 ~ x Z. x O I ~ x
3. x + I ~ I 4. x O 0 ~ 0
b. x + x ~ x o. x O x ~ x
7. x + x' ~ I 8. x O x' ~ 0
9. (x')' ~ x
I0. x + y ~ y + x II. xy ~ yx Commufofive
IZ. x + (y + z) ~ (x + y) + z I3. x(yz) ~ (xy)z Associofive
I4. x(y + z) ~ xy + xz Ib. x + yz ~ (x + y)(x + z) Disfribufive
Io. (x + y)' ~ x'y' I7. (xy)' ~ x' + y' DeMorqon's
CSZ3I 8ooIeon AIqebro 9
Lets c4m5ure the resuItinq circuits
Here ore fwo
differenf buf
equivoIenf circuifs.
In qeneroI fhe one
wifh fewer qofes is
"beffer":
- If cosfs Iess fo
buiId
- If requires Iess
power
- 8uf we hod fo
do some work
fo find fhe
second form
CSZ3I 8ooIeon AIqebro I0
S4me m4re Iuws
Here ore some more usefuI Iows (p. 37). Mofice fhe duoIs oqoinl
We con prove fhese Iows by eifher
- Mokinq frufh fobIes:
- Usinq fhe oxioms:
I. x + xy ~ x 4. x(x + y) ~ x
Z. xy + xy' ~ x b. (x + y)(x + y') ~ x
3. x + x'y ~ x + y o. x(x' + y) ~ xy
xy + x'z + yz ~ xy + x'z (x + y)(x' + z)(y + z) ~ (x + y)(x' + z)
x y x' x'y x + x'y x y x + y
0 0 0 0 0
0 I 0 I I
I 0 I 0 I
I I I I I
x + x'y ~ (x + x')(x + y) [ Disfribufive ]
~ I O (x + y) [ x + x' ~ I ]
~ x + y [ Axiom Z ]
CSZ3I 8ooIeon AIqebro II
The c4m5Iement 4f u functi4n
The compIemenf of o funcfion oIwoys oufpufs 0 where fhe oriqinoI
funcfion oufpuffed I, ond I where fhe oriqinoI produced 0.
In o frufh fobIe, we con usf exchonqe 0s ond Is in fhe oufpuf coIumn(s)
f(x,y,z) ~ x(y'z' + yz)
x y z f(x,y,z)
0 0 0 I
0 0 I I
0 I 0 I
0 I I I
I 0 0 0
I 0 I 0
I I 0 I
I I I 0
x y z f'(x,y,z)
0 0 0 0
0 0 I 0
0 I 0 0
0 I I 0
I 0 0 I
I 0 I I
I I 0 0
I I I I
CSZ3I 8ooIeon AIqebro IZ
C4m5Iementinq u functi4n uIqebruicuIIy
You con use DeMorqon's Iow fo keep "pushinq" fhe compIemenfs inwords
You con oIso foke fhe duoI of fhe funcfion, ond fhen compIemenf eoch
IiferoI
- If f(x,y,z) ~ x(y'z' + yz).
- .fhe duoI of f is x + (y' + z')(y + z).
- .fhen compIemenfinq eoch IiferoI qives x' + (y + z)(y' + z').
- .so f'(x,y,z) ~ x' + (y + z)(y' + z')
f(x,y,z) ~ x(y'z' + yz)
f'(x,y,z) ~ ( x(y'z' + yz) )' [ compIemenf bofh sides ]
~ x' + (y'z' + yz)' [ becouse (xy)' ~ x' + y' ]
~ x' + (y'z')' (yz)' [ becouse (x + y)' ~ x' y' ]
~ x' + (y + z)(y' + z') [ becouse (xy)' ~ x' + y', fwice]
CSZ3I 8ooIeon AIqebro I3
Stundurd f4rms 4f e5ressi4ns
We con wrife expressions in mony woys, buf some woys ore more usefuI
fhon ofhers
A sum of producfs (SOP) expression confoins:
- OnIy OP (sum) operofions of fhe "oufermosf" IeveI
- Eoch ferm fhof is summed musf be o producf of IiferoIs
The odvonfoqe is fhof ony sum of producfs expression con be
impIemenfed usinq o fwo-IeveI circuif
- IiferoIs ond fheir compIemenfs of fhe "0fh" IeveI
- AMD qofes of fhe firsf IeveI
- o sinqIe OP qofe of fhe second IeveI
This dioqrom uses some shorfhonds.
- MOT qofes ore impIicif
- IiferoIs ore reused
- fhis is nof okoy in LoqicWorksl
f(x,y,z) ~ y' + x'yz' + xz
CSZ3I 8ooIeon AIqebro I4
Minterms
A minferm is o specioI producf of IiferoIs, in which eoch inpuf voriobIe
oppeors exocfIy once.
A funcfion wifh n voriobIes hos Z
n
minferms (since eoch voriobIe con
oppeor compIemenfed or nof)
A fhree-voriobIe funcfion, such os f(x,y,z), hos Z
3
~ 8 minferms:
Eoch minferm is frue for exocfIy one combinofion of inpufs:
x'y'z' x'y'z x'yz' x'yz
xy'z' xy'z xyz' xyz
Minferm Is frue when. Shorfhond
x'y'z' x~0, y~0, z~0 m
0
x'y'z x~0, y~0, z~I m
I
x'yz' x~0, y~I, z~0 m
Z
x'yz x~0, y~I, z~I m
3
xy'z' x~I, y~0, z~0 m
4
xy'z x~I, y~0, z~I m
b
xyz' x~I, y~I, z~0 m
o
xyz x~I, y~I, z~I m
7
CSZ3I 8ooIeon AIqebro Ib
Sum 4f minterms f4rm
Every funcfion con be wriffen os o sum of minferms, which is o specioI
kind of sum of producfs form
The sum of minferms form for ony funcfion is unique
If you hove o frufh fobIe for o funcfion, you con wrife o sum of
minferms expression usf by pickinq ouf fhe rows of fhe fobIe where
fhe funcfion oufpuf is I.
x y z f(x,y,z) f'(x,y,z)
0 0 0 I 0
0 0 I I 0
0 I 0 I 0
0 I I I 0
I 0 0 0 I
I 0 I 0 I
I I 0 I 0
I I I 0 I
f ~ x'y'z' + x'y'z + x'yz' + x'yz + xyz'
~ m
0
+ m
I
+ m
Z
+ m
3
+ m
o
~ %m(0,I,Z,3,o)
f' ~ xy'z' + xy'z + xyz
~ m
4
+ m
b
+ m
7
~ %m(4,b,7)
f' confoins oII fhe minferms nof in f
CSZ3I 8ooIeon AIqebro Io
The duuI ideu: 5r4ducts 4f sums
Jusf fo keep you on your foes...
A producf of sums (POS) expression confoins:
- OnIy AMD (producf) operofions of fhe "oufermosf" IeveI
- Eoch ferm musf be o sum of IiferoIs
Producf of sums expressions con be impIemenfed wifh fwo-IeveI circuifs
- IiferoIs ond fheir compIemenfs of fhe "0fh" IeveI
- OP qofes of fhe firsf IeveI
- o sinqIe AMD qofe of fhe second IeveI
Compore fhis wifh sums of producfs
f(x,y,z) ~ y' (x' + y + z') (x + z)
CSZ3I 8ooIeon AIqebro I7
Muterms
A moxferm is o sum of IiferoIs, in which eoch inpuf voriobIe oppeors
exocfIy once.
A funcfion wifh n voriobIes hos Z
n
moxferms
The moxferms for o fhree-voriobIe funcfion f(x,y,z):
Eoch moxferm is foIse for exocfIy one combinofion of inpufs:
x' + y' + z' x' + y' + z x' + y + z' x'+ y + z
x + y' + z' x + y' + z x + y + z' x + y + z
Moxferm Is foIse when. Shorfhond
x + y + z x~0, y~0, z~0 M
0
x + y + z' x~0, y~0, z~I M
I
x + y' + z x~0, y~I, z~0 M
Z
x + y' + z' x~0, y~I, z~I M
3
x' + y + z x~I, y~0, z~0 M
4
x' + y + z' x~I, y~0, z~I M
b
x' + y' + z x~I, y~I, z~0 M
o
x' + y' + z' x~I, y~I, z~I M
7
CSZ3I 8ooIeon AIqebro I8
Pr4duct 4f muterms f4rm
Every funcfion con be wriffen os o unique producf of moxferms
If you hove o frufh fobIe for o funcfion, you con wrife o producf of
moxferms expression by pickinq ouf fhe rows of fhe fobIe where fhe
funcfion oufpuf is 0. (8e corefuI if you're wrifinq fhe ocfuoI IiferoIsl)
x y z f(x,y,z) f'(x,y,z)
0 0 0 I 0
0 0 I I 0
0 I 0 I 0
0 I I I 0
I 0 0 0 I
I 0 I 0 I
I I 0 I 0
I I I 0 I
f ~ (x' + y + z)(x' + y + z')(x' + y' + z')
~ M
4
M
b
M
7
~ M(4,b,7)
f' ~ (x + y + z)(x + y + z')(x + y' + z)
(x + y' + z')(x' + y' + z)
~ M
0
M
I
M
Z
M
3
M
o
~ M(0,I,Z,3,o)
f' confoins oII fhe moxferms nof in f
CSZ3I 8ooIeon AIqebro I9
Minterms und muterms ure reIuted
Any minferm m
i
is fhe compIemenf of fhe correspondinq moxferm M
i
For exompIe, m
4
' ~ M
4
becouse (xy'z')' ~ x' + y + z
Moxferm Shorfhond
x + y + z M
0
x + y + z' M
I
x + y' + z M
Z
x + y' + z' M
3
x' + y + z M
4
x' + y + z' M
b
x' + y' + z M
o
x' + y' + z' M
7
Minferm Shorfhond
x'y'z' m
0
x'y'z m
I
x'yz' m
Z
x'yz m
3
xy'z' m
4
xy'z m
b
xyz' m
o
xyz m
7
CSZ3I 8ooIeon AIqebro Z0
C4n;ertinq between stundurd f4rms
We con converf o sum of minferms fo o producf of moxferms
In qeneroI, usf repIoce fhe minferms wifh moxferms, usinq moxferm
numbers fhof don'f oppeor in fhe sum of minferms:
The some fhinq works for converfinq from o producf of moxferms fo o
sum of minferms
From before f ~ %m(0,I,Z,3,o)
ond f' ~ %m(4,b,7)
~ m
4
+ m
b
+ m
7
compIemenfinq (f')' ~ (m
4
+ m
b
+ m
7
)'
so f ~ m
4
' m
b
' m
7
' [ DeMorqon's Iow ]
~ M
4
M
b
M
7
[ 8y fhe previous poqe ]
~ M(4,b,7)
f ~ %m(0,I,Z,3,o)
~ M(4,b,7)
CSZ3I 8ooIeon AIqebro ZI
Summury s4 fur
So for:
- A bunch of 8ooIeon oIqebro frickery for simpIifyinq expressions ond
circuifs
- The oIqebro quoronfees us fhof fhe simpIified circuif is equivoIenf
fo fhe oriqinoI one
- Infroducinq some sfondord forms ond ferminoIoqy
Mexf:
- An oIfernofive simpIificofion mefhod
- We'II sforf usinq oII fhis sfuff fo buiId ond onoIyze biqqer, more
usefuI, circuifs
CSZ3I 8ooIeon AIqebro ZZ
kurnuuqh mu5s
Losf fime we sow oppIicofions of 8ooIeon Ioqic fo circuif desiqn.
- The bosic 8ooIeon operofions ore AMD, OP ond MOT.
- These operofions con be combined fo form compIex expressions,
which con oIso be direcfIy fronsIofed info o hordwore circuif.
- 8ooIeon oIqebro heIps us simpIify expressions ond circuifs.
Todoy we'II Iook of o qrophicoI fechnique for simpIifyinq on expression
info o minimoI sum of producfs (MSP) form:
- There ore o minimoI number of producf ferms in fhe expression.
- Eoch ferm hos o minimoI number of IiferoIs.
Circuif-wise, fhis Ieods fo o minimoI fwo-IeveI impIemenfofion.
CSZ3I 8ooIeon AIqebro Z3
Re;iew: Stundurd f4rms 4f e5ressi4ns
We con wrife expressions in mony woys, buf some woys ore more usefuI
fhon ofhers
A sum of producfs (SOP) expression confoins:
- OnIy OP (sum) operofions of fhe "oufermosf" IeveI
- Eoch ferm fhof is summed musf be o producf of IiferoIs
The odvonfoqe is fhof ony sum of producfs expression con be
impIemenfed usinq o fwo-IeveI circuif
- IiferoIs ond fheir compIemenfs of fhe "0fh" IeveI
- AMD qofes of fhe firsf IeveI
- o sinqIe OP qofe of fhe second IeveI
This dioqrom uses some shorfhonds.
- MOT qofes ore impIicif
- IiferoIs ore reused
- fhis is nof okoy in LoqicWorksl
f(x,y,z) ~ y' + x'yz' + xz
CSZ3I 8ooIeon AIqebro Z4
Termin4I4qy: Minterms
A minferm is o specioI producf of IiferoIs, in which eoch inpuf voriobIe
oppeors exocfIy once.
A funcfion wifh n voriobIes hos Z
n
minferms (since eoch voriobIe con
oppeor compIemenfed or nof)
A fhree-voriobIe funcfion, such os f(x,y,z), hos Z
3
~ 8 minferms:
Eoch minferm is frue for exocfIy one combinofion of inpufs:
x'y'z' x'y'z x'yz' x'yz
xy'z' xy'z xyz' xyz
Minferm Is frue when. Shorfhond
x'y'z' x~0, y~0, z~0 m
0
x'y'z x~0, y~0, z~I m
I
x'yz' x~0, y~I, z~0 m
Z
x'yz x~0, y~I, z~I m
3
xy'z' x~I, y~0, z~0 m
4
xy'z x~I, y~0, z~I m
b
xyz' x~I, y~I, z~0 m
o
xyz x~I, y~I, z~I m
7
CSZ3I 8ooIeon AIqebro Zb
Termin4I4qy: Sum 4f minterms f4rm
Every funcfion con be wriffen os o sum of minferms, which is o specioI
kind of sum of producfs form
The sum of minferms form for ony funcfion is unique
If you hove o frufh fobIe for o funcfion, you con wrife o sum of
minferms expression usf by pickinq ouf fhe rows of fhe fobIe where
fhe funcfion oufpuf is I.
x y z f(x,y,z) f'(x,y,z)
0 0 0 I 0
0 0 I I 0
0 I 0 I 0
0 I I I 0
I 0 0 0 I
I 0 I 0 I
I I 0 I 0
I I I 0 I
f ~ x'y'z' + x'y'z + x'yz' + x'yz + xyz'
~ m
0
+ m
I
+ m
Z
+ m
3
+ m
o
~ %m(0,I,Z,3,o)
f' ~ xy'z' + xy'z + xyz
~ m
4
+ m
b
+ m
7
~ %m(4,b,7)
f' confoins oII fhe minferms nof in f
CSZ3I 8ooIeon AIqebro Zo
Re-urrunqinq the truth tubIe
A fwo-voriobIe funcfion hos four possibIe minferms. We con re-orronqe
fhese minferms info o Iornouqh mop.
Mow we con eosiIy see which minferms confoin common IiferoIs.
- Minferms on fhe Ieff ond riqhf sides confoin y' ond y respecfiveIy.
- Minferms in fhe fop ond boffom rows confoin x' ond x respecfiveIy.
x y minferm
0 0 x'y'
0 I x'y
I 0 xy'
I I xy
Y
0 I
0 x'y' x'y
X
I xy' xy
Y
0 I
0 x'y' x'y
X
I xy' xy
Y' Y
X' x'y' x'y
X xy' xy
CSZ3I 8ooIeon AIqebro Z7
kurnuuqh mu5 sim5Iificuti4ns
Imoqine o fwo-voriobIe sum of minferms:
x'y' + x'y
8ofh of fhese minferms oppeor in fhe fop row of o Iornouqh mop, which
meons fhof fhey bofh confoin fhe IiferoI x'.
Whof hoppens if you simpIify fhis expression usinq 8ooIeon oIqebro7
x'y' + x'y ~ x'(y' + y) [ Disfribufive ]
~ x' O I [ y + y' ~ I ]
~ x' [ x O I ~ x ]
Y
x'y' x'y
X xy' xy
CSZ3I 8ooIeon AIqebro Z8
M4re tw4-;uriubIe eum5Ies
Anofher exompIe expression is x'y + xy.
- 8ofh minferms oppeor in fhe riqhf side, where y is uncompIemenfed.
- Thus, we con reduce x'y + xy fo usf y.
How obouf x'y' + x'y + xy7
- We hove x'y' + x'y in fhe fop row, correspondinq fo x'.
- There's oIso x'y + xy in fhe riqhf side, correspondinq fo y.
- This whoIe expression con be reduced fo x' + y.
Y
x'y' x'y
X xy' xy
Y
x'y' x'y
X xy' xy
CSZ3I 8ooIeon AIqebro Z9
A three-;uriubIe kurnuuqh mu5
For o fhree-voriobIe expression wifh inpufs x, y, z, fhe orronqemenf of
minferms is more fricky:
Anofher woy fo IobeI fhe I-mop (use whichever you Iike):
Y
x'y'z' x'y'z x'yz x'yz'
X xy'z' xy'z xyz xyz'
Z
Y
m
0
m
I
m
3
m
Z
X m
4
m
b
m
7
m
o
Z
YZ
00 0I II I0
0 x'y'z' x'y'z x'yz x'yz'
X
I xy'z' xy'z xyz xyz'
YZ
00 0I II I0
0 m
0
m
I
m
3
m
Z
X
I m
4
m
b
m
7
m
o
CSZ3I 8ooIeon AIqebro 30
Why the funny 4rderinq?
Wifh fhis orderinq, ony qroup of Z, 4 or 8 odocenf squores on fhe mop
confoins common IiferoIs fhof con be focfored ouf.
"Adocency" incIudes wroppinq oround fhe Ieff ond riqhf sides:
We'II use fhis properfy of odocenf squores fo do our simpIificofions.
x'y'z + x'yz
~ x'z(y' + y)
~ x'z O I
~ x'z
x'y'z' + xy'z' + x'yz' + xyz'
~ z'(x'y' + xy' + x'y + xy)
~ z'(y'(x' + x) + y(x' + x))
~ z'(y'+y)
~ z'
Y
x'y'z' x'y'z x'yz x'yz'
X xy'z' xy'z xyz xyz'
Z
Y
x'y'z' x'y'z x'yz x'yz'
X xy'z' xy'z xyz xyz'
Z
CSZ3I 8ooIeon AIqebro 3I
um5Ie k-mu5 sim5Iificuti4n
Lef's consider simpIifyinq f(x,y,z) ~ xy + y'z + xz.
Firsf, you shouId converf fhe expression info o sum of minferms form, if
if's nof oIreody.
- The eosiesf woy fo do fhis is fo moke o frufh fobIe for fhe funcfion,
ond fhen reod off fhe minferms.
- You con eifher wrife ouf fhe IiferoIs or use fhe minferm shorfhond.
Here is fhe frufh fobIe ond sum of minferms for our exompIe:
x y z f(x,y,z)
0 0 0 0
0 0 I I
0 I 0 0
0 I I 0
I 0 0 0
I 0 I I
I I 0 I
I I I I
f(x,y,z) ~ x'y'z + xy'z + xyz' + xyz
~ m
I
+ m
b
+ m
o
+ m
7
CSZ3I 8ooIeon AIqebro 3Z
Unsim5Iifyinq e5ressi4ns
You con oIso converf fhe expression fo o sum of minferms wifh 8ooIeon
oIqebro.
- AppIy fhe disfribufive Iow in reverse fo odd in missinq voriobIes.
- Very few peopIe ocfuoIIy do fhis, buf if's occosionoIIy usefuI.
In bofh coses, we're ocfuoIIy "unsimpIifyinq" our exompIe expression.
- The resuIfinq expression is Iorqer fhon fhe oriqinoI onel
- 8uf hovinq oII fhe individuoI minferms mokes if eosy fo combine
fhem foqefher wifh fhe I-mop.
xy + y'z + xz ~ (xy O I) + (y'z O I) + (xz O I)
~ (xy O (z' + z)) + (y'z O (x' + x)) + (xz O (y' + y))
~ (xyz' + xyz) + (x'y'z + xy'z) + (xy'z + xyz)
~ xyz' + xyz + x'y'z + xy'z
CSZ3I 8ooIeon AIqebro 33
Mukinq the eum5Ie k-mu5
Mexf up is drowinq ond fiIIinq in fhe I-mop.
- Puf Is in fhe mop for eoch minferm, ond 0s in fhe ofher squores.
- You con use eifher fhe minferm producfs or fhe shorfhond fo show
you where fhe Is ond 0s beIonq.
In our exompIe, we con wrife f(x,y,z) in fwo equivoIenf woys.
In eifher cose, fhe resuIfinq I-mop is shown beIow.
Y
0 I 0 0
X 0 I I I
Z
Y
x'y'z' x'y'z x'yz x'yz'
X xy'z' xy'z xyz xyz'
Z
f(x,y,z) ~ x'y'z + xy'z + xyz' + xyz
Y
m
0
m
I
m
3
m
Z
X m
4
m
b
m
7
m
o
Z
f(x,y,z) ~ m
I
+ m
b
+ m
o
+ m
7
CSZ3I 8ooIeon AIqebro 34
k-mu5s fr4m truth tubIes
You con oIso fiII in fhe I-mop direcfIy from o frufh fobIe.
- The oufpuf in row i of fhe fobIe qoes info squore m
i
of fhe I-mop.
- Pemember fhof fhe riqhfmosf coIumns of fhe I-mop ore "swifched."
Y
m
0
m
I
m
3
m
Z
X m
4
m
b
m
7
m
o
Z
x y z f(x,y,z)
0 0 0 0
0 0 I I
0 I 0 0
0 I I 0
I 0 0 0
I 0 I I
I I 0 I
I I I I
Y
0 I 0 0
X 0 I I I
Z
CSZ3I 8ooIeon AIqebro 3b
Sr4u5inq the minterms t4qether
The mosf difficuIf sfep is qroupinq foqefher oII fhe Is in fhe I-mop.
- Moke recfonqIes oround qroups of one, fwo, four or eiqhf Is.
- AII of fhe Is in fhe mop shouId be incIuded in of Ieosf one recfonqIe.
- Do nof incIude ony of fhe 0s.
Eoch qroup corresponds fo one producf ferm. For fhe simpIesf resuIf:
- Moke os few recfonqIes os possibIe, fo minimize fhe number of
producfs in fhe finoI expression.
- Moke eoch recfonqIe os Iorqe os possibIe, fo minimize fhe number of
IiferoIs in eoch ferm.
- If's oII riqhf for recfonqIes fo overIop, if fhof mokes fhem Iorqer.
Y
0 I 0 0
X 0 I I I
Z
CSZ3I 8ooIeon AIqebro 3o
Reudinq the MSP fr4m the k-mu5
FinoIIy, you con find fhe MSP.
- Eoch recfonqIe corresponds fo one producf ferm.
- The producf is defermined by findinq fhe common IiferoIs in fhof
recfonqIe.
For our exompIe, we find fhof xy + y'z + xz ~ y'z + xy. (This is one of fhe
oddifionoI oIqebroic Iows from Iosf fime.)
Y
x'y'z' x'y'z x'yz x'yz'
X xy'z' xy'z xyz xyz'
Z
Y
0 I 0 0
X 0 I I I
Z
CSZ3I 8ooIeon AIqebro 37
Pructice k-mu5 1
SimpIify fhe sum of minferms m
I
+ m
3
+ m
b
+ m
o
.
Y
X
Z
Y
m
0
m
I
m
3
m
Z
X m
4
m
b
m
7
m
o
Z
CSZ3I 8ooIeon AIqebro 38
S4Iuti4ns f4r 5ructice k-mu5 1
Here is fhe fiIIed in I-mop, wifh oII qroups shown.
- The moqenfo ond qreen qroups overIop, which mokes eoch of fhem
os Iorqe os possibIe.
- Minferm m
o
is in o qroup oII by ifs Ionesome.
The finoI MSP here is x'z + y'z + xyz'.
Y
0 I I 0
X 0 I 0 I
Z
CSZ3I 8ooIeon AIqebro 39
F4ur-;uriubIe k-mu5s
We con do four-voriobIe expressions fool
- The minferms in fhe fhird ond fourfh coIumns, ond in fhe fhird ond
fourfh rows, ore swifched oround.
- Aqoin, fhis ensures fhof odocenf squores hove common IiferoIs.
0roupinq minferms is simiIor fo fhe fhree-voriobIe cose, buf:
- You con hove recfonquIor qroups of I, Z, 4, 8 or Io minferms.
- You con wrop oround oII four sides.
Y
m
0
m
I
m
3
m
Z
m
4
m
b
m
7
m
o
m
IZ
m
I3
m
Ib
m
I4
X
W
m
8
m
9
m
II
m
I0
Z
Y
w'x'y'z' w'x'y'z w'x'yz w'x'yz'
w'xy'z' w'xy'z w'xyz w'xyz'
wxy'z' wxy'z wxyz wxyz'
X
W
wx'y'z' wx'y'z wx'yz wx'yz'
Z
CSZ3I 8ooIeon AIqebro 40
um5Ie: Sim5Iify m
0
m
Z
m
b
m

m
10
m
13
The expression is oIreody o sum of minferms, so here's fhe I-mop:
We con moke fhe foIIowinq qroups, resuIfinq in fhe MSP x'z' + xy'z.
Y
I 0 0 I
0 I 0 0
0 I 0 0
X
W
I 0 0 I
Z
Y
m
0
m
I
m
3
m
Z
m
4
m
b
m
7
m
o
m
IZ
m
I3
m
Ib
m
I4
X
W
m
8
m
9
m
II
m
I0
Z
Y
I 0 0 I
0 I 0 0
0 I 0 0
X
W
I 0 0 I
Z
Y
w'x'y'z' w'x'y'z w'x'yz w'x'yz'
w'xy'z' w'xy'z w'xyz w'xyz'
wxy'z' wxy'z wxyz wxyz'
X
W
wx'y'z' wx'y'z wx'yz wx'yz'
Z
CSZ3I 8ooIeon AIqebro 4I
k-mu5s cun be tricky|
There moy nof necessoriIy be o unique MSP. The I-mop beIow yieIds fwo
voIid ond equivoIenf MSPs, becouse fhere ore fwo possibIe woys fo
incIude minferm m
7
.
Pemember fhof overIoppinq qroups is possibIe, os shown obove.
Y
0 I 0 I
X 0 I I I
Z
y'z + yz' + xy y'z + yz' + xz
Y
0 I 0 I
X 0 I I I
Z
Y
0 I 0 I
X 0 I I I
Z