Basic theorems and popertícs Poolean Alqchra

Theonemns PostuadCs
b) a)to: bx 1:
) a)tl 1 b)z o o a)ti-1 b) 70

distaibutive lau 1y ty) (at

The templiment oa funtion F is and
CDmpmendt 0f g funtlon
os in the vale ol f
Obtaintd from an intenchange of o's for i's on
theoacm
theoxm
defved hom the De mnqon's
he compliment of a fun is

A +Bt) A B
1ly Bc) A Bt
stales thad the Comple
qcnnalized tunm of De morqans theo em
intenChanqinq AND and OR qates
Mend of a tunctíon is ohtained by
each itenal
and tomplemend ing
Find the compliment 0f the tunctfon h f F: Ty3 z

Sol) F: y47J3
1 Dual o F, 1s Cy+ ) (+J13
Step
Compli end each fteral (1t 3 (tyt )
Step

Dual ot F, is + (+3) (y+

Complement each literad +(yt a) Cyt 3)

 Minterms ard Manieams

Mi'n tems Ma tems

Repeseru Repsonbed y N

is should be os shald he
Conslde1ed
Consfdered
tinst we calcuate tnst we calula r

Sop POS

Mintevms and Maxtems to thaee Binay valablecs

Mintems Maltems

Term Desfanaliun Teims Destqnathun

Mo mo

MI M
0 M2 M2
y3 M M
My
y13 My
mi
D
MG
y M y3 M
y M 4

A(Mo, M M)
S (mo, m
untton o thee valables

O
O 0
O
3 t zy 3+zy3
Sum o pnuduets (Sop)
t M, t my t m
|tome d by múnkms S(l1,
(\4,D
lel4
f 5y 3ty 3t Xy3+ u3 4, S(3,5,6, 1)
m31 Mt , t M
Boo kon tunction 11 may he
Nouw
NOU Considen he tomplement o a

mirdem for each tomhinaic

tale by tonming
a
tiuth
1ead tom the
functfon and CRinq
these tem
fn the
hat prbduces ao

n tes
tunttion
ohtain the
the (omplement of T, we
we take
1) (11 y t )
(max tems) dual f(x19y
Pboduct
Sum Cpos)

(t +3) (X+y13) Ci+9 3)

Complement (1y7) Cr4913)

C0,2, 3, 5,6
Mo,M,,M2, Ms, Ms,ns
ohe (omplemendinq
ne qet
is thtained
lely T fom thbe table

y1 3) (a191 3) (7yta)
(x1yt 3) (71

f Mo, M,, Ma Mu
toF (7,9,D 2(1,3,5
And the product wmact erms epmessfon

F
O Mo

0 My

Mb
M1

tunction
need to consfde 0s the
TO ma teerns e
 F(,9,3) (x13) (xyt 3 C+3)
(,y.) Mo, My, M A (0,4, 7)

Find the Sum ot mintems epressfon for F: C13,4,6)

3FF

ConsfdeY the
we need to
To Hnd Sum of mintems epressYon

Is fn the function

F(x,9,3): 9 +y3 9 3 t y 3

Sfandard sum o podcts, Standand podrt s u

(s sop) Epos)

p e s s the Beokan function F AtB as a sum mfntemms

F- AtB 2t:1
Sc
1t Ts s not fn the Ssop, ic all the vonfables n each tcm, should
theac
F A 1+ BC

F A CBB) tBc
-F B AB +B
stfii Che vanfale is
missfng
AB(1)t ABCI) t5c c1)
F AG CCI)T AB CCti) +atA) B c

F ABct B7 t Act ABT t ABcr AB

 as tX 7
neect the Comnon ttms

lhe Laialls
It cosfsts all
F ABCtAB
tABtABT t ABc
prode ts fomm
cum
J4 s 1in Standand

mtm6 t ms t m t m

1)
F(y) SCLu, 5,6,
a pmduct marttm
Boolean functfor
F yt 3 as
te
pesS
d'stibutfve law
Sol yt3

tun Into R fCms by usfng

