You are on page 1of 23
| Introduction e& Logic gates and its implement- ation Using Simulakosc 2alalzt Convesssion of binaxy code to goray code. 2elql21 -|envession ef gory code to binaxy code. zelal24 Implementation of hal addex uming Siroulat a Is{10(24 Implementation of dull addex using simulates 2ltol24 To study assay. multiplies | 2x2 bits lites To study aseray mult plier H 3X3 bits. 7 fal 21] Te Study Casuy Lock Ahead Addest 4 {i122 To study Haly - Subtsactos: i telt loz To study Ful- Subtsactos jilzl22, HNET Intstoduction to Logic goket and Rl" Tenp le mentatiot using simulakoo. Th = Fe OE Logic gates, perform basic logical E dunctions thar axe dendamertal +o dtgital Cistcuits,, Logic gates, 74a device that acts ah a building block qos digital cisrcults. Logic gates, ase Commonly used in integeaked cisccutts CC), Tt takes one oo mone input and only one output: Types af Gates— \) Bosic Gates — ) AND Gake — A ciscukt which pescdooims AND Opesotion %4 Showy T+ ha, neeZ2 Tnputs and one oakput Oukpuk CY) B oO 4 ° 41 4 by OR Gake- A choceutt which pexdosims OR Operation (2% shown . Tp has, n> =e) Tnpuks and one output: €) NOT Gate - Tt tot output {nvestes Obshenvatior A 4 2- Orivesmal @) NAN a Gat LF acti +Hee operation "and" Yc ovkput ig "qalse" ty A ¢ oie ce! iy beth Ineuks ane, thenwise the output fy “Yale " A B S- Advanced Gaks— @) XOR Gate - The exclusive ‘OR’ gate acty tn the Same way as logical ' etthen (oo! The output 13 'L' ty the inputs ane di{lerent but ‘0! fy one Topuks axe Same A (6) XNOR Gate- The exclusive ‘NOR! gate Ta Combination 'XoR' gate Arllowed by. an invesckes . T+, output (4 4! 14 the inpaty axe. #ame and ‘0! i4 the inputs ake ditescent, ® Retult- ntxoduced and iinplemented logic gates using Himulate a = Convession | binesy. code to Y Theo oy - A binany code sepsesents text computer Pxocetton Inatsuction, os Any other daky Ming 0 two - symbol system. The two -aymbol used Pate "0" and "1" doom the binasy Humbert Kystem- A Geay code if an encoding Q& amber, 40 Hate adyzacent pumbesy, have a single digit digering by 4! The Binary to gay code converte is a logical Cfo t treat 2 uted to convesct the binasy code, Tato T44 equivalent qexay code evasion G3 Go Gi= Ff Qe Ciocuit pia. ° ° ° Boy — AM the wreHwltt ao0 vestdied by simulatos,, “Convertor eh qoay e Theo Sq The goray to binaay cade convesdhed Th a” - logical cistcuit thak f, We to conved® that % Whe to convestt the qoay code into TH, equivalent Btnasay code. By the qollowing equation quoy code Can be convescted +o binascy code Equation - Regu - All the scequtts, ance veridied by simulating. implementation oe haly addes fed The halg - addex 144 combinational asdthmak® Cisteuit oo a basic building bleck 4 adding to Hembers af too Trputs and powducr aaam bt anda Kage Bit as the too oukp ats. Tt 14 a combinational logic cist auit which 1% designed by connecting one XOR' gate one ‘AND ' gate Eysation- Let tu20 Tnpukx be ‘A’ and! B! and Jum be represented by ‘S' and asiy by tC! S= A@B aan Chocukt — eeves Hald addesr cisccuit diagram Trout Table — Beene a Tapak ia Retwtt- All HBA O91e, vesitied by Simutatos, 2 Erle mentatTon af quill addes usie TREPSY — Full addesi 73 the adder which adds, thee | Tnpuks and pooduce, too output. The xtowt40o inputs 9KE A’ and 'B' and the died tneut 14 an nea BAKE AS C-IN The output consy is déaignated of Govt and the nosital output fy detignated oh ‘S' whieh 4 gum, Equation - A, 8 ond ¢ ane thee inputs and 'S'Ps sum ~ and Carcy 18 cassy gf the bits, S= (A@s) @ Conny = (@ kg) + Cox ‘A @B)) Circuit diagsiam Y AW addes Result — AU oe To Study assay mudi plier and ves t tt using Aimulako o. (2x2 Asoray Mult p' Theosy - An osray, mubkiplien 4 a digital combi — nakional cisccuit Wed for mubltel ying 420 binasy numbesy, by employing an asmay y gus adden and hald addesy . Equakion— Foo, 2X2 Away malt plter — by bo *% Qi Qo os C Do by obo Arby S3 Sa Arbo Si Giexcult’ Diogsam— | HA ea. r Cisceurt diag sam Y 2x2 anscay multiplies So So Ko Nap pies, and vesdtied Yt Watoo4 1m ad onsay m Stud using 3 Resutk — OOO a — Implementation of 32-bit multiplies Using sim ulako x. Theosy - Ary asay multi plies 13a digital combinskion Clacuit used {0% mulki plying two binasup humbesr by employing an aseuy ef halt -adden And yuh adden the maximum pswduct +estrn Cary be 71X71 =49 which 14 110001 , a G-bIt Rumbo Rowcedune — Suppose we have two decimal humbexs ‘Aland 'B' and theiac binasey ORE A214 4Ae And baz bir be sredpec Huely when we pooduct thee 3-bitt bfnasdies we get On oukpuk saute §% 6- bits, Such a% => AR a2,41,% S$ BA bz, bbe Psroduct AxXB =P Ps Pa, Ps Pe7Pi, Po en aan De oe be by bo Q2 bo Aibe Aebo Orb Ob, Geb neo. os = x Orbit Arbet ibe Qba- Ay bt GY5 by Co+ Oc bat a ci Ps Po laibe iad J Ly ib | cs ieee | J} Foll | | Addex | | | A FT | cq | | | | He | | | | | | | fs te | [| [re | es | es Using Simulako: 5 3 5 % 3 Y Z : te = To me duce the computation time ,thexe ane go add tus0 bingy numbed, by using Canouy lookahead added. They wok by Coating too Signals Pand G Known te be Casicuy Pero pagaton and Casey Generate: The Cansug Poropagates: 1% poropagated fo the next [evel wheneat He Cases genematrs is wed to qenesake the output casey > Sregacidlets ef input cosey . The block Aiogocam ef a 4.-bit Casisus Lockshead Addex 14 Shown hexe- The numbesx | gate Nevela fos the cass Pscopagation Can be dound {eromn the Cloxcait 4 {ail addes. The Bignal {scm Input Casisyy Cin to oukpot Casey Couk Kequisel an AND gate and an oR gate , Which constitutes two gate level. So fy these gmasy dsre fous, dull addesy in the pasrallel addesr the oukput Casisey Cs wowd have 2X4 =8 gate levels, decom Ci to Cs. Fos an H-bit pacalleh adden thene ase 2n gate levels te propagate thecugh. ee The cose, ponding beolean expocaisfoms axe giver, hese to corttourct a Cosisey. \ookalead addex « ln4he lookahead cimeutt we need to generate the tuo signals, Cay Propagatno< CP) and caoiouy qenexcatos, CG). Equatton— ate i= AL OB Gi= AX. Bi The ovtpuk Jorn and caswu, canbe exparetied ad, Sumi= POC ete = Git (P7.cr) clean qunetion oor the

You might also like