New challenges on Independent Gate FinFET Transistor Network Generation

Size: px
Start display at page:

Download "New challenges on Independent Gate FinFET Transistor Network Generation"

Transcription

1 Nw hllngs on Inpnnt Gt FinFET Trnsistor Ntwork Gnrtion Viniius N. Possni, Anré I. Ris, Rnto P. Ris, Flip S. Mrqus, Lomr S. Ros Junior Thnology Dvlopmnt Cntr, Frl Univrsity o Plots, Plots, Brzil Institut o Inormtis, Frl Univrsity o Rio Grn o Sul, Porto Algr, Brzil {vnpossni, lipm, lomrjr}@in.upl.u.r {nris, rpris}@in.urgs.r Astrt This ppr shows tht oul gt vis, lik inpnnt-gt (IG) FinFETs, hv introu nw hllngs in th trnsistor ntwork gnrtion stp uring th logi synthsis. Suh nw prigm points tht just to minimiz th mximum numr o litrls in Booln xprssion is not nough to hiv optimiz trnsistor ntworks. This wy, tritionl toriztion mthos or grph-s optimiztions my not usul to gnrt ntworks or oul gt vis. In this sns, this ppr prsnts two iint ltrntivs to xplor th nits o suh vis uring th trnsistor ntwork gnrtion. Th irst on monstrts two wys or toring Booln xprssions whih ontriut to rs th trnsistor ount. Through th propos toriztion, it is possil to hiv mor optimiz trnsistor rrngmnts ompr to othr toriztion thniqus vill in th litrtur. Th son ltrntiv propos hrin is grph-s mtho l to in promising rrngmnts to xplor th sprt gts o h IG FinFET. Th xprimnts monstrt tht th propos mtho n ru th numr o IG FinFETs ompr to th tritionl mthos o trnsistor ntwork gnrtion. Kywors FinFET; logi synthsis; toriztion; grph thory; trnsistor ntwork; logi gt; EDA. I. INTRODUCTION Although th ontinuous CMOS trnsistor sling hs n proviing prormn improvmnts o igitl iruits, its thnology pross s grt hllngs u to th vis shrinking n th unmntl mtrils limits [1]. Sin 2001, th Intrntionl Thnology Romp or Smionutors (ITRS) hs point th FinFET [2] n th UTB-SOI [3] s promising thnologis or trnsistor sling yon CMOS limits. In th lst yrs, irnt solutions o oul-gt (DG) vis wr propos [4-6]. In this work w hv spil intrst or DG FinFET vis, whih n sign in two irnt wys oring to th gt onigurtion. On possiility is to ining th two gts yiling singl-gt (SG) FinFET, s illustrt in Fig. 1(). This onigurtion is lso known s short-gt FinFET. Th othr on is to uil two inpnnt-gts (IG) FinFET, in suh wy tht h gt n ontroll y irnt input signl, s illustrt in Fig. 1(). Ths irnt onigurtions hv llow rih projt sp n introu nw hllngs to xplor oth in logi n physil synthsis. () () Fig. 1. In (), SG FinFET trnsistor n in () IG FinFET trnsistor. Looking or th IG FinFET strutur in Fig. 1(), it is possil to intiy tht prlll rrngmnt, i.. ( + ), n implmnt using th sprt gts o th trnsistor. Thus, rsrhrs hv osrv th possiility to mrg prlll trnsistors in IG FinFETs n ru th trnsistor ount in logi gts [7-9]. Furthrmor, som uthors introu th possiility o mrg sris trnsistors, i.. (. ), in n IG FinFET. It is on s on th thrshol work untion, whih will turn on th trnsistor (I on ) i n only i oth gts r in th on stt [10-12]. Othrwis, th urrnt is low nough to kp th trnsistor in th o stt (I o ). This wy, th mrg o sris n prlll trnsistors is powrul strtgy to rs th trnsistor ount in logi gts. In th rmining o this work th SG FinFET, th IG FinFET (prlll) n th IG FinFET (sris) will rprsnt y th nottions illustrt in Fig. 2(), Fig. 2() n Fig. 2(), rsptivly. It is importnt to mntion tht th ntworks n implmnt using only SG FinFETs or omining oth SG n IG FinFETs. gt sour rin gt1 sour rin gt2 () () () Fig 2. Dirnt FinFET rprsnttions: in () SG FinFET, in () IG FinFET (prlll) n in () IG FinFET (sris). Consiring th nw possiilitis provi y th FinFET thnology, svrl works vill in th litrtur r onrn to us it to sign si gts n othr w irnt Booln untions [7-12]. Rntly, som works hv prsnt novl solutions to implmnt lmntry gts s AND, NAND, OR n NOR, y mrging sris n prlll trnsistors using IG FinFETs [7-10][12]. Fig. 3() shows nw implmnttion or th 2-inputs NAND n Fig. 3() shows nw implmnttion or th 2-inputs NOR. Noti tht, h logi gt n implmnt using only two trnsistors. Morovr, som works hv lso synthsiz nhmrks iruits using suh novl gts s ll lirry.

2 Th xprimnts hv monstrt tht rs in th trnsistor ount through IG FinFETs is n iint wy to sv r n powr in igitl sign [9][12]. VDD GND () () Fig. 3. In (), 2-inputs NAND n in () 2-inputs NOR, otin y mrging sris trnsistors n prlll trnsistors in IG FinFETs. Thr r mny irnt mthos vill in th litrtur to rs trnsistor ount n to gnrt optimiz ntworks to implmnt logi gts [13-17]. Suh mthos r l to livr stistory solutions or singl gt vis, i.. onvntionl CMOS or SG FinFET. In gnrl, ths mthos im to minimizing th mximum numr o litrls in Booln xprssion y pplying toriztion [13-14] or grph-s optimiztions [15-17]. Tritionlly, minimiz th numr o litrls ls to ru trnsistor ntwork. It ours us thr is irt rltion twn litrls n trnsistors. In othr wors, h litrl in tor xprssion n irtly mpp to trnsistor in ntwork. This rltion lso hppns whn th litrls, rprsnt y gs in grph-s solution, r mpp to trnsistors in ntwork. Howvr, s prviously isuss, nw prigm hs n introu y mrging sris n prlll trnsistors using IG FinFETs. It impts in how to gnrt iint trnsistor rrngmnts uring th logi synthsis. Thus, whn th gol is to rs th trnsistor ount y using IG FinFETs, minimiz th numr o litrls in givn Booln xprssion my not riv to th st solution. It hppns us som runnt litrls, in tor xprssion or in grph-s solution, n ontriut to hiv th st sris n prlll mrging n to rs th totl numr o FinFETs in ntwork. Thror, s oth th onvntionl toriztion mthos n th grph-s thniqus im to minimiz th litrl ount, ths mthos [13-17] my not th st ltrntiv to gnrt IG FinFET trnsistor ntworks. Consiring tht th mrg o sris n prlll trnsistors in IG FinFETs hs om sil wy to ru r n powr onsumption in VLSI sign, it is xtrmly importnt to trmin n utomt mtho to in iint IG FinFET rrngmnts. To th st o our knowlg, thr is no work tht prsnts n utomt mtho l to xplor th potntil o DG vis. In this sns, this work prsnts n nlysis out th nw hllngs to implmnt Booln untions using IG FinFETs. This ppr lso VDD GND isusss how this nw prigm ts th implmnttion o Booln untions rom spil lsss lik r-on (RO) [18] n r-polrity-on (RPO) [19]. W r prsnting two ltrntiv wys or toring Booln xprssions, whih r l to livr optimiz IG FinFET rrngmnts ompos o wr trnsistors thn th toriztions prsnt in [12]. Finlly, w propos n ltrntiv mtho to utomtilly gnrt optimiz IG FinFET trnsistor ntworks. Th rmining o this ppr is orgniz s ollows. Stion II prsnts mor til nlysis out th nw hllngs n possiilitis tht th IG FinFET thnology provis. Stion III prsnts th propos ltrntivs or toring Booln xprssions. Th propos mtho to gnrt IG FinFET trnsistor ntworks is prsnt in Stion IV. Som xprimntl rsults n omprison r prsnt in Stion V. Finlly, onlusions r outlin in Stion VI. II. NEW CHALLENGES AND POSSIBILITIES This stion prsnts som xmpls tht monstrt how th mrg o sris n prlll trnsistors using IG FinFETs impts in th trnsistor ntwork gnrtion. Exmpl 1: Th irst intrsting point is tht two irnt tor orms, whih rprsnt th sm logi untion n r ompos o th sm numr o litrls, n rsult in trnsistor ntworks with irnt numr o vis. Thus, in orr to monstrt tht, lt us onsir th tor orms rprsnt y Eqution (1) n Eqution (2) in Tl I, oth ompos o 8 litrls. Whn onsiring singl gt vis, i.. onvntionl CMOS or SG FinFETs, ths tor orms n us to uil two irnt trnsistor ntworks, oth ompos o 8 vis. Howvr, whn onsiring th possiility to mrg sris n prlll trnsistor in IG FinFETs, it is possil to sv 2 trnsistors y using th Eqution (2) inst o th Eqution (1). Th trnsistor ntwork otin rom Eqution (1) is illustrts in Fig. 4() n th mor optimiz rrngmnt, otin rom Eqution (2), is illustrt in Fig. 4(). As n sn, it is iiult to trmin th st qution to us i onsiring only th litrl ount s mtri.!!!! () () Fig. 4. In (), trnsistor ntwork otin rom Eqution (1) n in () th mor optimiz solution otin rom Eqution (2).!!!!

