[go: up one dir, main page]

0% found this document useful (0 votes)
24 views25 pages

De Unit 1

The document discusses various types of logic gates, including AND, OR, NAND, NOR, XOR, and XNOR, explaining their functions and representations. It also covers Boolean algebra laws, such as commutative, associative, and distributive laws, along with De Morgan's theorem. Additionally, the document illustrates how to design circuits using universal gates and provides examples of Boolean expressions and their simplifications.

Uploaded by

ayus.yadav5897
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)
24 views25 pages

De Unit 1

The document discusses various types of logic gates, including AND, OR, NAND, NOR, XOR, and XNOR, explaining their functions and representations. It also covers Boolean algebra laws, such as commutative, associative, and distributive laws, along with De Morgan's theorem. Additionally, the document illustrates how to design circuits using universal gates and provides examples of Boolean expressions and their simplifications.

Uploaded by

ayus.yadav5897
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

1 1

1
1 semust Tnputb C2)
passibe 6
B A
Y=AB
epresentabioni Syrmboli
tNOR
e
buateI NoR CEx- bate AND 9
te Ga
X-NDR
Bullen
Excusive
OR Gate ’NDT
batel
or oR L Gate NOR > Gate OR ’
Gate XOB hate>NAND_ hate AND ’
es Speial baate Univevsal brates Basie
Gate
ut combinctbion
f vanious fon Output
an
ues that cincuit digital abate
is bates
ter Ss Unit
B
y= AB

A 8

1
1
1

1 1
1 1
1 1
1 1 1 1

2 DR- Gaate
Y= A+B

B
3 ony înput is 1
1 1. Output is 1
1 1
1 1

3) Not- Gate Y=A- A'


A

A
1
1 Outart is (omp eret of ioput
A Y=A

1
Outut s sgne as input

.uller is used to aet the same input as outot


V delayed intentonal

tis used to provide the propagctbion delay in


ireait

fer
iruit
also inpreves the driving capaci ty af the
5 NAND hate

8
Y2
C 1 A B
1 1
1 1
C 1
1 1 1 1.
NOR- bate
A y -AB A y=(AB)

A y= LAtB)
1
1 Jhe raer of oR
1

1 1
" NAND & NOR Gate ane hnown as univensal bate
because with the help f this Gate, we can design
any qate.
X-OR Gaate
A y=AB+AB
y- 4 B Reprase ntatin
A B

1 1
1 1

" when, both inputs ave dilßeront then oubyut is hiyh


ther name Anti tant Coinci dence gate
> 3n- equality detecton
A_ y=A
B y Yhe XOR ate behaves as a
babßer circuit when either the
1 1 igput it set to low
y= A

A
1 1

When eithen af the point input in XOR gate is


Set to high L1) XOR behaves as an înverter
cineuit 'on not gate cincubt
8) X- NDR Grate
y=A8+ AB

A B

1
1
1 1 1
- loincidene gate
Equality Jetecton
When both Snput d oulput is sae then out s
igh.
A

A B

1
1. Works as NoT Grte
A
y -A

A B
1
Works as Buler círut
1 1 1

A Relationship beteeo NOR and X- NOR Gate


A
yEAB +AB ABtAB
B y= ADB

2 Varables
A B y= A B y= AOB
1
1
1
1
1 1 1
3 Variables
A B y= AB Dc

1 1
1 1 1

1 1
1 1
1.
1 1
1

|ABDC = AD BOL

K Pulse Operation f logie brates


1 1 1.

D
A
Y-(ABt)

A-Bo

A8+c loo |o

ABtc|

-o o

1 1
TParalel
allel
series
lti
Mu
|series th
output
AJt deals
D tion
lhat
varia
outett
F
CA+B)C mathea
tiks binany
8
B
+FZ
AC8+c)CD+E)
+ with
C +AB lgebra
et
A A A/ Nalues
+C) a bronch bacic
theorem
ACB
Boolean
is4 loqical 6-
1
1
Hrs * On
1
A+ A= A |Idempoene hw
A-A = A
9dentity
Al= A
A+1= 1
dteatty law

Null law
A+o A

5_A+ AB = A
AC1+8
’ A tAB =A
A(A+ B) = AA tAB_Absorbbion l¡n
A+AB

AtA= 1
Nggation law lompleren tation low
A- A ] Double
A=A nga tion law
A+BC - (A+B) CA+)
- AAt AC A8 +8C
A +Act AB+ BC Dstri btion law
AL1+c+ 8) + Bc
A+ P
AB+ AC + 8C AB+AC
ALt 8A +AC) = Act AB+4BC
Consensvs
:B21+ BJ+AB
theore

LReduen dont bterdl rslel


19 AB +AC = LA t) CA+ B)
AA AB 4 AC+ BC Transpostbon theore
: AB+AC

RDuality
Ihe pinciple f duality theorem says that starbog
with abooleannelation we can derive othen
booleon relation by:
) bR’ AND
) ANp >OR
Comple()A+A
ment any- 1 zeno or one present ncypresi
(4)A AB At8
A CA+B)=4B
AA +A8 = AB
1+0 1 AB =A B
A BtC ABtAC
At84c 048)(4+)
De
A low a Boolean algebra
Commutatsive law
A
A+B= BtAJ
Jhe order in which the variable s are oRed ond mote
no dillercnce

Jhe onder in which the Variables are ANDed and mt