st (onvet the
1Y (Xty) ( 1

F= y t 23
FCu4+T)(yt3)

CYt 7) (yt2) Cat5) Cyt3)

F (ty) Cz1a) (yt
function has toee valables 44 43 tach CR tcom Ts nfssng cnk

VaMabe theretone we combfre the AND the mfssfng tcm n/th 1ts
Comple ment to the t o m

t +9t33 (71tD Ityt3)

z13 t 3+y9 Catytz). Ca«yt)
+3 yt 3t77et yta) (ty+)
he ttms than
Combfninq au
ohdemoving those appeare mne
obtain
hue, woe fnally
FCyta) (191a) (71yt 3 (tg+ )
It 1s in standmd odut th Sum

F: MM, My Mr CSpos)
F(.3.3): A Co,2, 4,5)
 Map Metho d
Too vaiable k- map

om,
m M3

for tuwo varioblcs

In a tuwo Vaiable k-map theve ave tour minteoms
mínttvm
tene he map consistS o oun Squnes
one to Lach

NoTe 1hc minems aut nWhich the funuton fs asscTted ae manked

with a
D Mo M d i k the (ommon

M2M M3 Vaiables
f

Thwee-voiable k-map
O1 1 10
Mo M M3 M2
Mu Ms Mm
yayay
hcneane eiqht mfntms fo 3 vafable thec fore map
K-map,
Consists o elght Squares
Mott that the mintcrms a i ged not in a
binay scquene, but
in a Scquence sfmfiar to the hray code

Note hy tuwo adjacent squares n the map dhe by only ore vaufable

Mg1 m 3 1y 3 3 (9t 3

-C, lhen me combfne two adjacert squanes, One vaofable wit be elfmirakd

Cve tically 01 hozontally but not dfagtrau

 *Simplity te Boolkan functfon F y . ) - i c3,3,4,5

Sol dentify the no o vaiables for thc qfven tunctfon C2 0T 3 or H

that Yantables
)Dao the k-map th
o Maxtr7ms

9Jdenti fy nlhe the Mintoms ane

gen
the pantfular
H14 Mfnt nms ane qen then n the k map, too

Squane o , Wbfle 1

ane qfven then fn the k.map, tor the p ontfcula squane

maxtom$
boxwntteo
tells
)Then to mfnmí3e thx functYon qo o gsouping o
Cen.qnoup o s, Tup H, gvup ot
-fon mar to LDuD

1) Then nhite the minimal Funttion

M,
oM
Mb f:ij t 7y

ulite the wmmon variabe to7 making

he gDup)
Th F(,y, 3) SC2,3,4, 5): Mytt q

Fov the Boolcan Funtfon F- Ac+ Bt ABct BC

tumess this FuncHon as a Sum o minttms

ffnd the winimal Sum oh ptoduts cxpcssfons

Sol Guven, 1had is a sum oi pioolucts, but not a sum o minttms
uons1sts oh al vonfatbles ofth Funtfon Ho each tom
011 fs a 3 yamfable functfn CA,B,)
3) Iha 3 Vavfable fun, i4 a ttim Conststs o onuuy tuoo Vasfables o
A,8,) teaals
->1 fs 4omed by a gnoup 2 Adjaleut squares(Then onuy 1 vaulahk
WA be E muved)
 HC- qoup Mi, M3
m 3 , mD2
SimafH AB-93oup
8c roup oM3,mi
MO M M

M M6

boolean tunttbn ís F CA,B,C): S0,2351)

SuMmintems for the qiven

fs FCA,B,): CtAB
L)minimal sum o poducts
0
De,
Mo
AG
.. FCA,B, Ct AB
minimal sop
C

H-vantable k-map

o M M3 m

M M Mo

My
2 Mi3
11
wy3 wg wy33ry3
M aM Mo
10 wg wn wTy wTy3

The map minimízation tou vaiable Boolean Funtfon is

Sfmfia to th Method Used to mindmze thoec vaofable funtHons
Onc Square Yepie Sents Dnc
min turms, qfvinq a ttym with 4 liteal
Tuoo adjatent seruares epcsent a te7m with 3 ifterals