3 TABLE I SOME FACTORIZED EQUATIONS. Litrl Count Ftor Form Eqution 8 litrls = ( + (. ( + ))). (! + (!. (! +!))) (1) 8 litrls = ((!. ). ( + )) + ((.!). (! +!)) (2) 14 litrls g = (! + ((! +!). ( + ( + )))). ((.!) + ((! + ). ( + (!. ( +!))))) (3) 15 litrls g = ((!. ). ((!. ) + (.!))) + ((!.!). ((!.!) + (. ))) + (!. (. )) (4) Exmpl 2: This son xmpl monstrts tht minimizing th numr o litrls in Booln xprssion my not l to th minimum numr o IG FinFETs. Lt us onsir th logi untion g, whih n tor o two irnt wys s prsnt in Eqution (3) n Eqution (4) in Tl I. Ths two tor orms n us to uil trnsistor ntworks ompos o singl gt vis. In this s, th ntworks otin rom Eqution (3) n Eqution (4) r ompos o 14 n 15 trnsistors, rsptivly. As xpt, th ntwork otin rom Eqution (3) will sv on trnsistor ompr to th ntwork otin rom Eqution (4). On th othr hn, whn onsiring vis lik IG FinFETs to implmnt th untion g, w hv th opposit. Noti tht, through th Eqution (3) it is possil to uil ntwork ompos o 9 trnsistors, s shown in Fig. 5(). Howvr, through th Eqution (4), it is possil to uil n iint rrngmnt using only 8 trnsistors, s show in Fig. 5(). In, th st input qution or singl gt vis my not th st nit qution or inpnnt gts vis n vi vrs.!!!!!! ()!!!!! Exmpl 3: Whn th gol is to minimiz th trnsistor ount, th non-sris-prlll (NSP) rrngmnts r sil wy to o tht [17]. In gnrl, th grph-s thniqus r l to in NSP rrngmnts whil th toriztion mthos r limit to SP rrngmnts. Thus, whn onsiring singl gt vis, th NSP rrngmnts n rsult in ntwork with th sm numr o trnsistors or with wr trnsistors thn th srisprlll (SP) ountrprt. Howvr, whn onsiring th mrg o sris n prlll trnsistors using IG FinFETs, in som ss, th SP rrngmnts n rsult in ntwork with wr trnsistors thn th NSP solution. To monstrt n instn o this prolm, lt us onsir th Eqution (5). This qution n tor rsulting in n xprssion ompos o 7 litrls, s prsnt in Eqution (6). h =.. +!. +.. (5) h =. ((.) + (.)) + (!.) (6) Suh tor orm n us to uil SP trnsistor ntwork with 7 singl gt vis, s shown in Fig. 6(). Anothr ltrntiv is to pply grph-s thniqu ovr th Eqution (5), rsulting in NSP trnsistor ntwork omprising 6 singl gt vis, s shown in Fig. 6(). Noti tht, th NSP rrngmnt ontriuts to rs th trnsistor ount. Thus, in irst nlysis w n lim tht th NSP solution is ttr thn th SP solution, onsiring SG FinFETs.!!!!!! () Fig. 6. Two possil solutions to implmnt th logi untion h using SG FinFETs: in () SP ntwork otin rom Eqution (6) n in () NSP ntwork otin through grph s thniqu. () () Fig. 5. Two possil solutions to implmnt th logi untion g using IG FinFET (sris) n IG FinFET (prlll): in () ntwork otin rom Eqution (3) n in () ntwork otin rom Eqution (4). Howvr, onsiring IG FinFETs, th sris trnsistors o th SP ntwork illustrt in Fig. 6() n mrg rsulting in th ntwork illustrt in Fig. 7(). Similrly, y mrging trnsistors in th NSP ntwork illustrt in Fig. 6(), it is possil to hiv th ntwork illustrt in Fig. 7(). As n sn, th NSP ntwork rsults in 5

