0% found this document useful (0 votes)
4 views

Adobe Scan Oct 04, 2021 (1)

The document provides an overview of logic gates, including fundamental gates like AND, OR, and NOT, as well as universal gates such as NAND and NOR. It also discusses laws of Boolean algebra, canonical forms, and methods for simplifying logical expressions using Karnaugh maps. Additionally, it covers standard notations and designations for logical functions and their implementations.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views

Adobe Scan Oct 04, 2021 (1)

The document provides an overview of logic gates, including fundamental gates like AND, OR, and NOT, as well as universal gates such as NAND and NOR. It also discusses laws of Boolean algebra, canonical forms, and methods for simplifying logical expressions using Karnaugh maps. Additionally, it covers standard notations and designations for logical functions and their implementations.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 25

LOGIC GATES

e
hasu lamanl whih DM
ogic ali alt

bLoks o1 0pler dglal Apdomu


Aypbm
butduny

fUNDA MENTAL GA TES

) OR 4ATE

O/P y- A+B

TAuth Tabl
A 8

GATE
) AND

8
Ruth Table
A 8
00
0

an nUula )
GATE (H acli u
3 NOT
A
olP Y A

Tudh Table

AY

UNIVERSAL GATES
also kroun QA
Q
an
NOR nd NAND gal
an be uied
uLed
dwwwwwal 9alu becau t y

udi idully a Hu wwwwsal buildu


Locks b huld Ory logic u t .
) NOR GATE
t inpliuu OR wnelhon ulh an inulid output

A Y= Ate

OP Y= A+B

Tauth Toblu
A

NAND GATE
a AND fnion uth an uuulid sutpt
ipu
A = A.B

TAuth Table
A B

O
0
8UBBLED GATES

E-OR GATE 1uA ony


olf Aigh Only
both anguli a dlfui

YAB = AB+ AB

TAuth Table
A
O

a) EX- NOR GATE


o/p y AB A 08 A8t AB
Tuth Tab
A
O
O
Lh hthn hi ih

h
LA WS UALITY THEC
COMMUTATIVE

A+8 8tA
ouat
i) A8 8.A Obkarud
5ASSoCIATIVE LAWS

i) (A+B)+c =
At(8tC)
i) A.8).c = A: CB.C)

6)6) DISTRIBUTIVE LAwS

)A.(A+c) AB +A:C
AtCB-c) (A+8)- (AtC)
7) ABSOA PTIVE LAWS

A t AB = A
1) (A-CA 18) = A A +B) (A ) A

i) At AB= A+6
iv) ACA +8) AB
8) IN VOLU TION LAW

A A

9IDEMPOTENT LAW

i) AtA+A tA+ - - - +A A
) A. A A A A - - -- - A A
hr.y) f n
1

D uol Jolion

A00

h+h A A-A A

AB BA
fe c)= (A8).C
h1 (01)- (h18)4
At(0-c) + 8 ) (At)

A. (A16)
= A

ACA 1- A 6

E- MORGAN'C TH6ORM Aum egjual


a
Alglis hal
u omplmu f
ompomani.
enpaued as
h fhdnd
A

ous. (0.D)t (A.(D)


h ABcD
ty War

/
"/
terment i)AND gali 1lh ol k NOT alns
I1)
AND NoT Jalu

AB

Make
ty-of al
uauny Mn imUun
A AB

.AR

AA n8 A AB+ B. AB

.(A1@)e(TB
A0) (A B)
At AB
MLE MENTATION DSNG 4ATI S

) inupent atl 2 i/P tojial uuing NoRfnlu.

a) NOT ofalon p0R ofalion

AtB
AtB
A A A

C)AND oualon

A
A
A 8

B
6-
mpumut al 2 Up al f uvg NAND
gali
&)
b) AND ualuon
a NOT /UaluDn
A A. D A-B
A
A -D
OR yualion
c)
A
A L AB AtB
STANDARD AFRE SE
NTnTIONSO
LOG ICAL ONCT|ONS
OK

)Sof Sum iA0ducla) fn


2) Pos PAvduct
ef um) fon
Sof om two oa ALOLL
SOP tnp'aLULLD
AND Awntlwu Oked loytthis

ABt AB t AB
dual SoP
dPos fom-tos
ros npAmon u. te AND fnlon two
LOUL Oked undions

9 +6) (B+C) (A+c)


Conuut AtAB J standard SoP fpmm

At A6 ACB+8)+AB
ABt AB + AB

Nlim

onunt (A+8) (6tC) unlo tandaid Pas frm.

A19)(61c) (A+81 ca) (A +8tc)


=

A+81¢) (A +8+T) (A+8+) (A+6tc)


=

t81c) (A +6 +a) ( +0+c)


MINTER M DESIGNATION
Vauiable without ba
Yauiable th ba- 0

ABCD 101| m
ABTD m
1000 M
) Fvnd komptuli
npAuuion fr minlem
duignation
ut w
2m(1,3, S7)
ae 3 Vaiablu A, 8, C
BC t RBCt ABc +
AbC
MAXTERM DESIG NATION
oeluCt
-M (o, 2,35) Vaniahle ith bar-1
Fid compluli aaable wittot bas>o
uuuwn fo Manlem dauo nation
Y TMo,,3,4 duig nation
Mo A+8-+C
M A +8+T
A+ B1T
My A+BtC
Y=
CAt8+c) (A+8+z) (A+6+T)
(h +B+c)
CANON1CAL FORM 0f A LOGIc ExPRE SSJoN
each ibm
a yne tapLACitn tontan all
Vagiab , Jhen t callrd anD ni cal fom
Nolim: i Luun
" o phoduda pon a loyi
n
anOnu cal fem, tah poducd
um u Called a wrlen