f o u T adjalet cquares Tepxsent a ttvm uofth 2 1fterals

FHah"
Sixtten adju tent Squanes prodvcc a tun that fs aluoays cquals to L.
Smplity the Boolear functfon
FCo,y, =< C 0,,2,4,5, 6,8, 9,12, 13,1)
Sol O O0 11
tmO M M3 Ma
0
M

M2 Ma MiS
3 poup hH

SImplity the Boolcan funtion

F: ABc + BCD+BCDt AB T a) find the min terms

OL 10 minimal Exps5ing o
Mo M

ABT Mu M |M M
oL D ABc5

11/M M MsM4

soM BcD

ABT
C0,,2,6,8, 2o).
. Sum múntms is tven by F CA, B, (, D)&

Mind ma enpoession o
o
m
00
m6
Lroup q ACD

Mi
fCA,B,C
mu BD+B+ Acd
wil
our cones
M
Coup
HBT BD make a qo up o
Dont cae cond'Hons
certen
centein combfnoad
combirai

t h Fuunctton ts not Speci-ficd fo

JnSomc applfcatfons
Yalous Vauiables
-fons o the
decîmal diqlt then sfx tombinadios
tor the
e for a bit bfnmy Code to be unspec?ficd
Consid cied
are
uSed Cnd conscque hHy
tha ane hot Covnb?nations

outputs
to some fnput
that have unspectfed
FunctHons
functions
nomplc tely
Specified
0ne callcd the
the
what
ohat value
valuue sIs assumed by
dont cane

cpp cati ons

we Simply
st applf
STn most
he unspcc-ied minteyms
functton foy mintoms c
to cal the unspeciticcd
it is customoy
tor this Teasons,
con ditions
dont case
loqiccl
FunctHo as whose
Vauiable
Combfnaion
d o n t cave min
m is a

Specifiçd
Value 1s not
and os. isuscd
conditon frum S an
x
e
the dont
-To
dfstfngudsh
indfcautes
that don ae
in the maap
square mintom
paLfulat minom
a
. Ihus a n x insfde for
or a paltfulas
assíqmed
to FE
the value is O 0
lhethCY

functfon
Boolcan
Sfmpfty the Whfch has the
dont cone
tonditfons

FLc0,y.3): £ CI, 3,7,,15)

dCuo,9,3)
= S Lo, 2, 5) 1 10

L10O Ma M
Sot ol Mo X

Mo M M O0
M6
Mu
M6
Mu M 13 s Mu
o Mu
Mp
M
|w
Mo 10
O
10

Fy3t 7 |F-3+3W2
 G
Both functfons ane commect, o th the bep X ue ned to compete the

gDuptng a u 's
thx minimal tundfon as
dont Cone oh ms we qct
-Sulth the help o
S C,5,5,7,1,15)
F y3t3
tun
wc get the minimal
canc tom mo, m> ,
dont
u t t h the belp o

oS S CO1,2,b,7,01,15)
F y3t T
o's x for quupinq then +fd
conside
prvduct oh Sum, ony
To gct . ool,1,1D,

the Boolcan cp co

F Zt
than do complenment
daia CotDonp l®+y)

b,2,4, 6, 8,lo, 13, 1

F z z (w+D|
DOS

Decima tdde n BcD, ofth

an

two dectmal diqfts

the aithmchie
addltiop o cxCced 4,
Consde dcesnot
Since each înput diqlt
ram pcvious Staqe the Sum belong
inpuut Carmy than t9t1: 14, the 1 n

cannot be qe atey
the bwtput Sum

an fnput ccryY
adder lhe
tuso BeD digtts fov a Hbt bfnany
Suppose uoe apply esult evenges
tom
a
procluce
the Sum in binary cnd
addey ofll toTm

and zi whac k Is the

labckd as k, z8, ZH, Z,
etna umbcas ane

B B B, B0 As A A A
carr
BCD BeD Mos angcs
trom
Sum o
No's Bihouy Add o to 1a0e
 than equal Ho iool) Then tP s a