4 trnsistors whil th SP ntwork ns only 4 trnsistors to implmnt th untion h. Thus, w hv osrv tht, in som ss, th NSP onigurtion prohiits th mrg o trnsistors. () Fig. 7. Two possil solutions to implmnt th logi untion h using IG FinFETs: in () SP ntwork otin rom Eqution (6) n in () NSP ntwork otin through grph s thniqu. Exmpl 4: This xmpl monstrts tht in som ss, th NSP rrngmnts still ing th st solution to minimiz trnsistor ount. For instn, lt us onsir th Eqution (7). By pplying toriztion thniqu ovr this qution w otin tor orm ompos o 10 litrls, s prsnt in Eqution (8). z = (7) z =. ( + (..)) +. ((. ) + + ) (8) Suh tor orm n irtly mpp to ntwork ompos o 10 singl gt vis, s shown in Fig. 8(). Howvr, whn pplying grph-s thniqu ovr th Eqution (7), it is possil to hiv n iint NSP rrngmnt with 7 trnsistors, s shown in Fig. 8().! () Fig. 8. Two possil solutions to implmnt th Eqution (7): in (), SP ntwork otin through toriztion thniqu n in (), NSP ntwork otin through grph-s thniqu. In this s, th gins otin y using th NSP rrngmnt rmin whn onsiring IG FinFETs. It is illustrt in Fig. 9() n Fig. 9(), whih prsnt th SP n NSP solutions, rsptivly. Noti tht th NSP rrngmnt is th st solution, kping rution o 2 trnsistors whn ompr to th SP implmnttion. () ()! () Fig. 9. Two possil solutions to implmnt th Eqution (6): in (), SP ntwork otin through toriztion thniqu n in (), NSP ntwork otin through grph-s thniqu. Th prvious xmpls hv monstrt, or gnrl Booln untions, th hllngs whn gnrting miniml trnsistor ntworks using th FinFET thnology. Howvr, th nxt xmpl ims to monstrt how IG FinFETs t th implmnttion o trnsistor ntworks riv rom spil Booln untions lsss lik r-on (RO) n r-polrity-on (RPO). A Booln untion is onsir RO i it n rprsnt in tor orm whr h vril pprs only on [18]. Th untion rprsnt y Eqution (9) is RO. () = ( + ). ((.) + ) (9) Similrly, Booln untion is onsir RPO i it n rprsnt in tor orm whr h polrity (positiv or ngtiv) o vril pprs t most on in th minimum tor xprssion [19]. Th untion rprsnt y Eqution (10) is RPO. = (!. + ). ( + ) (10) Funtions rom RO n RPO lsss r ttrtiv, spilly us th optimlity n gurnt or ths lsss. In othr wors, RO n RPO untions n lwys tor with th minimum numr o litrls. This wy, it is possil to gnrt iint trnsistor ntworks ompos o th minimum numr o singl gt vis. Howvr, whn onsiring oul gt vis, s IG FinFETs, ths lsss nnot gurnt th optimlity in trms o trnsistor ount uring th ntwork gnrtion. It ours u th sm t prsnt in th Exmpl 2, whr tor orm with th minimum numr o litrls os not livr th minimum ntwork. Thus, w hv osrv tht, lthough th inition o RO lss sys tht h vril must pprs on, in som ss, it is opportun to rpt som vrils in th tor xprssion in orr to hiv th st mrg o sris n prlll trnsistors in IG FinFETs. This osrvtion is lso vli or Booln untion rom RPO lss. Exmpl 5: For instn, lt us onsir th RO untion rprsnt y Eqution (11). This tor orm n us to uil th ntwork illustrt in Fig. 10(), whr h litrl prsnt in th xprssion ws irtly mpp to singl gt trnsistor in th ntwork. Anothr possiility is to uil ntwork using this tor orm n mrging sris n prlll trnsistors in IG FinFETs, rsulting in th ntwork illustrt in Fig. 10(). Howvr, th ntwork prsnt in Fig. 10() is not th st solution

5 in numr o trnsistors. Osrv tht, y rpliting th litrl in th tor orm o Eqution (11), it is possil to hiv th ntwork prsnt in Fig. 10(), whih svs on trnsistor ompr to th ntwork illustrt in Fig. 10(). = (. (. ( + ) + (.. g))) (11) g () g g () () () Fig. 11. Originl rrngmnt in (), ntwork otin y toring oring [12] in (), n th propos mrging in (). Th son toriztion thniqu prsnt in [12] ims to mp th originl rrngmnt, similr to tht illustrt in Fig. 12(), to mor iint ntwork. It is on y toring n mrging sris trnsistors (litrls), s shown in Fig. 12(). Agin, w hv osrv tht thr is nothr wy or toring th rrngmnt illustrt in Fig. 12(), rsulting in wr trnsistors thn th solution otin y toring oring to [12]. W monstrt it y mrging prlll trnsistors, s shown in Fig. 12(). () Fig. 10. In () SG FinFET implmnttion n in () IG FinFET implmnttion, oth otin rom th tor orm o Eqution (11). In () IG FinFET implmnttion otin y rpliting th litrl in th tor orm o Eqution (11). III. PROPOSED DEFACTORIZATION TECHNIQUE In t, th IG FinFET hs stlish innovtions n hllngs uring th trnsistor ntwork gnrtion. Consquntly, th rrngmnts livr y onvntionl thniqus, s on toriztion or grph optimiztions, my not usul nough to xplor th potntil o mrging sris n prlll trnsistors. In this sns, n ltrntiv is to pply toriztion thniqu ovr th tor orm. It ws irstly monstrt in [12], whr th uthors prsnt two wys or toring Booln xprssions. Th irst toriztion thniqu prsnt in [12] ims to mp tritionl rrngmnts, lik th ntwork illustrt in Fig. 11(), to n optimiz ntwork y toring n mrging prlll trnsistors (litrls), s shown in Fig. 11(). As n sn, it ls to rs th numr o trnsistors. Howvr, w hv osrv tht it my not th st solution in trms o trnsistor ount. Thus, whn thr is similr onigurtion to th illustrt in Fig. 11(), w propos th mrg o sris trnsistors, rsulting in th ntwork illustrt in Fig. 11(). Noti tht, y mrging sris trnsistors inst prlll ons, it ws possil to sv on trnsistor i ompr to th solution otin y toring oring to [12]. () () () Fig. 12. Originl rrngmnt in (), ntwork otin y toring oring [12] in (), n th propos mrging in (). Whn th purpos is to gnrt ru trnsistor ntworks y pplying toriztion thniqu, w suggst tht our two ltrntivs, illustrt in Fig. 11() n Fig. 12(), r us to rs th trnsistor ount. Howvr, inst o using toriztion thniqu, mor sophistit huristi n propos, it to ining th st mrg o sris n prlll trnsistors long o th optimiztion pross. This is rss in th nxt sssion. IV. PROPOSED METHOD TO GENERATE REDUCED IG FINFET TRANSISTOR NETWORKS Although it is possil to gnrt optimiz trnsistor ntworks y pplying th toriztion thniqu prsnt or, suh thniqu must ppli togthr with (or tr) tritionl toriztion mtho. It my omputtionl xpnsiv, onsiring th ost o toring ssoit to th ost o toring Booln xprssion. Bsis tht, th qulity o th inl solution is strongly pnnt o th ntwork prviously gnrt y th rsultnt Booln xprssion. Consiring this snrio, w propos n ltrntiv mtho tht tris to in th st ()

