0% found this document useful (0 votes)
37 views18 pages

Digital Logic Short NOTES

The document covers the basics of logic gates, including AND, OR, NOT, NAND, NOR, XOR, and XNOR gates, along with their truth tables and properties. It also discusses combinational circuits, including the implementation of functions using these gates and the concept of K-maps for simplification. Additionally, it touches on sequential circuits, flip-flops, and counters, explaining their operation and timing characteristics.

Uploaded by

roynitish640
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
37 views18 pages

Digital Logic Short NOTES

The document covers the basics of logic gates, including AND, OR, NOT, NAND, NOR, XOR, and XNOR gates, along with their truth tables and properties. It also discusses combinational circuits, including the implementation of functions using these gates and the concept of K-maps for simplification. Additionally, it touches on sequential circuits, flip-flops, and counters, explaining their operation and timing characteristics.

Uploaded by

roynitish640
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 18
Chaptes- t - Basics of theevems and oates- Chaptes- +. Oasis er __tmeesems one + Testes * wt Angfhing = 1 =a Anything Ea ®} # ACR * AR =0 * A(8+C)= AB+AC * AtC-O= (Ateycare) = A+ BC Repeated Eg. (CAF B+ TICATET HOC AtG Hey = (AE + cE)C A+B 40D Repeate: cpeated = A+B CAB +c) ing At BCE +C) = A+BC * AB + Ac+ BC = AB+AC os Complement Bache hue ka preduck Redundant) = Ac+ BB T Complement Cress reduc -! * P-(P+ Anything) = P Fes 1 Vasiables, . Me pe ch meme (ep of) ee at ee Lo Cembinahen ef Variables = 2° 2" Max term oa Self duoaX = eas oO. t L—o Noxiable —=>As hu - 4+ +. Logic gates” @ AND Gare: A e— sop is L only iF al high inputs. * 4% ony ilp=0 then, olp=O- * Enable ilp = 1 Disable ilp =O ® QR GATE: sate solb w O en if al lew inputs. ” any iIb=1, then, olb=a4 * Enable ilp =O Disable ilp NAN D Shoe: ‘—)— > 821) BS e— I— A-B Dene Pesm aby on Oe Oe clk es + gf any ‘Ip= O then, olp= 4 ‘Enable ilb= 2 Disable ilb=O ® Nor GATE: A A oo 7 7 6 oe BS ‘olp & L only if all lew inpum Dene Ferm - dhyan vkhe “MF ony flb= 1, ten elb=0 * Enable iIp= 0 Disable ilp= 1 (D xox Gare: s—))>— A@B = RO+AS Agas A@BOC_ puche > (AGB) @C - ASS °- A@A =L Pen ye Ae A®A=O0 Lt Fir ye * Fox © ip xoR = A@B=C given — Even ne- of 1, solb=O | awc-8 — OdR no- ef 1,5 olp= 1 SANORT GAVE: A — = AB s 3 >— i = AB +AB "Math ilp (Mere Shan 2) xNOR deesnt exist. Agas A®BeEC puke > (ASB) OC * AOR =O Bore ye Associative A@nzt Beg lac - Fes 2 ilp *~NOR'- _ — Even ne. ef L, > Olp=t AOB=L given = Odd ne of 1, 7 Olp-6 ASC=B * A@®B = A@B= AGB = ACB |" ilp Complement AB = Kee= Row = asl * WAGs NOs * ROB =A al Beth ilb complement ae > xon—= Kor A©B= ACB XNOR —KNOR, 1* Keowee 2D = A®BOCOD Steps Count tetal bar=S = AOBGC oD of eta) = ABBeECoD 5 SP even, expression ep 2.- 1 bay vemoval KO BOCOD costs 1 x0R MM cco ne | A+B ©s 1 XNOR invessien @ NAND? Steps- ® Write in SOP © Seah Fer hidden Eg- Ae+ BE “Cert (8 +R) =@+t cre) —S Assume NAND (Complement in adden) Variable 2 ® Write Fca,s,c>. ® Count tetal Not —> 1 AND — 9 or— 3 Eg® #(A,B.c) = AB+r Bo — Ne hidden NAND P= 2NAND Q= LNAND R= LNAND Eo ® (A,8,c)=- AB+ ET = (B+ E)CB+ AD = (+ (AB) XI NAND io x Frex+tn TF Be. YY LNAND yt 272 NAND sk Zz Frye ete ies > INAND w Tetoh = 5 NAND . Eo @cAe,o= ABTSC =M®+etVB ; Se pon % = W 7 SNAND w Telal = SNAND I@ Nor - Steps = @ Write in Pos BS Search foes hidden NOR ( Complement ® write Tas.cd ® Count fetal Nor—\ AND 3 GR—-»S FCA.B. C= £(0,3.4,5)= WC1,9,6,4 5 FAB.O= £042.69 = 100,3.4.5) * Hew Jo write FCA,B)@ = Fae T (0.33 = AB+ABR = (A+B) CA+B) ened ——_~— SOP Pos 0 = Bax + Gam be 1 As ihs 1—> Bax * BAB) = 20,2, 46) F,(a,3,c) = 2 (0.2.4,5,4) Finding ROR = » Fof, = = C2.3,4) in Jann & Re 2 NAND3 mulipicahen) “CXNOR 4 Tbhi fo ya Je 8 Po dat F & ya Jo ft, Faat FAR) Chapter -2.- Combinational Cie NAND/NoR veel = 5. C2 Wp) a a : KOY K: y HA | xy 4 D-* ey Cosy of prev stale & nly fox econ ga = Wo, t, D4 Mamajerity © Mojenty lp cit co i OyOr HA wa [ed nye Oy) 2 yer w(yOr) x ES = 2x +G@ow Coury <. B on T Wake QHA +1 0R De lp AY ruth plicabion Che, A NAND/NOR vse& (2 itp) | as] FA FS ar] FA PS os} FA $2 87 FR [Sa @ bg} by ba bo fo 4s, te |e feo [ews | fea [ee gc, |S mee ce Worst case delay = eet For + Fee) Last adder se bebe ti com + max (iss, kes) . Last ka sum, cary @ One_ bik A= Qo A y, CA>B) B-be YeC Acer 8 [— 4a (Ax@) oY o oO Oo T Y,Ar>8= A ACB Part, 8203 ° ole Yo(A6-1% ® Moth - bits ~ Sey A= 2006 B= babi be Yn %B) = (a.> ba) + (aa=b2) (a>b.) + (ap bay(a.zlb) (ae>by Gabe + @s Obs) (ab) + (a2 bs)(aeb.) (ass) de SBI = (03 B)= Otieot—--- + OP-1) GAT bata F | ge ne of bib nos a accesding> = Ne(A J i 3 Lew ilp enable Say fox A-B=C=1, Soy Fox A=B=C-0, ONLY 44=0 ONLY Yaet Rest ot =1 Rest at=O

You might also like