1 t h e obtalncd Sum 's less
br

No hced -lo Con ve t

BcD no.

add SYz (otld)to

the otalneol sum s qeate than CIOo) then
>I
Sum to convet n to BCD Lumbe
the binany

BCD Su m Decmal.
Bnay Sum atiun

S T es e n t
k Z8 2 CSSu Sa
O

O
2
O

O1
D

1
O O
O
O

D
O

O 12

3
O0 0 O
O

16

17

18

O 1D
O 01
Block dfaqram t BCD.Adde Addend tugchd
LLLI LLL
CoLy bit bYnay
CoTY in
ad de
2

6uutput ca

bit benay
adde
t e ux olneve h tatir, uhan 1h nan ur, 1s q o t 1 a

-1k.1 > Sum tn

and 2 1 AMY ) o4hi voals ur rrd to

2
add t ctret rdo edrre
Surn1
J z z ane 1

C kt 2g 4 t 2s 7,

NAND AND NOR 1MPLEMEN1ATI0N

UANO 0 ioR
constructed wfth
Digital efacufts ae
facquenty
0F
gates adh thorn wfth ARD ond
gate
elechfe
wfth
fabfcete
NAND ond NUP gaues e easte to

LOroponents and ae the base qates usrd în au Ic daftal ogic

-Fa mftfe s
MAMD cousts

1s Sad to he a unneo sad cute

b e c a s e

any 1oqic
The NA MD qate
ft
Cincult can be Implemcnted ufth
AND
A Convenlcnt uau to 'mplemnt a Bookarn functfon wfth
ntems o
qates fs to obtain th stropifficd Bocear functfor

then the fo(tfon AIARD toqfe

Bcolean opcaatns and
cthvet

clqehrarc epessforn fum AND, OR ard

ctmp kment
-Te eonvensrn an
tcchr oputhot
manipulatfon
to NAuD Can be done by srmplc crcuult
D-0R dieagrcam o NAND dagami
change

3 Cy7)
0AND- inver 6Invet OR
T Two naphit Symbols -fon thacc npud NANO 9o
 wo-lCvel lmple MCntatfon

The împlementaHon e tuwo-level Boolcan tunctions with NUAND 9ates

tunctionS to be in Sum-on products tonm

equles thot the

-Let us tonsidey a Boolcann Function

i) F- AB+CD
Step 1
uoith AND, OR and DT Jats
Implc ment he Fun

-D

Step 2 wfth AND- in vevt

Nou AMD qades ave eplaccd by NAND
gatts
lnve t -bR
and t h OR qake is eplacc d by a NA ND qate wlth a

qrap hfe symhof

-F
D
Step3 Nouw the Dutput NAND qate s Tedrawn wth AND-iwet 8ymbol

sam)
can bc accep table, CBoth ane
cruts fq Ch) o C)

Implemunt the Boolcanfunctfon With NAND qates

Flz,5.: £ C)2, 3,4,5,D.

Sol Fst stop s to sfmptfty the functton intp Sum eh pro dutts

Tonms by ucing k-map

 213

95ceupin9 Squanes

0Lupfnh9 Squanes >zJ +*y

'. Minium Boolean FuwxtfonF Zt
xiý t y.

D b-
F
Conve

NAND qat
3 fh tb)
3

tig C)

NOR Implcnenafod
unive7sal qate that can be used to fmple ment any
NCR qcte fs cunothe
Beelean funttfon

NeR Cperatiun s dual ot NAND operatforn lhee foe all pedures

-)Thx
cnd uks fo NoR logfe cne te cluals of the comesporcd n necedues
and nules developed fon NAND logífc

Gy) D xy Cxy1)
a) OR. invet b Invet AMD

t1Tuw qaphic Symbolsto the Non etes