6 mrg o sris n prlll trnsistors uring th ginning o th optimiztion pross without prorming toriztions. This wy, it is possil to iintly xplor th sprt gts in IG FinFETs uring th ntwork gnrtion. Th propos mtho is ivi in thr stps n oprts ovr n irrunnt-sum-o-prouts (ISOP). Th irst stp (A), tris to in iint rrngmnts through grph-s strutur ll SP krnl, whih ws prviously prsnt in [17]. Th son stp (B), prsnts strtgy to prorm simpl toring oprtions onsiring som onstrints to mximiz th mrg o sris n prlll trnsistors. Finlly, th thir stp (C) is rsponsil or uiling th inl ntwork y omposing th SP krnls with th tor rrngmnts, whih wr otin uring th prvious stps. A. Sris-Prlll Krnl Finr Th SP krnls prsnt hr llows or iint rrngmnts with lrg shring twn th pths o th ntwork. Bsis tht, suh rrngmnts r promising to mrg in IG FinFETs. Ths, r two ttrtiv hrtristis tht ontriut to rs in th trnsistor ount. Th min i hin th SP krnls is to omin th us o th input ISOP, tking our thm t tim, in orr to uil n unirt grph whr th us r rprsnt through th vrtx n th gs rprsnt ommon litrl twn pir o us (vrtis). A SP krnl is trmin oring to th initions n rstritions prsnt low. For h omintion, th lgorithm slts our us omposing untion h tht is rprsnt y n ISOP orm. In squn, n unirt grph G = (V, E) is uilt, whr th vrtis in V = {v 1,v 2,v 3,v 4 } rprsnt irnt us in h, so V = 4. To nsur tht th otin grph is vli SP krnl, two ruls must hk: Rul 1 Lt E vi th st o gs tht r onnt to v i n E vi th numr o gs in this st. For h vrtx v i V, th st o litrls o v i (i.., litrls(v i )) must shr through th gs j E vi. This rul is stisi i n only i th ollowing qution rsults in th vlu 1: (( ) ) (12) Rul 2 Th grph G otin must isomorphi to th grph shown in Fig. 13(), rrr hrin s SP krnl. v 1 4 = v 4 v 1 1 = v 1 v 2 v 4 3 = v 3 v 4 2 = v 2 v 3 v 3 v () () () Fig. 13. SP krnl tmplt (), uxiliry tmplt grph () n rsulting trnsistor ntwork () Th SP krnl inr stp must pply som trnsormtions ovr th grph in orr to mp h krnl oun to swith ntwork. Thror, th irst stp onsists on mpping th krnl gs, illustrt in Fig. 13(), to n uxiliry tmplt grph pit in Fig. 13(). Atr, n g rorring routin is ppli ovr th uxiliry tmplt grph, moving th g 1 to th pl o 3, thus, th g 3 is mov to th pl o 2, n inlly, th g 2 is mov to th pl o 1. This g rorring rsults in th trnsistor ntwork illustrt in Fig. 13(). Through ths oprtions, it is possil to nsur tht h pth o th swith ntwork rprsnts u rom th untion h. Exmpl 6: In orr to monstrt how trnsistor ntwork is otin rom SP krnl, lt us onsir th krnl illustrt in Fig. 14(), whih ws otin rom th ollowing qution: = (13) Th g lls r mpp rom th krnl to th uxiliry grph shown in Fig. 14(). Consquntly, y pplying th g rorring ovr th uxiliry grph, th krnl oun is mpp to th trnsistor ntwork pit in Fig. 14(). Noti tht th uxiliry tmplt grph n th g rorring routin r nssry to implmnt th us rom Eqution (13) through th shring twn th pths o th ntwork. As n sn in Fig. 14(), th prlll trnsistors ( + ) n ( + ) n mrg in IG FinFETs (prlll), rsulting in ntwork with only two trnsistors. It is worth to mntion tht th SP krnl llows th gnrtion o ntworks with mor trnsistors thn this xmpl prsnt in Fig. 14, nling lso th mrg o sris trnsistors..... () () () Fig. 14. SP krnl () riv rom Eqution (13), uxiliry grph tmplt () n trnsistor ntwork () otin tr pplying th g rorring routin. B. IG FinFET Dit Ftoriztion This stp is rsponsil or toring th us rom th input ISOP in suh wy tht thr r t lst two litrls ommon to group o us. This onstrint ws opt in orr to prioritiz toriztions whih llow th mrg o two litrls in n IG FinFET n so, minimiz th us o SG FinFETs in th ntwork. Thus, th lgorithm uss tl to trmin th rltionship twn th us. This is monstrt in th ollowing xmpl. Exmpl 7: For instn, onsir th Booln untion sri y Eqution (14). =. +!..!.! (14)

7 Firstly, th lgorithm uils tl using th us n th vrils rom th input ISOP s prsnt in Fig. 15. Th ourrn o vril in th irt or omplmntry polrity is rprsnt y 1 n 0, rsptivly, in th tl. Thn, th nxt stp onsists o prorming srh ovr th tl in orr to in th wnt groups, lik this irl y sh lin in Fig. 15. Th i hin this group is to init tht thr r t lst two ommon litrls, i.. (. ), in u3 n u4. Thus, ths us will tor s ollow: (. ). ( + ). This lol toriztion n implmnt using only two IG FinFETs, on (sris) n on (prlll), s n sn in th ltmost rnh o th ntwork illustrt in Fig. 16. In squn, th rmining us, u1 n u2, whih not long to ny group, r implmnt s inpnnt rnhs using IG FinFETs (sris), s n sn in th rightmost rnhs o th ntwork illustrt in Fig. 16. Fig. 15. Cus rltionship to trmin groups tht shr t lst two litrls n rsult in th wnt toriztions. Noti tht, y opting toriztions with t lst two litrls, it ws possil to voi th shring o th litrl, whih pprs thr tims, s irl y ott lin in Fig. 15. Tritionl toriztion mthos tn to prorm th unwnt shring, rsulting in th ntwork illustrt in Fig. 17. As n sn in Fig. 16, th ntwork otin y th propos mtho svs on trnsistor i ompr to th onvntionl solution prsnt in Fig. 17. Fig. 16. Trnsistor ntwork livr y th propos mtho, otin rom Eqution (14). Fig. 17. Trnsistor ntwork livr y onvntionl mthos, otin rom Eqution (14). C. Ntwork Composition u u2!..!.! u u wnt wnt unwnt! unwnt As mntion or, this stp ims to ompos th SP krnls n th tor rrngmnts otin uring th prvious stps in orr to uil th inl ntwork. Thus,!!!!! suh ntwork n gnrt o irnt wys oring to th input ISOP: (i) ntwork n implmnt using on or mor SP krnl ssoit in prlll; (ii) ntwork n implmnt using on or mor SP krnls, ssoit in prlll to othr tor rrngmnt otin in th stp (B); (iii) no SP krnls r oun uring th stp (A), so, th ntwork is ompltly gnrt in th stp (B). Atr th ntwork ing gnrt y ssoiting th surrngmnts s prlll rnhs, th g shring thniqu prsnt in [16] is ppli ovr th ntwork. It is on in orr to prorm lol optimiztions n rmov som runnis, whih my vntully xist twn th SP krnls n th tor rrngmnts. An intrsting hrtristi o th propos mtho is tht, y pplying suh g shring thniqu in this lst stp, th mtho is l to in sris-prlll n lso non-srisprlll rrngmnts. As prsnt in th Exmpl 4, in som ss, it n ontriut to rs th trnsistor ount. In gnrl, th ntworks gnrt y th propos mtho tn to ompos only o sris-prlll rrngmnts. It is u to th t tht th stps (A) n (B) prou sris-prlll rrngmnts oming vry similr to th solution o onvntionl toriztion. V. RESULTS W hv implmnt th mtho propos in Stion IV n us two irnt sts o Booln untions in orr to vlut it. Th irst xprimnt ws prorm ovr th st o ll 5-inputs NPN-lss (ngtion-prmuttion-ngtion), whih is ompos o 616,126 untions. This st ws ppli to th propos mtho n lso to th most rnt pulish mthos o toriztion [14] n grph-s optimiztions [17]. Th son xprimnt ws prorm ovr th st o ll r-on untions with t most 6- inputs, whih is ompos o 456,772 untions. This st ws ppli to th propos mtho n to mtho it to r-on untions [18]. It is worth to rmmr tht ths mthos [14][17][18] wr sign or toring n gnrt ntworks onsiring only singl gt vis. Thus, w hv mrg sris n prlll trnsistors in orr to mp th originl rrngmnts livr y suh mthos to IG FinFETs trnsistor ntworks. This wy, it is possil to prorm ir omprison o th propos mtho with ths othr thniqus. Tl II prsnts th totl numr o trnsistors otin y h vlut mtho, whn onsiring th 5-inputs NPN-lss Booln untions. As n sn, th propos mtho ws l to minimiz mor trnsistors thn th othr thniqus. TABLE II TOTAL NUMBER OF TRANSISTORS FOR THE SET OF 5-INPUTS NPN-CLASS BOOLEAN FUNCTIONS. [14] [17] Propos Mtho Totl Numr o Dvis 7,350,852 8,037,628 6,843,272

