Scribd
Upload
37 views15 pages

Digital Electronics Fundamentals

The document covers the fundamentals of electronics, focusing on logic gates, Boolean algebra, and circuit design. It explains the representation of logic functions, the use of truth tables, and various laws of Boolean algebra, including DeMorgan's Theorem. Additionally, it discusses minimization techniques such as Karnaugh maps and provides examples for implementing and simplifying logic circuits.

Uploaded by

kipkemboiamon06
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
37 views15 pages

Digital Electronics Fundamentals

The document covers the fundamentals of electronics, focusing on logic gates, Boolean algebra, and circuit design. It explains the representation of logic functions, the use of truth tables, and various laws of Boolean algebra, including DeMorgan's Theorem. Additionally, it discusses minimization techniques such as Karnaugh maps and provides examples for implementing and simplifying logic circuits.

Uploaded by

kipkemboiamon06
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/ 15
Handout ital Electronics Fundamentals Topic vanes, + Can only take on 2 values, + In electronic circuits the two values can be represented by e., = High voltage fora 1 and Low vol + Note that since only 2 voltage levels are used, the circuits have greater immunity to electrical Logie Gates + Bas loi eit with one or mor inputs and one ouput ae known gates ding blocks inthe design of more complex digital logic circuits Reprsetng Lope Func + There are several ways of senting logic functions: + We will now describe commonly used gates Basic Gates Representation ‘Truth Table Name Mathematica Bactrieal AND F2AB=48 OR Feats ay at : AIF ora aber of ABLE Compound Gates 444 = oii NAND = Peat ona3 aT > 10/1 ay 11/0 ABLE oof - o1fo as i 1 ofo 1aifo ABLE oof o XOR Feawsnateas AS) o1fa ee al 1 ito ABLE . o-Of1 ee O10 a 2D fofs vali ‘Anew sof standard symbols was ntroduedin 1984 under EEE/ANSI Standard 91-1984, The logic symbols given under this standard re Being incresingly used now and hve even Stared aphetting the ‘mera published by manufacturer of dial integrated eeu > = ft . [eae Ola a { ff > = Pb D> o 3D om sop LD xvor We Boolean algebra * In this section we will introduce the lnws of Boolean algebra, We will then see how it can be ‘sed to design combinational logic circuits + Combinational lope circuits donot have an internal stored ate, i, they have no memory (Consequently the output i solely a funtion ofthe curent inputs Later, we will sudy cree ‘ving a stored internal state, Le, sequential lie circuits. RULES Commutative Law Proofs: ASB ferrule 10 AB= BA A+AB Associative Law AWB). diseibutive law A+(B+C)=(448)+0 Pict ABC) =(48)¢ A nile Distsibusve Law or A+aB (442)(A+8) catsbotive law 1 (448) eles ASB riled forrule 12 (4+2)(44C) AAS ACHBAYBC dstibutive law AFAC+BAtBC rle7 A(HC)+E4+20 desibutive law AN BAS EC ale? 10. A+AD=A ABA+BC riled 1 AtaB aan A(I+E)+2C detibutive law 12, (A48)(44C)=4480 AIBC rle2 DeMorgan's Taeoern AtBC mules AIO W = i+ B+04..48 TSBFOR FN 366 fer Consensus theorems Consearis Taorem AB+ac+ EC ABs IC+2C= A530 AB+3C+80(4+A) add the missing eral AB+AC+ABC+ABC distibutive law AB(LEC)+4C(142) eribu AB GACH male AB+AC rule 4 NB: AND les precedence weFOR,eg, a +ed (0) +(6 a Boolean algebra - Examples 1.Sbow ag+d=ab Gr b)=0.d-ab=0+a. 2.Show ar(abynerd GH db)= (era). (@+8)=L.(@4b=atb ab includes one instance ofeach variable (oF ts ion by cancelling terms inthis expanded + A useful technique isto expand each fem compliment. I ay be posible to simply the express form eg, o prove the absorption ule abSab take abta.b =a(b+5)=al Examples Simplify the expression, xy + J2+x2+xy2 xyztny.2+x patd.jatayetx Jat aye xyaty 2b fate je xye+2)+ 920+ 3) xydt Fz xyt ha DeMorgan’s Theorem eee ike be (0) a snpy cage al opto ORto AND (or 2 como mua oer od econ velco a+b+e4 mn EBEn abe... FFD FE™ DeMorgan’sin Gates + Toimplementibe function /*82¥6d we cn ute AND and OR ptes 4 However, sometimes we only wish to use NAND or NOR gates, since they are usually simpler and faster. To do this we can use ‘bubble’ logic =e =e Dye ‘Wat about hie gate? Detorgan says X +5) ‘See AND gates are ow NANG ost, ™ =—>-- 3>- ee : Do De De De Morgan's ‘Theorem vin Freed) i> =, =>, hee ens to cance nuenon of eee PUGUIL SCAT EQUUALESL a AD. OR ee Secret finery vance een cnt Stores gud aren cesta ae ‘erat can only take one oftwo values and cap only be operated upon (in combinations) by the two operations (AND and OR). veava -RSAL GATI niversal gues, asthe name suggests, ae gate from which any digital circuit ean be built, ‘These are the NAND and NOR gates. The reason they are universal is that Because any circuit can be dualled (by complementing all of the variables and swapping operators) then any gate ‘capable of being used (citer singly or in combinations of itself o implement either the AND or OR operation andthe NOT operator must be universal Example 35 ow can an AND gate be implemented from NOR gates? er a > a> Example 3.6 How an ¥=(A +B).Ce implemented only ffom NAND gates? 3 [> ¥ c c { > {207 pos [Revision questions 1L1 Use Boolean algebra to rigorously prove the second absorption law: As By=d 1.2 Use Boolean algebra and a truth table to rigorously prove the second ‘other identity’ : AXA B=A+B 1.3 The XOR function s usually expressed as: A@B=A-BLA-B {Use Boolean algebra to show that this expression is alo equivalent to: () FEB () (4+ B)-(A+B) (©) (4+ mB) Draw the loge required to directly implement (a). Derive the dual of this

You might also like