Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
0 ratings
0% found this document useful (0 votes)
19 views
15 pages
Ade Unit 1 Notes (P.J)
Electrical Engg #st sem
Uploaded by
akshaymohitkar01
AI-enhanced title
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
Download
Save
Save ADE UNIT 1 NOTES (P.J) (1) (1) For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
0 ratings
0% found this document useful (0 votes)
19 views
15 pages
Ade Unit 1 Notes (P.J)
Electrical Engg #st sem
Uploaded by
akshaymohitkar01
AI-enhanced title
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
Carousel Previous
Carousel Next
Download
Save
Save ADE UNIT 1 NOTES (P.J) (1) (1) For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
Download now
Download
You are on page 1
/ 15
Search
Fullscreen
q p = PRATIK TaWnALe| USES Design of Combinahonal Crews Boolean Algebra | Loge Gates) Symbol | expression — © Not _Goete © Ecok Gote R & = ye Ae + AS Y= A@B @ Ex-Noe Gateelasemste, Ls LS ————x—x—= bl |} Postutades —— ~ @ || Associvtive law: CAB)+C = As CBs) i ov CATWITC = A+(ErQ) a @ || Commutwive lav | Ax&Q = 6¥*A © | Bistibutive law i As(¥-c) = CA¥8) + (A*C) || Basic TReovems and —_ prapevtes of Baoleen Algebra Duality = E é slap GAA According to the duhity — theavern the following Conversions ave posible in a given | Baolean expression. HD Chonye each AND operahun am 0 operation. | | b> Chenge ¢ och ok operak han AND aperahon. | > Complement any oy 0 apreering sin ve the expression, Fo eg Oval of ACBA OC) = AB LAG At Coc) = GtB)s CA tcy i| Bas _Theoverns ‘Ano Low =o [Daa=n DAR-=A |DAR=0 ! | 7 oR Laws | = | —Sipio = A l2>ata 2a |[D>AdAzalD AMR=a | I ¥ [De Movgan's —Theoverns | Theoyern = 2 | AB=A+B CNAND= Bubbled a2) This theoreny states thd the, comeemen} oh a product is equal +a additon of the complement. :) ] Progh = 7 Trodh Table - | A_| 8 | AB | ° QO 1 { 9 ! \ | ' 0 \ ie 9° | Re > ATS PEELE Dp,if a0 __ |] Treorem 2- FMB = Ard (Noe = Bubbied AND) This Hheovem States had NOR gate = is equal be bubbled AWD Sade Prov} - Trath Toble- In [ ame | ALS | AB One| Oe eee ean \ Ho al) 0 1a 0 ly to oO on 0 [4 ! 0 ol 4 ° Pe = AB & |] Combmatonal — Civeuits ap The output of combmahonal civews} any inshiat of Hme j depends —anty on the levels present of input terminals athe Combinational civewits da nal use any memory rene Hhe__previows Stade ol inpat doesnot hove ony effect on tne Prevent stake yh tre Cyt YP combinational cvadt isa Uegic ceawh, Phe outpar ok which depends ony oan the Combinativas of _ inpuds. Tien hove ne at puts foe af cubpub,\ | For eg Adders Subliochuyy | Comporatoy, Excoden, a Decoders , Multiplerers | ean ook ORE I Comic vy 2 owowk pe ce Crews} ae) Tr —T | 31s %. 9 of) Fay | | tr | ys AB tac 48 [ ort is im the frm af sum of three termi Ag Ac 8 Be with each individual dem iS Produck [of hwo Variables Lb Thevetoye such expressions ave known af _ exP¥ession in So? form. {| Product ob the Sum (P05) form: | a 1 I Y= Care) + (BtO+ Caro) a zh is in the form of product of three fermy Cpat®> 7. Cate) CAC) with each teym is Hin the Form of Sum of two _ Variables i 4 sun expressions ove Sad ta be in Me Product | OF Sums CPOE farm. || 4(Stndevd or Cananital Soh 127 Far. | eee | ~_||Sof - > ARL+ALT 4ABC _. Coop) . | ASB ee R AtBe CK At BAECs ~ [Ron inp Complemen ted Juncomplemented Fay, Br a¥ |] Concepls of Munley Maxtor a Minto ~ — Each individual term inthe Standard So? form | is Called as minty _ | —_ [forego ABE + ABC + Fee / I = = a : | cach individual tevm ! i is called —_ miateve [Maxterm, Each individual tewm in the Shandoyd P03 form scaled as maxteym, For eg > (A+R>« CAtB> Ad —S each individual tern is cabled moxteyen Metnads __to_simplify the Basleon _Fanchong x} Kornmough -Mup Simplification + This is another SimpliBeahon — techniqu ety veduce the Baoleen _ equahm Tr overcomes ol) the __ digadvonhyes of tht Aycbyal — simplificnbun technique k moe iS a graphical method OF simplifying & Boolean equabian The infermahon contained in a twth Able ay Ovailuble tn the So? ey P08 farm Con _be yepresenttd aw ak mop: \c-mup Can be written — fy veh € Voyivb\esAy|| Kamap_ Sucre = | —W2 vornble _ K=mue | Zed con Cal 0 a | 1 —T — EAB ove the mph oy _vanebles [ pet a ove He Volue of A ow 8 | PE tnside the 4 betes we hove te enter the |= : Volwes ob ¥ ie owe | 13 K- mo 4" | oe hmDshLDr HNow — gytycode, | \ 9 | i 1 | | I TUR Hare varioble emer consists of 8 bores! WThe pasikens of — Vorrables AB) G ove interchangable | 4A Nownuble = mar 1 fe ao 0) V1 10 i a | eo au i : | AN | He lo | A a Vomuble K~Prop consists od UC baie | Weel ‘ |“Simplificahaw of Baoleun _Exevessiams using YeMap Woy of grouping Leuns Qvods & achets) __| DiPovs = A syoup of twa adjacen) Ts or 9's is | Caled os a PAY i; | | Quad~ A group of fay Odyaten) TS oy 04 is q Called as a quad ; a Ack -- A group af eight) adyacent a's ov O's ig called as octet _Summory of Rules Followed fuy k= Mp _ Simolificah un * D|LNo zevay allowed 2] No diagonals DI Only power of 2 numbey of cells ith Coch gyoup. 3 Grovps should be as lovge 0S passable S| Every one must be in at leask one group. Q} Overlapping — allawed- Di Wisp oveund allowed 3] Fewest numbev of — gyaups pasaible. ¥ |] Don't Cove Condihons, . Some Funchony the outputs Corvespanding hh trhun Combinahons ot input Vovjables da act Mmattey. That means fey Such inpat —cambinahony ik dere nah mother oshether Hae value oof) atput iso oy a Tn sud sithahm we ove Fre fo assume g O oy 2 % Wp for each Such inpud Combinaheee | r These condihons ave Keown as the Pon'} Cave LL. Hf condibons ond in dre Kemop dy yepracenticd LI . xe ie \\ i Os Yess) marl im the lovvespanding ce 4 — rh = | __* I] Bicadvamboges of k= Map Technique | 2 al r] ft TH w& & Manual — technique: WE anol use | Computers Sy ke Map — Saludian a Minimization iy extvemely Complicated if the [Dumber of voriubles is more than 6 to The simolificakon pracess depends — heavily on the | Skills ond ——_abilikes ok the Wey 1 I | “| |] | || Binary Adders. at Holy Adder at FA Adder ef] Holl “Addeie Al Halk addey ic & _ Combinahoral logit Ceait wth tuo inputs and two gttputs juhich — Cevvies owt addihon of fee single bid numbers Tris civui} hos two ortpuly namely “Scary! & “sunt! | tne nalf addey veut is supposed ta add two | singe bit binavy numbers A & & | | Can) A eS en Pee SUMS LT Coutputd 3 — bs eyo | Blecle dieg. slam| Taputts Owtputs | Tn Te s [ec \ jO | 9 o | 0 oem \ 8 [i |o fa yo | | Q \ } JK _mup . I Fav Sum Fu Coy | h \&S a \e lols | o fo : mn Sa i S= FB + Ag c= Ag | s= Aree 7) 2 Sum = Corry | Disadvantages of olf Addey | HN half adder con add Ae 2R ec. Rot Me addin. of nex! bibs yvequiyes | fre addi of A 1B, 2 OG ; The addikow of fryer bik is nel pasible fa Perm by using a half adder. Produce So |x |) Fall Addey [Fall addey is _a_thvee input vo output iC | combinational logic ciycuit which con add thee | || single bils applied fat its inp ts produce’ | Sam & Corry oudoudy: Th cow odd te one- bik numbrys Ah BOB cerry Cn The full addey is a Hee input & haw otrtpud — Cambmobi onal civcuut: TF. vercome the dvowbacle of Halt Adbey Civcu a Ssinge biy adder civewst called Full Addey is | | developed ITY con add two ane pik numbeys A EB Cony Sin th i re Ee cowtpub) { Copa) & —— Mider cevy Gd | aa i Blade Aiog vom, Treats Sudputy 4 “A | & [Gn & Se 4 To Lolo . ¢ al o | oft t Q 0° i 9 \ 0 oli! ° ) ! | 1 1 [.o | 0 \ 0 I 0 ! 9 1 ; 1 0 0 ’ \ \ \ 1 \classrante, : oe Fay (ary A Ve Fe CG 1 a |o|olft||o a jol|G aii C= Bc + AB + AC C CAG tay + CCAR 4 AB) CRB + ABD +o Cw tad) Leb BR +AB =H Se oe ce i S = ASLOL | Logic Dis.gxo vn Ac~_¥ || Encodevs = peeea Encodey is a ~cambinak onal Gywuih whi is || designed to Pevduvm the invevse _oPevalton of | the dewdey An encoder has A number oh __ ing byes & pombe oh ouput hives = An Crcodey produces an mM bit _dinay code | | CoryesPonding the bid digitul Number , epplicd } ot ts input | | — -— 3 Hl digon 7 Encoder (steals Tines “fi = vy | Bloc divgvam _ch_on encoder t | Al Tre _entodey accepts ow input digital wovd and TV converts ak inte on. im bid another _digitel word. Fox example a BCD number applied at He inpul con be Converted inte a binovy number oat the owpat The imlomal —combinakonal civeuit of the encoder & [designed accardinglyA 1 clhssiste, % |] Decoder. IA decoder isa Combinational ciyait | with WWoinpuls and be a meoximum 2" oudpuls Frol ove velaled fy cath _othey_with_o Cerin we i cee [— | Sop ae Pecadey Fo |S onto = Pr) | 1 tt Block _dbegvomn of _detod ev | I I Decoder is dential to a _demulbelexey without [rang dehy inpuds T+ Pevforme operations Which ave exadly oppasite tr Mose of on _ encadey ] Typical appliiatons Cade | Gnvertess a Bot Severn Seg- disploy Nive habe decoders. Reloy _actuahers- J * Z_*o 4 ine Decoder: Ed. 7 a4 Dy 3B ine p. decoder LS py Tclassmate, Truth table be L Inputs Qutpats | & |e | dol | be | 0 | _ o | 6 \ o | 0 9 \ Gna Onl 0 | \ Q ol] o 1 |oo jut oo 9 U | Logic div gro A 8 =a RG Os) t Be Cp > | J *e Cor) == RE (Pay v Sindy a 32% lime devadev con be designed.
You might also like
unit 1 deco
PDF
No ratings yet
unit 1 deco
27 pages
DE.Ch-01&02SN
PDF
No ratings yet
DE.Ch-01&02SN
11 pages
Module 1
PDF
No ratings yet
Module 1
40 pages
D.E module-2
PDF
No ratings yet
D.E module-2
21 pages
MDC 2
PDF
No ratings yet
MDC 2
13 pages
DC Unit2
PDF
No ratings yet
DC Unit2
56 pages
Dpco Unit1
PDF
No ratings yet
Dpco Unit1
42 pages
DELD assignment
PDF
No ratings yet
DELD assignment
22 pages
unit 3 ds
PDF
No ratings yet
unit 3 ds
17 pages
5 - DD - All Module DD Notes
PDF
No ratings yet
5 - DD - All Module DD Notes
93 pages
DLCD Lab Practical File
PDF
No ratings yet
DLCD Lab Practical File
33 pages
Unit III
PDF
No ratings yet
Unit III
42 pages
Digital Logic Design: Dr. Kenneth Wong
PDF
100% (1)
Digital Logic Design: Dr. Kenneth Wong
36 pages
Ddco Module 1 Jitd
PDF
No ratings yet
Ddco Module 1 Jitd
53 pages
Digital Electronics Notes
PDF
No ratings yet
Digital Electronics Notes
132 pages
STLD. unit 2 part2
PDF
No ratings yet
STLD. unit 2 part2
42 pages
FEDE Unit 2 Chapter-1 Notes
PDF
No ratings yet
FEDE Unit 2 Chapter-1 Notes
21 pages
CAO UNIT-3
PDF
No ratings yet
CAO UNIT-3
65 pages
DocScanner 30 Dec 2024 8-16 am
PDF
No ratings yet
DocScanner 30 Dec 2024 8-16 am
173 pages
Module03-Canonical Standard Forms
PDF
No ratings yet
Module03-Canonical Standard Forms
33 pages
Adobe Scan Aug 01, 2023
PDF
No ratings yet
Adobe Scan Aug 01, 2023
22 pages
digital electronics
PDF
No ratings yet
digital electronics
36 pages
CA Unit 3 (Data Representation)
PDF
No ratings yet
CA Unit 3 (Data Representation)
23 pages
Tutorial Merged
PDF
No ratings yet
Tutorial Merged
16 pages
Adder enhancement techniques
PDF
No ratings yet
Adder enhancement techniques
20 pages
DENotes
PDF
No ratings yet
DENotes
76 pages
Digital network
PDF
No ratings yet
Digital network
70 pages
Module04-Combinational Logic
PDF
No ratings yet
Module04-Combinational Logic
24 pages
Imgtopdf 0302221148045
PDF
No ratings yet
Imgtopdf 0302221148045
18 pages
Digital System and Design
PDF
No ratings yet
Digital System and Design
19 pages
Unit II
PDF
No ratings yet
Unit II
37 pages
UNIT 2
PDF
No ratings yet
UNIT 2
53 pages
DL
PDF
No ratings yet
DL
42 pages
DLC 3rd and 4th Units
PDF
No ratings yet
DLC 3rd and 4th Units
35 pages
Compiler Design - Unit 5
PDF
No ratings yet
Compiler Design - Unit 5
34 pages
DLD UNIT 2
PDF
No ratings yet
DLD UNIT 2
16 pages
Theory of Computation
PDF
No ratings yet
Theory of Computation
17 pages
Digital Electronics Course Gate Insights Version Cse
PDF
No ratings yet
Digital Electronics Course Gate Insights Version Cse
81 pages
Module 2 PDF
PDF
No ratings yet
Module 2 PDF
32 pages
Digital Electronics Max Notes
PDF
No ratings yet
Digital Electronics Max Notes
28 pages
Chapter-05 Arithmetic And Logic Instructions
PDF
No ratings yet
Chapter-05 Arithmetic And Logic Instructions
12 pages
DLCO Unit-3(1)_merged
PDF
No ratings yet
DLCO Unit-3(1)_merged
34 pages
COD Unit 2 (A)
PDF
No ratings yet
COD Unit 2 (A)
7 pages
ADIC Unit II notes (part I) (1)
PDF
No ratings yet
ADIC Unit II notes (part I) (1)
8 pages
3 - Digital Electronics-1-1 - Made Easy Notes Latest
PDF
No ratings yet
3 - Digital Electronics-1-1 - Made Easy Notes Latest
134 pages
Lecture - Note - 2for Computer Design Lesson
PDF
No ratings yet
Lecture - Note - 2for Computer Design Lesson
6 pages
Logic Gates and Boolean Function
PDF
No ratings yet
Logic Gates and Boolean Function
18 pages
Module 3 LSD
PDF
No ratings yet
Module 3 LSD
59 pages
Digital Day 3
PDF
No ratings yet
Digital Day 3
27 pages
Digital Logic Short NOTES
PDF
No ratings yet
Digital Logic Short NOTES
18 pages
1200 Chapter 2
PDF
No ratings yet
1200 Chapter 2
75 pages
De Assignment
PDF
No ratings yet
De Assignment
12 pages
7 Uhjj
PDF
No ratings yet
7 Uhjj
11 pages
Digital Electronics Fundamentals
PDF
No ratings yet
Digital Electronics Fundamentals
15 pages
DLD-Online-2 about digital logic good notes
PDF
No ratings yet
DLD-Online-2 about digital logic good notes
8 pages
116295
PDF
No ratings yet
116295
16 pages
Digital Day 4
PDF
No ratings yet
Digital Day 4
24 pages
Cbca202 Unit1
PDF
No ratings yet
Cbca202 Unit1
39 pages
Holiday Homework
PDF
No ratings yet
Holiday Homework
4 pages