8 Tl III prsnts th totl numr o trnsistors otin y h mtho, whn onsiring th st o 6-inputs ron untions. Agin, th propos mtho ws l to minimiz mor trnsistors thn th othr thniqu, whih is it to r-on untions. In othr wors, th mtho [18] lwys livrs th xt (minimum) solution whn onsiring singl gt vis. Howvr, not nsurs th optimlity or IG FinFETs. TABLE III TOTAL NUMBER OF TRANSISTORS FOR THE SET OF 6-INPUTS READ-ONCE FUNCTIONS. [18] Dit to R-On Propos Mtho Totl Numr o Dvis 1,760,248 1,714,131 In, th propos mtho is n ltrntiv wy to gnrt IG FinFET trnsistor ntworks, ing l to rs th trnsistor ount y iintly xploring oul gt vis. It is worth to mntion tht th propos mtho prsnt in this work only xplors som hrtristis tht n l to ru trnsistor ntwork implmnttion. W hv intii tht, in som ss, th propos mtho livrs solutions with n ovrh o trnsistors whn ompr to th tritionl thniqus. Ths ss will rully invstigt in th utur in orr to improv th propos thniqu. VI. CONCLUSIONS This ppr hs prsnt til isussion out nw hllngs on IG FinFET trnsistor ntwork gnrtion. Through th xmpls n rsults prsnt in this work it ws possil to intiy tht th tritionl mthos or gnrting trnsistor ntworks my not th st ltrntiv to uil ntworks s on IG FinFETs. Thus, this ppr hs prsnt two possiilitis to improv th ntwork sign. Th irst on is s on toriztion thniqu, whih llow th gnrtion o mor optimiz rrngmnts whn ompr to rlt works. Th son on is grph-s mtho l to in su-rrngmnts tht mk sil th mrg o sris n prlll trnsistors in IG FinFETs. Th prliminry otin rsults hv monstrt tht th propos mtho is sil ltrntiv. ACKNOWLEDGMENT Rsrh prtilly support y Brzilin uning gnis CAPES, CNPq, FAPERGS unr grnt 11/ (Pronm), n th Europn Community's Svnth Frmwork Progrmm unr grnt Synpti. REFERENCES [1] Frnk, E. J., Dnnr, R. H., Nowk, E., Solomon, P. M., Tur, Y. n Wong, H.-S. P. Dvi sling limits o Si MOSFETs n thir pplition pnnis, Pro. IEEE, 89(3): , Mr [2] Hung, X., L, W., Kuo, C., Hismoto, D., Chng, L., Kzirski, J., Anrson, E., Tkuhi, H., Choi, Y., Asno, K., Surmnin, V., King, T., Bokor, J., Hu, C. "Su 50-nm FinFET: PMOS," Thnil Digst. Intrntionl Eltron Dvis Mting (IEDM '99), pp , [3] Choi, Y., Jon, Y., Rn, P., Tknuhi, H., King, T., Bokor, J., Hu, C. "30 nm ultr-thin-oy SOI MOSFET with sltivly posit G ris S/D, in Pro. 58th DRC Dvi Rsrh Conrn, Jun 2000, pp [4] Chng, L., Choi, Y., H, D., Rn, P., Shiying, X., Bokor, J., Hu, C. n King, T. J. Extrmly sl silion nno-cmos vis, Pro. IEEE, vol. 91, no. 11, pp , Nov [5] Nowk, E. J., Allr, I., Luwig, T., Kim, K., Joshi, R. V., Chung, C. T., Brnstin, K. n Puri, R. Turning silion on its g, IEEE Ciruits Dvis Mg., vol. 20, no. 1, pp , Jn./F [6] Roy, K., Mhmooi, H., Mukhophyy, S., Anthn, H., Bnsl, A. n Ckii, T. Doul-gt SOI vis or low-powr n highprormn pplitions, in Pro. IEEE Int. Con. CAD (ICCAD 2005), pp [7] Ching, M., Kim, K., Trtz, C. n Chung, C. Novl High-Dnsity Low-Powr Logi Ciruit Thniqus Using DG Dvis, IEEE Trnstions on Eltron Dvis, Vol. 52, No. 10, pp , Ot [8] Dtt, A., Gol, A., Ckii, R. T., Mhmooi, H., Lkshmnn, D. n Roy, K. "Moling n Ciruit Synthsis or Inpnntly Controll Doul Gt FinFET Dvis," IEEE Trnstions on Computr-Ai Dsign o Intgrt Ciruits n Systms, Vol. 26, No. 11, pp , Nov [9] Muttrj, A., Agrwl, N., Jh, N. K. "CMOS logi sign with inpnnt-gt FinFETs," in Pro. 25th Int. Con. on Computr Dsign (ICCD 2007). pp [10] Ching, M., Kim, K., Chung, C. n Trtz, C."High-Dnsity Ru-Stk Logi Ciruit Thniqus Using Inpnnt-Gt Controll Doul-Gt Dvis," IEEE Trnstions on Eltron Dvis, Vol. 53, No. 9, pp , Sp [11] Wng, M. C. "Inpnnt-Gt FinFET Ciruit Dsign Mthoology," Intrntionl Journl o Computr Sin, Vol. 37 Issu 1, pp. 50, Mr [12] Rostmi, M. n Mohnrm, K. "Dul-Vth Inpnnt-Gt FinFETs or Low Powr Logi Ciruits," IEEE Trnstions on Computr-Ai Dsign o Intgrt Ciruits n Systms, Vol. 30, No. 3, pp , Mr [13] Sntovih, E., t l. SIS: A systm or squntil iruit synthsis. Thnil Rport No. UCB/ERL M92/41, EECS Dprtmnt, Univrsity o Cliorni, Brkly, [14] Mrtins, M. G. A., D Ros Junior, L. S., Rsmussn, A., Ris, R. P. n Ris, A. I. Booln Ftoring with Multi-Ojtiv Gols, in Pro. 28th Int. Con. on Computr Dsign (ICCD 2010), p [15] Kgris, D. n Hniotkis, T. A Mthoology or Trnsistor- Eiint Suprgt Dsign, IEEE Trns. on Vry Lrg Sl Intgrtion (VLSI) Systms, p , [16] Possni, V. N., Souz, R. S., Domingus Junior, J. S., Agostini, L. V., Mrqus, F. S. n D Ros Junior, L. S. Optimizing Trnsistor Ntworks Using Grph-Bs Thniqu, Journl o Anlog Intgrt Ciruits n Signl Prossing (ALOG), My 2012, v. 73, p , [17] Possni, V. N., Cllgro, V., Ris, A. I., Ris, R. P., Mrqus, F. S. n D Ros Junior, L. S. Improving th Mthoology to Buil Non-Sris-Prlll Trnsistor Arrngmnts, in Pro. 26th Symp. on Intgrt Ciruits n Systms Dsign (SBCCI 2013), pp [18] Golumi, M. C., Mintz, A. & Rotis, U. (2008). An improvmnt on th omplxity o toring r-on Booln untions, Disrt Appli Mthmtis, 156(10), [19] Cllgro, V., Mrtins, M. G. A., Ris, R. P. & Ris, A. I. R- Polrity-On Funtions, in Pro. 26th Symp. on Intgrt Ciruits n Systms Dsign (SBCCI 2013), pp. 1-6.

Present state Next state Q + M N

Present state Next state Q + M N Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I

More information

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not

More information

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140

More information

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon

More information

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology! Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik

More information

1 Introduction to Modulo 7 Arithmetic

1 Introduction to Modulo 7 Arithmetic 1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w

More information

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely . DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,

More information

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013 CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or

More information

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o

More information

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)

More information

Seven-Segment Display Driver