Atuo-tuo- level mpk nntatfen Wth NUR aes rqt(aes fhat the
unctfon be Smpited nto udot osun foam (s)
hote The stntifcd os expessfon s obtahed fuom the kap by

COmbinfng the 06 and comple heut fnq

CR tat
pos cxpessien s hmplementrd wrth a hst e l gates
Second ei AD 9uc to pudoce
Phuduce the Sum tCams followed by
the pevduct

Then thans-toom OR AND dagam to NOR dpam ychangínq

DR qates toNCR gates tth cR hvet raphre symbel AnuD gats
to NOR gades lith nret- AND qaphfe sumbol

NOR galks
*Implement the Bocolcan Function F CAtB) (Ct)E sinq

Sol Fe CAt B) CCtD)E

D F

JOT qatcr
iq Cd pk mentinq Boole an fun CF) ifth AND, ER

OR hvey Symbol 8 nuo qate to

convet OR qales to NOR gate by
NoR qae Wtth Inent AND Symbol

D F

ig Cb) Imple menting Booleen functfon usith AloP 9ats

agmltude comparatoi
thot compaies
is a combinatfonal c n u t
Amaqnitude companaton
detcrmfrnes thís e l a r v e mamituts
tuwo numbea andand B and

three binay YCavfabts

buttomes o CDrpenisfon 1s Speciticd by

A>B, A B, A<B

2brt maqnitude (ompiretoy

C2bH BC2bit CAe) CA : B
A Bo E L

O O
O O O

O O O O
O
O O
O O
O

O O

O O O O

O O
 A A Bo 6 E L

Nou usínq k- map, witc the Bookan ezp»essfon fo n, GL

Bo
A Ao B,
AtoBBo

O
1D
11
00
Ao,fo

o
O

A, A Bo oD
|12
AAp B,Bo
o o0 AApo
AB
Ao 1D
2

AB

2
14

10

GAB+ Ao BEo + A, AoBo

E A Ao B B t A AB, Bo t A Ao 8 5o t A, o B,Bo

NDuw împement the irut díaq am by uSing the cquakon E GL

D Bo D
 D

ED

FD
ED
Multiplciei
A multiplexe S a combinatfonad cincuit thad selecls bfnay int

ines and divects it to

Omatfon hom onc omany fnput
stnglk Output Ine

The selcction apanti cular nput Ine fs tekul- conholed by

a se o SelecHon lines
*Implemcnt the Boolcanfunttion FCA,B, , D): £C1,3, 4, 1,12,13,14,/5)

Using e: 4 Muiplener
Cot B CD S2
B -S
O D
So
O

D -F
O I
MUX

O 4F-D D I

O
-13

F=o
O D
O
1
oFo
O

Hq Iplemenkinq a inpud Fun

FD
- ctfon usinq wutiple C

o F:1
Impkmrt the Boolk an fun tion FCA,B,: S CI.3, 55 6,D Usíng

' 1 MltipleaceY

AB
A S
F t CIo) B So
:
To F
O 0 F e CI,) MUx
T

F r e c1.) 1

Ux multipkae
3 input
function uSinq ux
9Mplem enting_a
- -

2
mu

fi 2x MU.

mux can be qiven as

y :5 To ts1,
-butput

Ux1 Mur
using 2x1 MU
* mplcmentng
Ren u
Finst divide the qiven MUs by 2 S A MUu
ttp

ae
Total 2t1= 3 MUx

cqured C2xi)

Sep 2 Gve the selection linc rom Outpud Mux to Input Mux's

cLSBselectfn inc
 (2)Mu

C2D u

-o

S
(1)

Selectfon nes numboing

mplemenhinq sx1 mux usng ux1 mu

qule and OP gak

,
+ we gct O5,then uk

T0ta 2 Mus +10R 9

10

MUL

6 F

21 Mu
Iplementinq S1 MUx ustng x

ux Sx
- 4

2A1
2 uAxes ac c qulcod
 2

)
I. Cax

SO

S
a4) F

Most sfami ticanct selecton

S line to lcagt

tor 8x\ Mux, these w bc 3 Selectton lines

SS So
fin Impementing &x] Mux usinq 2X Muxes.

muplemcninq 16x Mux usinq uXI Mu

Req mux 1bx

Available My :
xl

Muscs ae equed
 T

U
S3 S2

uxI MUx
MU usInq
i Imple meninq lb A