no dillerene.
Associative law
(a) A+C6-+C)= A+B)+cI
Vsing of OR of several variab les the esult is san
regardlss grop d vanables.

9t motes no Jilßerenue in what orde rn the vaniables


are gYouped when AND e Sevenal varsables.
3) Distribution law:
AC)- ABAcl
" OR Several variab les and AND the result with a single
Vaviable is equivalent to AND he result in single
Yania ble with each of se vergl arjable ond then
DR the product.
De-mog an's theorem
=AB
he complement f sum of voriglles is egual -to
product of ndividual components

Ihe tomplement of product of vanig bles is cqual


to sum of their îndividual components
2AB A+B

A BB A+B 4+8 A.BAB


1 1 1 1
1 1 1
1 1 1
1 1 1

io 3coplement
tor

A+B+C=
AB'C
C ABtC AtBtC AeBe0 ABC A-B

1 1 1 1
1 !
1 1 1 1 1
1 2 1 11
1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1 1
1 1 1 1

Demorga
A+B
8 A

o
A+B A

Aubtle ad AND bate


.1t is cdegr rom obove diagrem thot NOR Gate s
Same as Bble
bubble AND Gate
AB
A A
=APY-AB Y= AB
B
NAND te

A A
Y=A+B
B
B
Bubble OR Gate

From De-morgon s 2^ law >nt above figure NAND


aste is Same as Bu bbles ag 0R Gate

: A45+8:p . Prove tat A+ -A+B


rs AB AB Al1+B)+AB
3 AB A ABO ABC D+ABCD A(2) + T8
- Acp CB+B) A8C-(At9,
AB AS AC =(A+A) 4+8)
AB (A+8)
- AB A AB B .A -a+B) = AtB
:A44 4-B
Reduce A4AB
=A(14 B)
"A1 -A
AB+ ActABCLA Bt)
Ans AB + CcDtEr) +AB"5) Ans AlBtBC (A B+NAC edue to three liera
AB CD+EF+A8 + C ALB+BcAB+o)l Lteral Ltergl is a
-ABtC EF+AB CD AL8+ BCAB+0] Marñable or (ory trent
=A8+(t4 6)(E+F) +A8<D -ALB+BC AB+BtAC of variable used in
: AB(2 +cD)+ (C+5)(s+F) A8+ABCC tAC Boo lean tuncben
-AB+CT+DJ(E+F) F ABt ABc tAc yetw)t yzwntw
ACB-+ Bc)+ ÁC 42 )tye twr)
1xy+XyZ+ XYT+Xyz ACB+O +4c (yz)tyztw
Ans- Y[xtXZ+ xZ+R) =AB+ AC tAC
AB+1 =1 -Jtw

|Ansi- (B+AD) CC+ AD) Ans CA+BJA+B)


(A B)(*B)
AB2 tABC =AD+ BC : CAB) C48)-o
Ans ACLB+B) +ÃBc
AC+ABC A+B) lAB ABc) 0. Prove thati
Ans (A BL) AB+A BL)
- AL8+
lv) 1A A
Ans ABCD +BD CC+JtBTp ) AeA -0
ABD tBDt BTp |Ans
:BDIÃC t13 +BCD AlA- B) CAB)

elp +p7[5+]: B[T+]or col, o


from truth table
A B

1 1
1
1

)AB AB tA B= AB +

3) A8 AB + AB- A8 AB(i+B)a+B)

AB4 4 B

ADB= AB+ AB-7B t4B


AB- AB +A 8- ABt AB

)
olot/io:s

A Uhivevs al protr bes of


ot NA ND NOR Ga te
NAND Gate
O NOT Ga te
A y= A =A
A

AND Gate
AB
AB y= AB -AB - AB = AB
AB

OR Ghate
y- AB AtB AtB

xOR Gate A AB=


- A
AB
At t A-B
AA)At 8)
A
A A8 A-B
r
At8
e y -(Ardars
|AB
A+B)(4+E)
AB+AB
B RAB+ B
CA+B)Lat®)
A+ B ADB
XNOR bute
AOB ADB

JA+B
4-8 B

NOR Grate

DNOT Cha te
y A+A
y= A
9OR Gra te
A+B y AtB + AB

-A+B
B AND Grabe
A A

AB
X-NOR aate
A
AlAtB)
A AnB AB.
tp B JA'B A- t A B
B -CAtE)AB)

X-oR Gnate AB+TB


AOB
A OB = AOB

Y= AB +AB+AB

- A B+ A B
NAND NOR
NoT 1. AB
AND 2 3
3 2
No. of eate
nequired to creqte 1ate
XNDR 4

A Design of Boolean expression sing niversal gerle


&. Implement - (cD+E) lArB) Using
() AoL logic
Only NAND gate
(DtE

)
f=(totE)

A+8

A+B=A+B
=AtB
21/ot/2025
Sm plemcnt usihe NAND Gr le
F Alcpt B) +B)

Ans

B
A ot)
( imlereot sioy NoR Goate
f= (AB AB) (Ct D)
A

A
A4B+A+B

B 7:(F+8)(+B)
A

A+B
6 Convert the tollo wng AoI logic to a citcuit
using ) NAN p Gute cCii) NoX Gote
- NoR Gate

Ans 1) NAND Grate


A

D
RE aCbt c)tba using NOR brate
hsi gate

You might also like