Seven-Segment Display Driver 7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on

More information

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1. Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y

More information

Constructive Geometric Constraint Solving

Constructive Geometric Constraint Solving Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC

More information

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

CSC Design and Analysis of Algorithms. Example: Change-Making Problem CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =

More information

Garnir Polynomial and their Properties

Garnir Polynomial and their Properties Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,

More information

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt

More information

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs. Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,

More information

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018 CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs

More information

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht

More information

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1 CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml

More information

ECE 407 Computer Aided Design for Electronic Systems. Circuit Modeling and Basic Graph Concepts/Algorithms. Instructor: Maria K. Michael.

ECE 407 Computer Aided Design for Electronic Systems. Circuit Modeling and Basic Graph Concepts/Algorithms. Instructor: Maria K. Michael. 0 Computr i Dsign or Eltroni Systms Ciruit Moling n si Grph Conptslgorithms Instrutor: Mri K. Mihl MKM - Ovrviw hviorl vs. Struturl mols Extrnl vs. Intrnl rprsnttions Funtionl moling t Logi lvl Struturl

More information

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s? MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth

More information

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl

More information

CS 241 Analysis of Algorithms

CS 241 Analysis of Algorithms CS 241 Anlysis o Algorithms Prossor Eri Aron Ltur T Th 9:00m Ltur Mting Lotion: OLB 205 Businss HW6 u lry HW7 out tr Thnksgiving Ring: Ch. 22.1-22.3 1 Grphs (S S. B.4) Grphs ommonly rprsnt onntions mong

More information

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson

More information

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h

More information

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem) 12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr

More information

CS 461, Lecture 17. Today s Outline. Example Run

CS 461, Lecture 17. Today s Outline. Example Run Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h

More information

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl

More information

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata A 4-stt solution to th Firing Squ Synhroniztion Prolm s on hyri rul 60 n 102 llulr utomt LI Ning 1, LIANG Shi-li 1*, CUI Shung 1, XU Mi-ling 1, ZHANG Ling 2 (1. Dprtmnt o Physis, Northst Norml Univrsity,

More information

EE1000 Project 4 Digital Volt Meter

EE1000 Project 4 Digital Volt Meter Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s

More information

0.1. Exercise 1: the distances between four points in a graph

0.1. Exercise 1: the distances between four points in a graph Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in

More information

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes. Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right

More information

Planar Upward Drawings

Planar Upward Drawings C.S. 252 Pro. Rorto Tmssi Computtionl Gomtry Sm. II, 1992 1993 Dt: My 3, 1993 Sri: Shmsi Moussvi Plnr Upwr Drwings 1 Thorm: G is yli i n only i it hs upwr rwing. Proo: 1. An upwr rwing is yli. Follow th

More information

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008 Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is

More information

12. Traffic engineering

12. Traffic engineering lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}

More information

A Low Noise and Reliable CMOS I/O Buffer for Mixed Low Voltage Applications

A Low Noise and Reliable CMOS I/O Buffer for Mixed Low Voltage Applications Proings of th 6th WSEAS Intrntionl Confrn on Miroltronis, Nnoltronis, Optoltronis, Istnul, Turky, My 27-29, 27 32 A Low Nois n Rlil CMOS I/O Buffr for Mix Low Voltg Applitions HWANG-CHERNG CHOW n YOU-GANG

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook

More information

(a) v 1. v a. v i. v s. (b)

