Professional Documents
Culture Documents
fluelsating Ve
2ene diod Áe R B.
Rs cnd 2enee
the cuent thaoua h wittheutr any
Valtage dhop
sess '2ee d d e
chang valtage
(as i is in 2enes alco
ent
csient P and any
ths,eughwthoe change
ilp veltage deeee
aees 2eud .
but no change
Utage
DEVIES
0PTo E LECTPONlc JUN(TIOTN
Vevet)
wnde RB.
Veyc a l .
TE
Se
Vce
VEE hole
e seplaeed
siilas
Taencislr
qcsatrons
Cohnon
bse (Ce)
() emilen (cE)
(u) tomron lollecoy
(u) tomon aed
Emileu
Comnon CCE) aaleisics.
emitlen
B
( Vee
VeE
VeE
p charaeleistts
cuut
VeE l00 V Vaiaton & Base emlle
base
(VeE) t
60 Vettage is called
(Ve)
C/pst chataeleu'sti cs
Lon
VeE CN)
/P chesa cleist'G
ten
Vaiatton Tc conct
vtkage vee)
charaleisti'ca
Împetawt pents
worts actie Aegron.
atiom
C) "Ianetor meu dece) te
metton ehaseqe
contelud bt
tsanistor
Casie. AVBE
( VeE -cons
Aesanee AVE
)
Cussent
wsent
sensctndetanee
to chan
veltage E tsanci'tor
Ay = AVe g mxRe
(w velltge gain
veltag gin in Av
Applicatiens of Transister
Vo
Vce
Vo
for si vi<D6V
Sausçon
Tranicta in DEfslate
mnd Vo = Ve
V D6 V
Fransfu chaacleuictes
Traneichoy dn tetive ¿lata
Vo
co Vo dinea
Te Linet
4u vale becomes less than
buymd thil it gees to aatualion
2) Taenastes
Vo
Ve
Vg6
KVL
.'. AVB - 0
sinilaaly Vee - T Rc
AVo AVee - (4I)c
-P.Re
-Ve siam epesens p pha op veltage
0sATO R
" TRANSIS TOR As
T
mutual
Ån duetan ce.
" Feedback ct
4
S (satc)
Comparative study of transistor configuration
CB CE CC
CB
R.
EE
Current Gain (A or a) A, or A) (A or y)
A, o R A, -
Phase diference Sane phase opposite phase same phase
(between output
and Input)
Application For High Frequency For Audble frequency For Impedance
ampli amplifler Matching
Y= 1+
1-4
1 1
+1
1-4'
a
1+8
SUMMARY OF LOGIC GATES
Name Symbol Boolean Circult
Truth table Electrical Practteer
analogue atlon)
Expresslon
OR YA +B
AB|Y
11
AND Y-A. B IB
ATRH
o1o
1oo
NOT Y -A AY
Iverter 10
Ae
NOR
Y-A+B
IOR NOT
1olo
NAND Y= AB ABY A
ANDNOn
10|
11
Y= AeB
Laws of Boolean Algebra
Basic OR, AND, and NOT operations are given bdow:
OR AND NOT
A+0=A A. 0 =0
A+1-1 A. l =A A.A -0
A+A=A A.A=A
Boolean algebra obeys commutative, associative and distributive laws as given below :
Commutative laws :
A+B= B+A;
A.B = B.A
Associative laws:
A + (B + C) - (A + B) +C
A. (B. C) = (A. B). C
Distributive laws :
A. (B+ C) - A.B + A.C
Some other useful identities :
A + AB =A A.(A +B) = A
(ii) A +1Ã B) - A+ B (iv) A. ( + B) A.B
() A +(B.C) - (A + B). (A + C) (vi (Ã+ B).A +C) - Ã.C+B.A +B.C
De Morgan's theorem :
First theorem : A +B- AB
Second theorem : A.B- +B