Madem- nun odut ums om a

andnnal ferm, each


CnfsA ion

Aum im called a anlim


s

funNCTION
SiMPLIPIcATIO N OP LoGIcL

USING K- MAP

u a gaphical tchngu
KAMap hod
beolean undions.
toe inyltyr K i p h e s e n q U i o n n

a 2 di'mvuuonal

uth -takl.
44uaie
onnili e 4guaus. Each
AuUnlim. Fol n vanakles, 2"
Rephisnns
AUAALL ase heur.
Po a munlwm,1s al
unulte\
aAL
OAKLp endury Lgpuat A os
lo
OAALLpad
tuhich
hoie AU

/Ro du ct teams nwt AsUl

two ad aent Lguais ddfes enty

1 1 vaiable hu can b rouya


ds geihs fer Linupliication

TwO VARIABLE k-MAP

8) ung k- MapP

Z A B+ AB

AA

2= A
Ans

VARIA BLE k-MAP


THREE

ABBc
a) Lolu
G) f- ABCtABC +AB*
AB
A

Ans

) olue
Ma
1 6ct A6t ABCt AB6C
AB A AB

f A

) dou wuy k-Map


Y A6CtABC
AB A A AB

Ans YA
foUR VARIABLE K-MAP

) Lol YABCD A 6TD tA 8cD+ABCD tTA

AB AB AB

TD
CD

)soue wny K- Map

AB AB AB A
2

CD

CD (o
8

An Y- ABCtAcDtABCt ACD
el ulng
z
+ABCD +6cD
AB 6 A6, AB

A ny

h-Ma
)
AB

CD

CD

c
tATA6
ABt
A u f
) selut usu k-1aps

nBC 6 Dt ncD t AB+A


T (A,6, C, D)
CD CD CD

AB
AB

AN f= AtB

A) solu vdng K-Maps


X= ABC+ ATD t8+ A86D tABC
ABAB AB AB

CD

CD

A X + 8C
AGELLI NG Of K-MAP saUAKES

AB
CD 10
00

lo D

AB AB
AB AB

C
FRO M
FOR M
KEALIZATION 0f
Of POS
POS

k-MAP
) ( + 8 (A+
)
A+6) (A+
O0

(c)0

(T)
(A+8) (TB) CAtE(A+8
0
O0

A+ B)00

At8)°

ir)

Ok
fo Aualigalion PoS npdLun, gioups
4o a uade um4produl

Conplemurtay unelio ú otavuud.

YM(O1,3)
AB

An ABtA C

(n+8)(A+E)
DONT CAR CoN'DITIONS
6stufunda
ulbls du

(O(CA haue
JnAd Aituat0,

dum lo iLUma
heie nutuons

CeChU e conbinatuons
onud
(Ondi tanms
Kuur dont ca
(X)
ap Afuenlid a
K-Map Onding
il

Lhe ouLp
0Ls a k v

K-ap
(3, 4, 7,1©, )
9,13, 14, I S t d
m ( , 1, s,
7
AB AB
A8 AB
TD X

A u n t u m / ma x d a

D e n ' tC a u

t i e s

CD aunt

aa
Jgi

incuelscd
ma
m a ba

ANS Y- 8t AC +AC
(A,8, C,D)= Kap:
(
ni ,2, 3, 6, 8,9,
12,4)+d(,4, t, i)
D D CD CD
A
AB
AB

AB
X

)clu Y=
sm(1, 3,7, II, 1S) +t d(o,2,
TD CD CD
X
AB

AB

y = CDtAD
T

o
M
cla culion
tY todo
)hehtedtdon ) Non
lerliye
Cdon (2) Non n e i t o d to
1e Cod ) oquanlial tod
Albharhomeyi. tode tode, a datei
Owented tode o s e h tod
eisuted toda, 2ath biuam d
asslamed b
depend on 9 aweiu2/valuss
a
positenn binamy
Beb, 8421 2421, 54l ect
(2) Non eighted tod
C
(Unweghtel coda
Those ode» în ohic
hose
digt Valu
does mot dabend upen s position
e adh d posihion itin tka mumbeu
mofixed valu eR Excem 3
0ode, Cray ode
Retleci
oodeo Codes Or Self tomplemet
A îs said to be
Aotteative
's Ole ., ode. word
Ompkement
be obteine N .e CN-) Con
od Oord
N
s amd intehan all t s ae
O's
H221 a11
a11 Lxces 3 Codo
* H2-3 3 etc
A
Lel hoeiated
( oda s d o be
al tomplementing tod m
eiztz ?s
eua t . z
equeuial todas n
2ach &uecedi Los Sequoutial Codeo,
SequotHal todaa,
greate Hhan
IS no
inan Ombe
for
brecesRRe tOde
421 2
Seqnddhal code. Excén-3 Ode. on
a11 2 52
C72

1
(

You might also like