(a) v 1. v a. v i. v s. (b) Outlin RETIMING Struturl optimiztion mthods. Gionni D Mihli Stnford Unirsity Rtiming. { Modling. { Rtiming for minimum dly. { Rtiming for minimum r. Synhronous Logi Ntwork Synhronous Logi Ntwork Synhronous

More information

Problem solving by search

Problem solving by search Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming

More information

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f

More information

COMP108 Algorithmic Foundations

COMP108 Algorithmic Foundations Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht

More information

CS September 2018

CS September 2018 Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o

More information

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem) 4/25/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 2 Eulr s rig prolm

More information

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA. S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn

More information

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2 Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny

More information

Trees as operads. Lecture A formalism of trees

Trees as operads. Lecture A formalism of trees Ltur 2 rs s oprs In this ltur, w introu onvnint tgoris o trs tht will us or th inition o nroil sts. hs tgoris r gnrliztions o th simpliil tgory us to in simpliil sts. First w onsir th s o plnr trs n thn

More information

A Graph-Based Synthesis Algorithm for AND/XOR Networks 1. Yibin Ye Kaushik Roy. a minimum ESOP of a function except for those with

A Graph-Based Synthesis Algorithm for AND/XOR Networks 1. Yibin Ye Kaushik Roy. a minimum ESOP of a function except for those with A Grph-Bs Synthsis Algorithm or AND/XOR Ntworks Yibin Y Kushik Roy Shool o Eltril n Computr Enginring Puru Univrsity, Wst Lytt, IN 4797-285, USA Abstrt In this ppr, w introu Shr Multipl Root XORbs Domposition

More information

Numbering Boundary Nodes

Numbering Boundary Nodes Numring Bounry Nos Lh MBri Empori Stt Univrsity August 10, 2001 1 Introution Th purpos of this ppr is to xplor how numring ltril rsistor ntworks ffts thir rspons mtrix, Λ. Morovr, wht n lrn from Λ out

More information

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas SnNCutCnvs Using th Printl Stikr Funtion On-o--kin stikrs n sily rt y using your inkjt printr n th Dirt Cut untion o th SnNCut mhin. For inormtion on si oprtions o th SnNCutCnvs, rr to th Hlp. To viw th

More information

Section 10.4 Connectivity (up to paths and isomorphism, not including)

Section 10.4 Connectivity (up to paths and isomorphism, not including) Toy w will isuss two stions: Stion 10.3 Rprsnting Grphs n Grph Isomorphism Stion 10.4 Conntivity (up to pths n isomorphism, not inluing) 1 10.3 Rprsnting Grphs n Grph Isomorphism Whn w r working on n lgorithm

More information

Reducing the Depth of Quantum Circuits Using Additional Circuit Lines

Reducing the Depth of Quantum Circuits Using Additional Circuit Lines Ruing th Dpth of Quntum Ciruits Using Aitionl Ciruit Lins Nil Assi 1, Rort Will 1,2, Mthis Sokn 1,2, n Rolf Drhslr 1,2 1 Institut of Computr Sin, Univrsity of Brmn Group of Computr Arhittur, D-28359 Brmn,

More information

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk Grphs & Grph Algorithms Ltur CS Spring 6 Announmnts A6 rls toy: Risk Strt signing with your prtnr sp Prlim usy Not grphs hs r Grphs K 5 K, =...not th kin w mn, nywy Applitions o Grphs Communition ntworks

More information

Register Allocation. How to assign variables to finitely many registers? What to do when it can t be done? How to do so efficiently?

Register Allocation. How to assign variables to finitely many registers? What to do when it can t be done? How to do so efficiently? Rgistr Allotion Rgistr Allotion How to ssign vrils to initly mny rgistrs? Wht to o whn it n t on? How to o so iintly? Mony, Jun 3, 13 Mmory Wll Disprity twn CPU sp n mmory ss sp improvmnt Mony, Jun 3,

More information

5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem

5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem Thorm 10-1: Th Hnshkin Thorm Lt G=(V,E) n unirt rph. Thn Prt 10. Grphs CS 200 Alorithms n Dt Struturs v V (v) = 2 E How mny s r thr in rph with 10 vrtis h of r six? 10 * 6 /2= 30 1 Thorm 10-2 An unirt

More information

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation A Simpl Co Gnrtor Co Gnrtion Chptr 8 II Gnrt o for singl si lok How to us rgistrs? In most mhin rhitturs, som or ll of th oprnsmust in rgistrs Rgistrs mk goo tmporris Hol vlus tht r omput in on si lok

More information

Designing A Concrete Arch Bridge

Designing A Concrete Arch Bridge This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr

More information

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12 Aministrivi: CS61B Ltur #33 Autogrr will run this vning. Toy s Rings: Grph Struturs: DSIJ, Chptr 12 Lst moifi: W Nov 8 00:39:28 2017 CS61B: Ltur #33 1 Why Grphs? For xprssing non-hirrhilly rlt itms Exmpls:

More information

Clustering Techniques for Coarse-grained, Antifuse-based FPGAs

Clustering Techniques for Coarse-grained, Antifuse-based FPGAs Clustring Thniqus or Cors-grin, Antius-s FPGAs Chng-woo Kng n Mssou Prm Astrt In this ppr, w prsnt r n prormn-rivn lustring thniqus or ors-grin, ntius-s FPGAs. A mro logi ll in this lss o FPGAs hs multipl

More information

35 th Design Automation Conference Copyright 1998 ACM

35 th Design Automation Conference Copyright 1998 ACM Eint Booln ivision n Sustitution Shih-Chih Chng vi Ihsin Chng pt. o CS n IE Ntionl Chung Chng Univrsit Ultim Intronnt Th. Chi-Yi, TAIWAN, ROC Sunnvl, CA 94086 Astrt Booln ivision, n hn Booln sustitution,

More information

Multipoint Alternate Marking method for passive and hybrid performance monitoring

Multipoint Alternate Marking method for passive and hybrid performance monitoring Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro

More information

GREEDY TECHNIQUE. Greedy method vs. Dynamic programming method:

GREEDY TECHNIQUE. Greedy method vs. Dynamic programming method: Dinition: GREEDY TECHNIQUE Gry thniqu is gnrl lgorithm sign strtgy, uilt on ollowing lmnts: onigurtions: irnt hois, vlus to in ojtiv untion: som onigurtions to ithr mximiz or minimiz Th mtho: Applil to

More information

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality: CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt

More information

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017 MAT3707/201/1/2017 Tutoril lttr 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Smstr 1 Dprtmnt o Mtmtil Sins SOLUTIONS TO ASSIGNMENT 01 BARCODE Din tomorrow. univrsity o sout ri SOLUTIONS TO ASSIGNMENT

More information

Outline. Binary Tree

Outline. Binary Tree Outlin Similrity Srh Th Binry Brnh Distn Nikolus Austn nikolus.ustn@s..t Dpt. o Computr Sins Univrsity o Slzur http://rsrh.uni-slzur.t 1 Binry Brnh Distn Binry Rprsnttion o Tr Binry Brnhs Lowr Boun or

More information

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths. How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0

More information

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r

More information

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Similarity Search. The Binary Branch Distance. Nikolaus Augsten. Similrity Srh Th Binry Brnh Distn Nikolus Augstn nikolus.ugstn@sg..t Dpt. of Computr Sins Univrsity of Slzurg http://rsrh.uni-slzurg.t Vrsion Jnury 11, 2017 Wintrsmstr 2016/2017 Augstn (Univ. Slzurg) Similrity

More information

Graph Contraction and Connectivity

Graph Contraction and Connectivity Chptr 17 Grph Contrtion n Conntivity So r w hv mostly ovr thniqus or solving prolms on grphs tht wr vlop in th ontxt o squntil lgorithms. Som o thm r sy to prllliz whil othrs r not. For xmpl, w sw tht

More information

Section 3: Antiderivatives of Formulas

Section 3: Antiderivatives of Formulas Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin

More information

Register Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012

Register Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012 Rgistr Allotion W now r l to o rgistr llotion on our intrfrn grph. W wnt to l with two typs of onstrints: 1. Two vlus r liv t ovrlpping points (intrfrn grph) 2. A vlu must or must not in prtiulr rhitturl

More information

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion

More information

Fundamental Algorithms for System Modeling, Analysis, and Optimization

Fundamental Algorithms for System Modeling, Analysis, and Optimization Fundmntl Algorithms for Sstm Modling, Anlsis, nd Optimiztion Edwrd A. L, Jijt Rohowdhur, Snjit A. Sshi UC Brkl EECS 144/244 Fll 2011 Copright 2010-11, E. A. L, J. Rohowdhur, S. A. Sshi, All rights rsrvd

More information

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This

More information

OpenMx Matrices and Operators

OpenMx Matrices and Operators OpnMx Mtris n Oprtors Sr Mln Mtris: t uilin loks Mny typs? Dnots r lmnt mxmtrix( typ= Zro", nrow=, nol=, nm="" ) mxmtrix( typ= Unit", nrow=, nol=, nm="" ) mxmtrix( typ= Int", nrow=, nol=, nm="" ) mxmtrix(

More information

Liqiong Wei, Zhanping Chen, and Kaushik Roy. Yibin Ye and Vivek De. logic circuits more feasible.

Liqiong Wei, Zhanping Chen, and Kaushik Roy. Yibin Ye and Vivek De. logic circuits more feasible. _ Mix-V th (MVT) CMOS Ciruit Dsin Mthooloy or Low Powr Applitions Liqion Wi, Zhnpin Chn, n Kushik Roy Shool o Eltril n Computr Eninrin Puru Univrsity, W. Lytt, IN 47907-1285 Yiin Y n Vivk D Intl Corp.,

More information

a b v a v b v c v = a d + bd +c d +ae r = p + a 0 s = r + b 0 4 ac + ad + bc + bd + e 5 = a + b = q 0 c + qc 0 + qc (a) s v (b)

a b v a v b v c v = a d + bd +c d +ae r = p + a 0 s = r + b 0 4 ac + ad + bc + bd + e 5 = a + b = q 0 c + qc 0 + qc (a) s v (b) Outlin MULTIPLE-LEVEL LOGIC OPTIMIZATION Gionni D Mihli Stnfor Unirsit Rprsnttions. Tonom of optimition mthos: { Gols: r/l. { Algorithms: lgri/booln. { Rul-s mthos. Empls of trnsformtions. Booln n lgri

More information

Steinberg s Conjecture is false

Steinberg s Conjecture is false Stinrg s Conjtur is als arxiv:1604.05108v2 [math.co] 19 Apr 2016 Vinnt Cohn-Aa Mihal Hig Danil Král Zhntao Li Estan Salgao Astrat Stinrg onjtur in 1976 that vry planar graph with no yls o lngth our or

More information

NP-Completeness. CS3230 (Algorithm) Traveling Salesperson Problem. What s the Big Deal? Given a Problem. What s the Big Deal? What s the Big Deal?

NP-Completeness. CS3230 (Algorithm) Traveling Salesperson Problem. What s the Big Deal? Given a Problem. What s the Big Deal? What s the Big Deal? NP-Compltnss 1. Polynomil tim lgorithm 2. Polynomil tim rution 3.P vs NP 4.NP-ompltnss (som slis y P.T. Um Univrsity o Txs t Dlls r us) Trvling Slsprson Prolm Fin minimum lngth tour tht visits h ity on

More information

Announcements. These are Graphs. This is not a Graph. Graph Definitions. Applications of Graphs. Graphs & Graph Algorithms

Announcements. These are Graphs. This is not a Graph. Graph Definitions. Applications of Graphs. Graphs & Graph Algorithms Grphs & Grph Algorithms Ltur CS Fll 5 Announmnts Upoming tlk h Mny Crrs o Computr Sintist Or how Computr Sin gr mpowrs you to o muh mor thn o Dn Huttnlohr, Prossor in th Dprtmnt o Computr Sin n Johnson

More information

Exact Template Matching Using Boolean Satisfiability

Exact Template Matching Using Boolean Satisfiability 2013 IEEE 43r Intrntionl Symposium on Multipl-Vlu Logi Ext Tmplt Mthing Using Booln Stisfiility Nil Assi Mthis Sokn Rort Will Rolf Drhslr Institut of Computr Sin, Univrsity of Brmn, 28359 Brmn, Grmny Cyr-Physil

More information

Properties of Hexagonal Tile local and XYZ-local Series

Properties of Hexagonal Tile local and XYZ-local Series 1 Proprtis o Hxgonl Til lol n XYZ-lol Sris Jy Arhm 1, Anith P. 2, Drsnmik K. S. 3 1 Dprtmnt o Bsi Sin n Humnitis, Rjgiri Shool o Enginring n, Thnology, Kkkn, Ernkulm, Krl, Ini. jyjos1977@gmil.om 2 Dprtmnt

More information

MULTIPLE-LEVEL LOGIC OPTIMIZATION II

MULTIPLE-LEVEL LOGIC OPTIMIZATION II MUTIPE-EVE OGIC OPTIMIZATION II Booln mthos Eploit Booln proprtis Giovnni D Mihli Don t r onitions Stnfor Univrsit Minimition of th lol funtions Slowr lgorithms, ttr qulit rsults Etrnl on t r onitions

More information

Self-Adjusting Top Trees

Self-Adjusting Top Trees Th Polm Sl-jsting Top Ts ynmi ts: ol: mintin n n-tx ost tht hngs o tim. link(,w): ts n g twn tis n w. t(,w): lts g (,w). pplition-spii t ssoit with gs n/o tis. ont xmpls: in minimm-wight g in th pth twn

More information

Solutions to Homework 5

Solutions to Homework 5 Solutions to Homwork 5 Pro. Silvia Frnánz Disrt Mathmatis Math 53A, Fall 2008. [3.4 #] (a) Thr ar x olor hois or vrtx an x or ah o th othr thr vrtis. So th hromati polynomial is P (G, x) =x (x ) 3. ()

More information

Layout Decomposition for Quadruple Patterning Lithography and Beyond

Layout Decomposition for Quadruple Patterning Lithography and Beyond Lyout Domposition for Qurupl Pttrning Lithogrphy n Byon Bi Yu ECE Dprtmnt Univrsity of Txs t Austin, Austin, TX i@r.utxs.u Dvi Z. Pn ECE Dprtmnt Univrsity of Txs t Austin, Austin, TX pn@.utxs.u ABSTRACT

More information

Layout Decomposition for Triple Patterning Lithography

Layout Decomposition for Triple Patterning Lithography Lyout Domposition or Tripl Pttrning Lithogrphy Bi Yu, Kun Yun, Boyng Zhng, Duo Ding, Dvi Z. Pn ECE Dpt. Univrsity o Txs t Austin, Austin, TX USA 7871 Cn Dsign Systms, In., Sn Jos, CA USA 9514 Emil: {i,

More information

Multi-Section Coupled Line Couplers

Multi-Section Coupled Line Couplers /0/009 MultiSction Coupld Lin Couplrs /8 Multi-Sction Coupld Lin Couplrs W cn dd multipl coupld lins in sris to incrs couplr ndwidth. Figur 7.5 (p. 6) An N-sction coupld lin l W typiclly dsign th couplr

More information

An Efficient FPGA Implementation of the Advanced Encryption Standard Algorithm G. Mohan 1 K. Rambabu 2

An Efficient FPGA Implementation of the Advanced Encryption Standard Algorithm G. Mohan 1 K. Rambabu 2 IJSRD - Intrntionl Journl or Sintii Rsrh & Dvlopmnt Vol., Issu, ISSN (onlin): - An Eiint FPGA Implmnttion o th Avn Enryption Stnr Algorithm G. Mohn K. Rmu M.Th Assistnt Prossor Dprtmnt o Eltronis n ommunition

More information

RAM Model. I/O Model. Real Machine Example: Nehalem : Algorithms in the Real World 4/9/13

RAM Model. I/O Model. Real Machine Example: Nehalem : Algorithms in the Real World 4/9/13 4//3 RAM Mol 5-853: Algorithms in th Rl Worl Lolity I: Ch-wr lgorithms Introution Sorting List rnking B-trs Bur trs Stnr thortil mol or nlyzing lgorithms: Ininit mmory siz Uniorm ss ost Evlut n lgorithm

More information

arxiv: v1 [cs.ar] 11 Feb 2014

arxiv: v1 [cs.ar] 11 Feb 2014 Lyout Domposition or Tripl Pttrning Lithogrphy Bi Yu, Kun Yun, Boyng Zhng, Duo Ding, Dvi Z. Pn ECE Dpt. Univrsity o Txs t Austin, Austin, TX USA 7871 Cn Dsign Systms, In., Sn Jos, CA USA 9514 Emil: {i,

More information

Computational Biology, Phylogenetic Trees. Consensus methods

Computational Biology, Phylogenetic Trees. Consensus methods Computtionl Biology, Phylognti Trs Consnsus mthos Asgr Bruun & Bo Simonsn Th 16th of Jnury 2008 Dprtmnt of Computr Sin Th univrsity of Copnhgn 0 Motivtion Givn olltion of Trs Τ = { T 0,..., T n } W wnt

More information

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1 Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):

More information

XML and Databases. Outline. Recall: Top-Down Evaluation of Simple Paths. Recall: Top-Down Evaluation of Simple Paths. Sebastian Maneth NICTA and UNSW

XML and Databases. Outline. Recall: Top-Down Evaluation of Simple Paths. Recall: Top-Down Evaluation of Simple Paths. Sebastian Maneth NICTA and UNSW Smll Pth Quiz ML n Dtss Cn you giv n xprssion tht rturns th lst / irst ourrn o h istint pri lmnt? Ltur 8 Strming Evlution: how muh mmory o you n? Sstin Mnth NICTA n UNSW

More information

Design Optimization Based on Diagnosis Techniques

Design Optimization Based on Diagnosis Techniques Dsign Optimiztion Bs on Dignosis Thniqus Anrs Vnris Mgy S. Air Irhim N. Hjj Univrsity of Toronto Motorol Univrsity of Illinois ECE Dprtmnt 77 W. Prmr ECE Dprtmnt n CSL Toronto, ON M5S 34 Austin, T 78729

More information

Register Allocation and Binding for Low Power. Jui-Ming Chang and Massoud Pedram. function of signal statistics and correlations, and hence is

Register Allocation and Binding for Low Power. Jui-Ming Chang and Massoud Pedram. function of signal statistics and correlations, and hence is Rgistr Allotion n ining or Low Powr Jui-Ming hng n Mssou Prm Dprtmnt o Eltril Enginring-Systms Univrsity o Southrn liorni Los Angls, A 989 Astrt This ppr sris thniqu or lulting th swithing tivity o st

More information

Aquauno Video 6 Plus Page 1

Aquauno Video 6 Plus Page 1 Connt th timr to th tp. Aquuno Vio 6 Plus Pg 1 Usr mnul 3 lik! For Aquuno Vio 6 (p/n): 8456 For Aquuno Vio 6 Plus (p/n): 8413 Opn th timr unit y prssing th two uttons on th sis, n fit 9V lklin ttry. Whn

More information