Liqiong Wei, Zhanping Chen, and Kaushik Roy. Yibin Ye and Vivek De. logic circuits more feasible.
|
|
- Colleen Fowler
- 5 years ago
- Views:
Transcription
1 _ 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 Yiin Y n Vivk D Intl Corp., Hillsoro, OR Astrt Dul thrshol thniqu hs n propos to ru lk powr in low volt n low powr iruits y pplyin hih thrshol volt to som trnsistors in non-ritil pths, whil low-thrshol is us in ritil pth(s) to mintin th prormn. Mix-Vth (MVT) stti CMOS sin thniqu llows irnt thrshols within loi t, thry inrsin th numr o hih thrshol trnsistors ompr to th t-lvl ul thrshol thniqu. In this ppr, mthooloy or MVT CMOS iruit sin is prsnt. Dirnt MVT CMOS iruit shms r onsir n thr lorithms r propos or th trnsistorlvl thrshol ssinmnt unr prormn onstrints. Rsults init tht MVT CMOS sin thniqu n provi out 20% mor lk rution ompr to th orrsponin t-lvl ul thrshol thniqu. 1 Introution Th inrsin n or low powr in portl omputin n wirlss ommunition systms is mkin sin ommunitis pt low volt CMOS prosss [1, 2]. With th lowrin o supply volt, th trnsistor thrshol volt (Vth) hs to sl own to mt th prormn rquirmnts. Unortuntly, suh slin inrss th suthrshol lk urrnt, thry inrsin lk powr. Multipl-Vth sin thniqu n us to l with th lk prolm in low powr n hih prormn pplitions. Multi-Thrshol-Volt CMOS (MTCMOS) iruit thnoloy ws propos y insrtin hih thrshol vis in sris to norml iruitry [3]. This thniqu is vry tiv or th stny lk powr rution. But th lr insrt MOSFETs inrss th r n ly. For ul thrshol sin thniqu, hih thrshol volt n ssin to som trnsistors in non-ritil pths so s to ru lk urrnt, whil th prormn is mintin u to th low thrshol trnsistors in th Aknowlmnt: This rsrh is support in prt y DARPA (F C-1625), NSF CAREER wr ( MIP), Smionutor Rsrh orportion (98-HJ-638), n Intl. Prmission to mk iitl/hropy o ll or prt o this work or prsonl or lssroom us is rnt without provi tht opis r not m or istriut or proit or ommril vnt, th opyriht noti, th titl o th pulition n its t ppr, n noti is ivn tht opyin is y prmission o ACM, In. To opy othrwis, to rpulish, to post on srvrs or to ristriut to lists, rquirs prior spii prmission n/or. DAC 99, Nw Orlns, Louisin () 1999 ACM /99/06..$5.00 ritil pth(s). Thror, oth hih prormn n low powr n hiv simultnously. This thniqu hs n monstrt tht lk powr n ru urin oth tiv n stny mos without ny ly n r ovrhs [5]. Rntly, ul-vth MOSFET pross ws vlop [4], mkin th implmnttion o ul-vth loi iruits mor sil. Howvr, u to th omplxity o th iruits, not ll th trnsistors in non-ritil pths n ssin hihr thrshol volt. Othrwis, som non-ritil pths my om ritil. In orr to hiv th st lk svins unr prormn onstrints, lorithms or ul thrshol ssinmnt wr prsnt in [5, 7]. But ths lorithms only lt with th iruits t th t-lvl th trnsistors within t wr ssum to hv th sm thrshol volt. For mix-vth (MVT) CMOS iruits, th trnsistors within t n hv irnt thrshol volts with rtin pross onstrints. Thror, mor trnsistors n ssin hih-vth, n hn, lrr lk urrnt rution n hiv. In this ppr, irnt MVT CMOS iruit shms r introu n svrl lorithms or MVT CMOS iruit sin r prsnt. Th iny o h lorithm is monstrt y xprimnts on 32-it r n som ISCAS nhmrk iruits. Th ppr is orniz s ollows. In Stion 2, nssry nitions r introu. Dirnt MVT CMOS iruit shms r propos in Stion 3. Stion 4 sris thr lorithms or MVT CMOS iruit sin. Stion 5 prsnts th implmnttion tils n xprimntl rsults. Finlly, onlusions r ivn in Stion 6. 2 Prliminris Lt us onsir Fiur 1. Th loi ts r lrly mrk in irls. Suppos t G is th on in nlyz. GIi n GO r th nin n nout ts o G, whr i vris rom 1 to th numr o nins (FI) n vris rom 1 to th numr o nouts (FO). Eh nin t GIi onnts to pir o trnsistors (pi ;ni) in t G or stnr CMOS implmnttion. Similrly, or h nout t, thr r pir o trnsistors (p ;n) rivn y t G. 2.1 Trnsistor-lvl stti timin nlysis Trnsistor-lvl stti timin nlysis is us in our lorithms. Eh trnsistor hs proption ly, whih n
2 GI i xprss y p i G n i o p GO n Fiur 1: An xmpl iruit shmti t = tintrinsi + toutput CL (1) whr tintrinsi n toutput r th intrinsi ly n th ly pr unit lo, rsptivly. Thy n xtrt rom SPICE simultions [6]. CL is th lo pitn, whih is th sum o nout t pitns. Inrsin th thrshol volt will inrs t. Th irn twn hih-vth ly n low-vth ly is rprsnt y t. For th primry inputs n primry outputs, thr r timin onstrints. Eh primry input (PI) hs n rrivl tim. For th primry output (PO), thr is rquir tim. For h t G, th rrivl tim t th input o G is th tim whn th sinl propts rom th primry input to th input o G. Th prtur tim o G is th sum o th rrivl tim n th ly o th orrsponin trnsistor. Oviously, th rrivl tim is trmin y th prtur tim o th orrsponin nin t. Thr r two kins o prtur tim. On is or th hih-to-low trnsition t th output, not y Tl (G). Th othr orrspons to th low-to-hih trnsition t th output, rprsnt y Tlr(G). Tlr n Tl r trmin y th p pull-up tr n th n pull-own tr o G, rsptivly. For stnr CMOS iruits, thy n xprss y th ollowin qutions, Tlr(G) = mxtl (GIi)+t(pi) i (2) Tl (G) = mxtlr(gii)+t(ni) i (3) whr i vris or ll th nins. I GIi is primry input, its ly is 0. Hn, th prtur tim quls to th rrivl tim. 2.2 Trnsistor ly slk Th slk is th mount y whih t or trnsistor n slow own without tin th iruit prormn. For loi t, th slks o th p pull-up tr n th n pull-own tr r rprsnt y Sp n Sn, rsptivly. For primry output PO, th slk is trmin y th irn twn th rquir tim n th prtur tim o its n-in t. For ny othr t G, Sp n Sn n xprss y Sp(G) = min Sn(GO)+Tl (GO), Tlr(G), t(n) (4) Sn(G) = min Sp(GO)+Tlr(GO), Tl (G), t(p) (5) whr vris or ll th nout o G. Sn(GO) n Sp(GO) r th slks o th pull-own tr n pull-up tr or th nout t GO. Tl (GO),Tlr(G),t(n) n Tlr(GO), Tl (G), t(p) r th mounts y whih th p pull-up tr n pull-own tr o t G n slow own without tin th prtur tim o nout t GO, rsptivly. Sp(G) n Sn(G) r tkn s th minimum vlu ovr ll th nout ts so s to mintin th prormn. For h trnsistor pir (pi; ni) in t G, thir slks n rprsnt s s(pi) n s(ni), s(pi) = Sp(G) +(Tlr(G), Tl (GIi), t(pi)) = min s(n)+(tlr(g), Tl (GIi), t(pi)) (6) s(ni) = Sn(G) +(Tl (G), Tlr(GIi), t(ni)) = min s(p)+(tl (G), Tlr(GIi), t(ni)) (7) whr Sp(G) (Sn(G)) is th slk o th p pull-up tr (n pull-own tr) o G, whih is th miniml trnsistor slk ovr ll th nout FETs (FETs). Th trms (Tlr(G),Tl(GIi),t(pi)) n (Tl (G),Tlr(GIi),t(ni)) r th mounts y whih trnsistor pi n ni n slow own without tin th prtur tim o t G, rsptivly. I th thrshol volt is inrs rom low-vth to hih-vth, t will inrs y t, n thror, th trnsistor ly slk will ru y t. As lon s th slk vlu is no lss thn 0, whih mns t is no lrr thn th slk vlu, th iruit prormn is not r. 2.3 Trnsistor priority From BSIM MOS trnsistor mol [8], th suthrshol lk urrnt o MOSFET n mol s W Isu = 0 Cox ( kt ) 2 1:8 L q q n 0 kt (V GS,V th ) (1,,qV DS kt ) (8) whr Cox is th t oxi pitn pr unit r. W n L r th tiv hnnl with n th tiv hnnl lnth, rsptivly. 0 is th zro is moility. n 0 is th suthrshol swin oint o th trnsistor. Forlow-Vth trnsistor, i its thrshol volt is inrs to hih-vth vlu, th lk rution is proportionl to th tiv hnnl with n th moility. Thror, w n th lk rution msur or trnsistor i s ollows, lki = W i i (9) whr is th normliz moility, whih is qul to p n n 1 or trnsistors n trnsistors, rsptivly. p n n r th hol moility n ltron moility, rsptivly. Th lk rution msur o ul-vth iruit, not y M lk, is n s M lk = X i lki (10) whr th summtion is tkn ovr ll th hih-vth trnsistors in th ul-vth iruit. Th lrr th vlu o M lk, th mor lk rution n hiv or ul-vth iruit, ompr to th orrsponin sinl low thrshol iruit. For h trnsistor, lrr lk is prrl or lrr lk rution. Consir th hih-vth ly n low- Vth ly irn (t). I it is smll, lr numr o
3 trnsistors n ssin th hih thrshol unr prormn onstrints, thry lin to mor svins in lk powr. In our nlysis, w n th priority o trnsistor i s ollows, priority(i) = lki t i (11) Clrly, trnsistor with lrr priority will rsult in mor lk rution. 3 Mix-Vth (MVT) CMOS Ciruit Shms In this stion, irnt mix-vth iruit topolois r prsnt. Lt us rst onsir Fiur 2 whih illustrts smll prt o sinl-vth iruit. Suppos tht th trnsistors in th squrs r th trnsistors in th ritil pths, n hn, n hv low-vth. For th othr trnsistors, hih-vth n ssin without rin th prormn. Trnsistor in ritil pth Fiur 2: sinl-vth iruit Fiur 4: MVT1 shm Fiur 3: DVT shm Fiur 5: MVT2 shm Consir th t-lvl ul-vth (DVT) iruit. All th trnsistors within t hv th sm thrshol volt. Th ts r ithr ll hih-vth or ll low-vth ts. Fiur 3 shows th t-lvl ul-vth shm o th xmpl iruit shown in Fiur 2. For mix-vth CMOS iruit, th trnsistors within t n hv irnt thrshol volts with rtin pross onstrints. Thr r two typs o mix-vth CMOS iruit shms tht w onsir. For typ I shm (MVT1), thr is no mix Vth in p pull-up or n pull-own trs. Fiur 4 shows th xmpl iruit in MVT1 shm. For typ II shm (MVT2), mix Vth is llow nywhr xpt or th sris onnt trnsistors. Th xmpl iruit in MVT2 shm is illustrt in Fiur 5. Th rson tht trnsistors in stk hv th sm thrshol volt is us o th pross onsirtion. Suppos th trnsistor thrshols r ontroll y hnnl opin. For th trnsistors in stk, thir hnnls r too los to h othr, mkin it iult to hiv istint hnnl opin. Thror, it is hr to t irnt thrshols or th trnsistors in stk. Oviously, MVT CMOS shows mor opportunitis or th hih Vth ssinmnt thn th t-lvl ul thrshol iruit. 4 Alorithms or MVT Stti CMOS Ciruit Dsin In this stion, w will show howtovlop mix-vth (MVT) stti CMOS iruit unr prormn onstrints. Lt us ssum tht th timin onstrints or th primry inputs n primry outputs r ivn. Thr r two thrshol volts. Th hih-vth is rprsnt y VtH n th low-vth s VtL. In orr to hiv n optiml mix-vth stti CMOS iruit, thr trnsistor-lvl lorithms or th ssinmnt o hih thrshol to sinl low Vth stti CMOS iruit r propos. Th rst on is n xtnsion o th t-lvl lvliztion-s k-trin lorithm [5], whr th trnsistors r trvrs lvl y lvl rom primry outputs. Th son on is priority sltion lorithm, whr th trnsistors r visit orin to th priority vlus. Th thir on is priority-s k-trin lorithm, whih is th omintion o th rst two lorithms. 4.1 Bk-trin (BT) Alorithm Th rst stp in this lorithm is to lvliz iruit. Th lvl o primry input is n to 0. Th lvl o t G, not y l(g), n lult y l(g) = 1 + mx l(gii) (12) i whr i vris or ll th nin o G n GIi is th ith nin o t G. By trminin tintrinsi n toutput vlus orrsponin to VtH n VtL s on HSPICE simultions, th proption ly o h trnsistor t VtH n VtL n vlut usin qution 1, n th orrsponin ly irn (t) n sily lult. Th nxt stp is to ssin ul thrshol volts to th trnsistors unr prormn onstrints. All th trnsistors in th iruit r initilly ssum to hv th low thrshol volt. W orwr-tr th iruit lvl y lvl rom primry inputs to lult th prtur tim o h t usin qutions (2) n (3). Nxt, k-tr th iruit lvl y lvl rom primry outputs to xplor vry t G. Th pull-up tr slk(sp(g)), pull-own tr slk (Sn(G)), n th slk oh trnsistor within G n lult y usin th qutions (4)-(7). For th t-lvl ul-vth (DVT) shm, i t o ll th trnsistors within G r no lrr thn thir slk vlus, G is hih-vth t. For th mix-vth typ I shm (MVT1), i ll th trnsistors in th pull-up (pull-own) tr o t G stisy th rquirmnt tht t r no lrr thn thir slk vlus, th pull-up (pull-own) tr n ssin VtH. Lt us onsir th mix Vth typ II shm (MVT2). For h trnsistor o t G, i it is not sris onnt trnsistor n its t is no lrr thn its slk vlu, this trnsistor n ssin th hih-vth. For th sris onnt trnsistors, i th t o ll th trnsistors in sris r no lrr thn thir slk vlus, VtH is ssin to ll th trnsistors in th sris. Othrwis, VtL is mintin. Atr th thrshol volt ssinmnt or h trnsistor within t G, th proption ly o h trnsistor within G is upt. Thn th prtur tim o t G, Sp(G), n
4 Sn(G), r rlult. Th psuo-o o this prour is shown low. Bktrin lorithm () Lvliz th iruit Evlut t o h trnsistor or V th n V tl Clult t o h trnsistor Assin V tl to ll th trnsistors Forwr tr th iruit lvl y lvl Clult th prtur tim o h t Bk-tr th iruit lvl y lvl to visit h t G Clult S p(g) n S n(g) For h trnsistor (tr) within G Clult s(tr) I DVT is slt I ll th trnsistors in G stisy t slk G will ssin V th I MVT1 is slt I ll th trnsistors in pull-up tr o G stisy t slk Pull-up tr o G will ssin V th I ll th trnsistors in pull-own tr stisy t slk Pull-own tr o G will ssin V th I MVT2 is slt For h trnsistor (tr) within G I tr is not sris onnt trnsistor I t (tr) s(tr) tr n ssin V th Els i tr is in sris n not visit I ll th trnsistors in th sris stisy t slk All th trnsistors in th sris r ssin V th Mrk ll th trnsistors in th sris visit Upt th prtur tim o G,S p(g) n S n(g) For th ktrin (BT) lorithm, sin h trnsistor is ust visit on, th worst s run-tim is O(n), whr n is th totl numr o trnsistors. 4.2 Priority Sltion (PS) Alorithm Priority sltion lorithm is n xhustiv priority-s lorithm. Th trnsistors r visit orin to th priority vlus. Atr h visit, th trnsistor slks r rlult. Th psuo o o th priority sltion lorithm or mix-vth typ II shm (MVT2) is outlin low. Priority sltion lorithm () Lvliz th iruit Clult ly n priority o h trnsistor All th trnsistors r ssin V tl n mrk unvisit I th unvisit trnsistor numr is not 0 Forwr-tr th iruit lvl y lvl Clult th prtur tim o h t Bk-tr th iruit lvl y lvl Clult th slk o h trnsistor Fin mx priority trnsistor (tr) rom unvisit trnsistors I tr is not sris onnt trnsistor I t (tr) s(tr) tr n ssin V th Mrk tr s visit trnsistor Els i tr is in sris I ll th trnsistors in this sris stisy t slk All th trnsistors in this sris n ssin V th Mrk ll th trnsistors in this sris s visit trnsistors Th rst stp is to lvliz th iruit n lult th ly n priority o h trnsistor. All th trnsistors r ssum to hv VtL n mrk unvisit. Th son stp is to xplor ll th trnsistors in th iruit orin to th trnsistor priority vlus. For h visit, th prtur tim o h t n vlut y orwr trin th iruit lvl y lvl rom primry inputs, n th slk o h trnsistor n lult y ktrin th iruit lvl y lvl rom primry outputs. Th trnsistor with th mximl priority rom th unvisit trnsistors is thn slt. By omprin th t o th trnsistor in visit with its slk vlu n onsirin th sris onnt trnsistors, th thrshol volt o this trnsistor n trmin. In orr to voi rptin ssinmnt, this trnsistor is mrk s visit trnsistor. For th priority sltion (PS) lorithm, th iruit ns to upt to r-lult th trnsistor slk vlus tr h trnsistor is visit. Thror, th worst s run-tim is O(n 2 ). 4.3 Priority-Bs Bktrin (PB) Alorithm Priority-s ktrin lorithm omins th ktrin lorithm n th priority sltion lorithm. Durin th initiliztion, th iruit is lvliz; th ly n priority o ll th trnsistors r lult. Thn, th trnsistors r put into m roups orin to thir priority vlus, whr roup 1 orrspons to th mximl priority roup n roup m is th roup with th miniml priority. Nxt, rom roup 1 to m, ktrin is prorm m tims. Durin h ktrin, only th trnsistors in th slt roup r onsir. I m = 1, this lorithm is quivlnt to th ktrin lorithm. I m = n, this is xtly th priority sltion lorithm. Th psuo-o o th priority-s ktrin lorithm or mix-vth typ II shm (MVT2) is shown low. Priority-s ktrin lorithm () Lvliz th iruit Clult ly n priority o h trnsistor All th trnsistors r ssin V tl n mrk unvisit Trnsistors r ivi into m roups s on priority vlus For roup i rom 1 to m Forwr tr th iruit lvl y lvl Clult th prtur tim o h t Bk-tr th iruit lvl y lvl to visit h t G Clult th slk o h trnsistor within G For h trnsistor (tr) within G I tr is in roup i I tr is not sris onnt trnsistor I t (tr) s(tr) tr n ssin V th Els i tr is in sris n not visit or I ll th trnsistors in this sris stisy t slk All th trnsistors in this sris r ssin V th Mrk ll th trnsistors in this sris visit Upt th prtur tim o G,S p(g) n S n(g) For priority-s ktrin (PB) lorithm, th trnsistors r ivi into m roups. Atr h roup is visit, th iruit is upt to r-lult th trnsistor slks. Hn, th worst s run-tim is O(mn). 5 Implmnttion n Rsults Th thr lorithms sri in Stion 4 hv n implmnt in C unr th Brkly SIS nvironmnt. In this stion, th rsults or numr oomintionl iruits r prsnt. In our nlysis, th thrshol volt n supply volt o th oriinl sinl low-vth iruits r ssum to roun 0:2V n 1V, rsptivly. Th primry inputs r ssum to rriv simultnously n th
5 timin onstrints or primry outputs r trmin y th ritil pth ly o th sinl low-vth iruit. 5.1 Rsults or 32-it Ar Awll sin 32-it stti CMOS Ko-Ston r ws invstit s on PthMill stti timin nlysis. Th normliz tiv lk powr n stny lk powr t irnt VtH r ivn in Fiur 6 n Fiur 7, rsptivly. Th iruit tmprtur is ssum to 110 o C n 25 o C or tiv mo n stny mo, rsptivly. Rsults show tht thr is n optiml VtH, t whih mix- Vth sin thniqu n provi nrly 20% mor lk powr svins thn th orrsponin t-lvl ul thrshol thniqu. Suppos th roup numr (m) is 10 or th priority-s ktrin (PB) lorithm. ForHP worksttion, th run-tim o ktrin (BT) lorithm, priority-s ktrin (PB) lorithm, n priority sltion lorithm r 3.8s, 4s, n 18s, rsptivly. Rsults init tht th PB lorithm ivs lmost th sm lk svins s th PS lorithm, ut th run-tim is los to tht o th BT lorithm. Normliz tiv lk powr DVT, BT MVT1, BT MVT2, BT MVT2, PB MVT2, PS VtH VtL (mv) Fiur 6: Ativ lk Normliz stny lk powr DVT, BT MVT1, BT MVT2, BT MVT2, PB MVT2, PS VtH VtL (mv) Fiur 7: Stny lk Fiur 8 ivs th normliz totl powr o th mix- Vth 32-it r t irnt VtH n irnt primry input tivitis. Th totl powr n ru y out 9% n 22% t mx tivity n 0.1mx tivity, rsptivly. Fiur 9 shows th pth istriutions o th 32-it r t sinl hih-vth, sinl low-vth, n mix ul-vth onitions. Crtinly, sinl hih-vth iruit hs lss lk powr, ut th ritil ly o sinl hih-vth iruit is 30% lrr thn tht o sinl low-vth iruit. Dul-Vth iruit hs th sm ritil ly s th sinl low-vth iruit. Howvr, th ly vlus o th non-ritil pths r inrs y ssinin th hih thrshol volt to som trnsistors in non-ritil pths. Normliz powr issiptions Lk powr t mx tivity Dynmi powr t mx tivity Totl powr t mx tivity Lk powr t 0.1*mx tivity Dynmi powr t 0.1*mx tivity Totl powr t 0.1*mx tivity VtH VtL (mv) Fiur 8: Totl powr Pth Numr sinl low Vth sinl hih Vth ul Vth Dly (ns) Fiur 9: Pth istriution 3 3 () Sinl-Vth Hih-Vth Low-Vth Hih-Vth Low-Vth () MVT1 3 Hih-Vth Low-Vth Hih-Vth Low-Vth () DVT 3 Hih-Vth Low-Vth Hih-Vth Low-Vth () MVT2 Fiur 10: Bnhmrk C17 in irnt shms 5.2 Rsults or ISCAS Bnhmrk Ciruits For th ISCAS nhmrk iruits, thnoloy-mppin ws us to mp th iruits to lirry whih ontins NAND, NOR n INVERTER ts. Eh typ o t hs thr irnt with implmnttions. In our nlysis, VtL, n VtH r ssum to 0:2V n 0:3V, rsptivly. Th supply volt is 1V. Th tiv hnnl lnth is 0:32m n th t oxi thiknss is 9.8nm. Th iruit tmprtur is ssum to 110 o C. A ly look-up tl s on HSPICE simultions n lk stimtion thniqu whih urtly mols sris onnt trnsistors [9] hv n us in our nlysis. Fiur 10 illustrts th shmti o iruit C17(rom th ISCAS nhmrks) in irnt shms. Fiur 10 () is th sinl low-vth shm. Th two ritil pths o C17 r inti. Thr r 12 trnsistors n 12 trnsistors. Th tiv hnnl with or h n trnsistor is 3m n 1m, rsptivly. Th lk powr issiption or th sinl low-vth iruit o C17 is 1:0W. Th shmti o iruit C17 in t-lvl ul- Vth (DVT) shm, mix-vth typishm (MVT1), n mix-vth typ II shm (MVT2) r ivn in Fiurs 10 (), (), n (), rsptivly. Th numrs o hih Vth trnsistors r 4, 10, n 11, whil th numrs o hih Vth trnsistors r 4, 6, n 6 or DVT, MVT1, n MVT2 shms, rsptivly. Th lk powr issiptions or C17 in DVT, MVT1 n MVT2 shms r 0:726W, 0:366W, n 0:32W, rsptivly. Hn, th lk svins or C17 in DVT, MVT1 n MVT2 shms r 27:6%, 63:5%, n 68:1%, rsptivly, ompr to th sinl low thrshol shm. By usin SIS ommn \mp", iruits r mpp to lirry trtin th miniml r, whr th ts with th miniml with r prrr. Thnoloy mppin n lso hiv usin SIS ommn \mp -n 1 -AFG" to hiv miniml ly. In th ritil pth, th ts with lrr with r hosn, whil th ts in th non-ritil pths
6 Tl 1: lk powr svins or ISCAS nhmrk iruits mpp or r Ciruit PI/PO FET DVT MVT1 MVT2 Chosn # # r.(%) r.(%) r.(%) C432 36/ C499 41/ C880 60/ C / C / C / C / C / C / C / Tl 3: lk powr svins or irnt lorithms Ciruit BT l. PS l. PB l. (m=10) Chosn % CPU(s) % CPU(s) % CPU(s) C C C C C C C C C C Tl 2: lk powr svins or ISCAS nhmrk iruits mpp or ly Ciruit PI/PO FET DVT MVT1 MVT2 Chosn # # r.(%) r.(%) r.(%) C432 36/ C499 41/ C880 60/ C / C / C / C / C / C / C / my hv smllr with. Oviously, th iruit mpp or ly is mor ln thn th iruit mpp or r. Tl 1 n Tl 2 rport th lk powr svins or ISCAS nhmrk iruits whih r mpp or r n ly, rsptivly. Th ktrin lorithm is us n irnt iruit shms, suh s DVT, MVT1, n MVT2, r ompr. Mor lk rution n hiv or th iruits mpp or r us o th lrr imln in slk. Th lk svins o MVT2 shm r lrr thn thos o MVT1 shm. Th mix-vth shms provi mor lk svins thn th orrsponin t-lvl ul thrshol thniqu. For som nhmrk iruits, th itionl lk svins n mor thn 20%. Tl 3 shows th lk powr svins or irnt lorithms, suh s ktrin (BT) lorithm, priority sltion (PS) lorithm, n priority-s ktrin (PB) lorithm. MVT2 shm is us n th iruits r mpp trtin th miniml ly. Th CPU tim is or SUN UltrSPARC-II. Rsults init tht PS lorithm shows mor lk svins, ut lso tks mor CPU tim. BT lorithm is th stst on, ut it ivs lss lk svin thn th othr two lorithms. For PB lorithm, th roup numr (m) is st to 10. Th lk svins r los to thos o PS lorithm n th run-tim is similr to tht o BT lorithm. 6 Summry & Conlusion In this ppr, mix-vth CMOS iruit sin thniqu is prsnt n irnt mix-vth iruit thniqus r introu. Svrl lorithms or trnsistor lvl thrshol ssinmnt or mix-vth stti CMOS iruit sin styl r propos. A 32-it r ws simult s on PthMill timin nlysis. For ISCAS Bnhmrk iruits, ly look-up tl s on HSPICE simultions n lk stimtion thniqu whih urtly mols trnsistor stks hv n us. Rsults init tht th mix-vth CMOS sin thniqu provis out 20% mor lk svins thn th orrsponin t-lvl ul thrshol thniqu. Aknowlmnt Th uthors woul lik to thnk V. Govinrulu or th ontriution in PthMill simultions. Rrns [1] J. M. C. Stork, \Thnoloy Lvr or Ultr-Low Powr Inormtion Systms", Proins o th IEEE, Vol.83, No.4, pp , [2] A. P. Chnrksn, S. Shn n R. W. Brorsn, \Low- Powr CMOS Diitl Dsin", IEEE Journl o Soli-Stt Ciruits, Vol.27, No.4, pp.473, [3] S. Mutoh, t l., \1-V Powr Supply Hih-Sp Diitl Ciruit Thnoloy with Multithrshol-Volt CMOS", IEEE Journl o Soli-Stt Ciruits, Vol.30, No.8, pp , [4] Z. Chn, C. Diz, J. Plummr, M. Co n W. Grn, \0.18um Dul Vt MOSFET Pross n Enry-Dly Msurmnt", IEDM Dist, pp. 851, [5] L. Wi, Z. Chn, K. Roy, M.C. Johnson, Y. Y n V. D, "Dsin n Optimiztion o Dul Thrshol Ciruits or Low Volt Low Powr Applitions", IEEE Trnstions on VLSI Systms, Vol.7, No. 1, pp , 1999 [6] N. Wst n K. Eshrhin, Prinipls o CMOS VLSI Dsin: systm prsptiv, Aison-Wsly Pulishin Compny, pp , 1992 [7] Q. Wn n S. Vruhul, \Stti Powr Optimiztion o Dp Sumiron CMOS Ciruits or Dul Vt Thnoloy", Intrntionl Conrn on Computr-Ai Dsin, pp , [8] B.J. Shu, D.L. Shrttr, P.K. Ko, n M.C. Tn, \BSIM: Brkly Short-Chnnl IGFET Mol or MOS Trnsistors", IEEE J. Soli-Stt Ciruits, SC-22, No.4, pp , [9] M. Johnson, D. Somskhr, n K. Roy, \Dtrministi Estimtion o Minimum n Mximum Lk Conitions in CMOS Loi," IEEE Trnstions on Computr-Ai Dsin o IC's, pt or pulition.
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, 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 informationPresent 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 informationCycles 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 informationOutline. 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 informationCS 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 informationECE 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 information1 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 informationOutline. 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 informationPlanar 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 informationDesigning 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 informationAn 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 informationSeven-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 informationConstructive 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 informationA 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 informationThe 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 informationCOMPLEXITY 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 informationOutline. 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 informationCSE 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 informationMath 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 informationAlgorithmic 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 informationMultipoint 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(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 informationCSE 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 information16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am
16.unii Introution to Computrs n Prormmin SOLUTIONS to Exmintion /30/0 9:05m - 10:00m Pro. I. Kristin Lunqvist Sprin 00 Grin Stion: Qustion 1 (5) Qustion (15) Qustion 3 (10) Qustion (35) Qustion 5 (10)
More informationCSC 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 informationModule 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 informationWhy 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 informationTangram Fractions Overview: Students will analyze standard and nonstandard
ACTIVITY 1 Mtrils: Stunt opis o tnrm mstrs trnsprnis o tnrm mstrs sissors PROCEDURE Skills: Dsriin n nmin polyons Stuyin onrun Comprin rtions Tnrm Frtions Ovrviw: Stunts will nlyz stnr n nonstnr tnrms
More informationb. 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 information5/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# 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 informationV={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 information12/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 informationQUESTIONS 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 information5/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 informationPaths. 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 informationDecimals DECIMALS.
Dimls DECIMALS www.mthltis.o.uk ow os it work? Solutions Dimls P qustions Pl vlu o imls 0 000 00 000 0 000 00 0 000 00 0 000 00 0 000 tnths or 0 thousnths or 000 hunrths or 00 hunrths or 00 0 tn thousnths
More informationExam 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 informationQUESTIONS 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 informationCS 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 informationClustering 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 informationGraphs. 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 information12. 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 informationV={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 informationMAT3707. 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 information0.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 informationUsing 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 informationMath 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4
Mt 166 WIR, Sprin 2012, Bnjmin urisp Mt 166 Wk in Rviw 2 Stions 1.1, 1.2, 1.3, & 1.4 1. S t pproprit rions in Vnn irm tt orrspon to o t ollowin sts. () (B ) B () ( ) B B () (B ) B 1 Mt 166 WIR, Sprin 2012,
More informationIntegration 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 informationNumbering 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 informationCSE 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 informationlearning 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 informationGarnir 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 informationA 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 informationOutline. 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 informationSAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings
PAGES Primry Primry Mths Bsis Sris THE SUBTRACTION BOOK A prorssion o sutrtion skills writtn y Jillin Cokins INTRODUCTION This ook is intn to hlp sur th mthmtil onpt o sutrtion in hilrn o ll s. Th mstry
More informationCOMP108 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 informationProblem 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 informationOpenMx 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 information10/30/12. Today. CS/ENGRD 2110 Object- Oriented Programming and Data Structures Fall 2012 Doug James. DFS algorithm. Reachability Algorithms
0/0/ CS/ENGRD 0 Ojt- Orint Prormmin n Dt Strutur Fll 0 Dou Jm Ltur 9: DFS, BFS & Shortt Pth Toy Rhility Dpth-Firt Srh Brth-Firt Srh Shortt Pth Unwiht rph Wiht rph Dijktr lorithm Rhility Alorithm Dpth Firt
More informationGraphs. 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 informationSimilarity 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 informationNew challenges on Independent Gate FinFET Transistor Network Generation
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
More informationCS 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 informationS 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 information160 SSC Variable Speed Drive (Series C)
0 SS Variable Speed rive (Series ) Publication 0-P onfigured rive Package Important User Information Solid state equipment has operational characteristics differing from those of electromechanical equipment.
More informationExperiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor
EE2L - Introution to Diitl Ciruits Exprimnt # 3 Exprimnt # 3 Introution to Diitl Loi Simultion n Xilinx Smti Eitor. Synopsis: Tis l introus CAD tool (Computr Ai Dsin tool) ll Xilinx Smti Eitor, wi is us
More informationfor Performance Potsdam, NY Urbana, IL can be connected to the inputs and outputs of the LUT to
Thnoloy Mppin o Squntil Ciruits or LUT-s FPGAs or Prormn Pihn Pn C. L. Liu Dpt. o Eltril & Computr En. Dpt. o Computr Sin Clrkson Univrsity Univrsity o Illinois t Urn-Chmpin Potsm, NY 13699 Urn, IL 61801
More informationEdge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work?
E-Trir D Flip-Flop Funamntal-Mo Squntial Ciruits PR A How o lip-lops work? How to analys aviour o lip-lops? R How to sin unamntal-mo iruits? Funamntal mo rstrition - only on input an an at a tim; iruit
More informationAquauno 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 informationSolutions 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 informationAnnouncements. 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 informationAn Effective Heuristic for Simple Offset Assignment with Variable Coalescing
An Etiv Huristi or Simpl Ost Assinmnt with Vribl Colsin Hssn Slmy n J. Rmnujm Dprtmnt o Eltril n Computr Eninrin n Cntr or Computtion n Thnoloy Louisin Stt Univrsity, Bton Rou, LA 7080, USA {hslm,jxr}@.lsu.u
More informationDUET 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 informationCEDAR ISLAND / KEATON BEACH TAYLOR COUNTY, FLORIDA POST-HURRICANE HERMINE EXAMINATION SURVEY FY16 4-FOOT PROJECT
10 9 8 7 6 5 JUG ISLN R KL H R H R ROSMR LN W W HITTIL R JO MORGN R LRW TR RK R L M PNSOL GUL G O R G I TLLHSS JKSONVILL ORLNO OO TMP TLNTI ON N US rmy orps of ngineers Jacksonville istrict ST ON THIS
More informationWalk Like a Mathematician Learning Task:
Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics
More informationSection 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 informationd e c b a d c b a d e c b a a c a d c c e b
FLAT PEYOTE STITCH Bin y mkin stoppr -- sw trou n pull it lon t tr until it is out 6 rom t n. Sw trou t in witout splittin t tr. You soul l to sli it up n own t tr ut it will sty in pl wn lt lon. Evn-Count
More informationThe University of Sydney MATH 2009
T Unvrsty o Syny MATH 2009 APH THEOY Tutorl 7 Solutons 2004 1. Lt t sonnt plnr rp sown. Drw ts ul, n t ul o t ul ( ). Sow tt s sonnt plnr rp, tn s onnt. Du tt ( ) s not somorp to. ( ) A onnt rp s on n
More informationComplete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT
Complt Solutions or MATH 012 Quiz 2, Otor 25, 2011, WTT Not. T nswrs ivn r r mor omplt tn is xpt on n tul xm. It is intn tt t mor omprnsiv solutions prsnt r will vlul to stunts in stuyin or t inl xm. In
More informationAnalysis for Balloon Modeling Structure based on Graph Theory
Anlysis for lloon Moling Strutur bs on Grph Thory Abstrt Mshiro Ur* Msshi Ym** Mmoru no** Shiny Miyzki** Tkmi Ysu* *Grut Shool of Informtion Sin, Ngoy Univrsity **Shool of Informtion Sin n Thnology, hukyo
More informationOrganization. Dominators. Control-flow graphs 8/30/2010. Dominators, control-dependence. Dominator relation of CFGs
Orniztion Domintors, ontrol-pnn n SSA orm Domintor rltion o CFGs postomintor rltion Domintor tr Computin omintor rltion n tr Dtlow lorithm Lnur n Trjn lorithm Control-pnn rltion SSA orm Control-low rphs
More informationModule 2 Motion Instructions
Moul 2 Motion Instrutions CAUTION: Bor you strt this xprimnt, unrstn tht you r xpt to ollow irtions EXPLICITLY! Tk your tim n r th irtions or h stp n or h prt o th xprimnt. You will rquir to ntr t in prtiulr
More informationTURFGRASS DISEASE RESEARCH REPORT J. M. Vargas, Jr. and R. Detweiler Department of Botany and Plant Pathology Michigan State University
I TURFGRASS DISEASE RESEARCH REPORT 9 J. M. Vrgs, Jr. n R. Dtwilr Dprtmnt f Btny n Plnt Pthlgy Mihign Stt Univrsity. Snw Ml Th 9 snw ml fungii vlutin trils wr nut t th Byn Highln Rsrt, Hrr Springs, Mihign
More informationA PROPOSAL OF FE MODELING OF UNIDIRECTIONAL COMPOSITE CONSIDERING UNCERTAIN MICRO STRUCTURE
18 TH INTERNATIONAL CONFERENCE ON COMPOSITE MATERIALS A PROPOSAL OF FE MODELING OF UNIDIRECTIONAL COMPOSITE CONSIDERING UNCERTAIN MICRO STRUCTURE Y.Fujit 1*, T. Kurshii 1, H.Ymtsu 1, M. Zo 2 1 Dpt. o Mngmnt
More informationSEE PAGE 2 FOR BRUSH MOTOR WIRING SEE PAGE 3 FOR MANUFACTURER SPECIFIC BLDC MOTOR WIRING EXAMPLES EZ SERVO EZSV17 WIRING DIAGRAM FOR BLDC MOTOR
0V TO 0V SUPPLY GROUN +0V TO +0V RS85 ONVRTR 9 TO OM PORT ON P TO P OM PORT US 9600 U 8IT, NO PRITY, STOP, NO FLOW TRL. OPTO SNSOR # GROUN +0V TO +0V GROUN RS85 RS85 OPTO SNSOR # PHOTO TRNSISTOR TO OTHR
More informationPage 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.
ConTst Clikr ustions Chtr 19 Physis, 4 th Eition Jms S. Wlkr ustion 19.1 Two hrg blls r rlling h othr s thy hng from th iling. Wht n you sy bout thir hrgs? Eltri Chrg I on is ositiv, th othr is ngtiv both
More informationLogic Redundancy Identication. September 14, target specic faults and are sometimes referred to as. \fault-independent methods.
Fix-Vlu n Stm Unosrvility Thorms or Loi Runny Intition Sptmr 14, 2003 Astrt { Thr is lss o implition-s mthos tht intiy loi runny rom iruit topoloy n without ny primry input ssinmnt. Ths mthos r lss omplx
More informationN=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f
lulu jwtt pnlton sin towr ounrs hpl lpp lu Our irst non-linr t strutur! rph G onsists o two sts G = {V, E} st o V vrtis, or nos st o E s, rltionships twn nos surph G onsists o sust o th vrtis n s o G jnt
More informationECE 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 informationSelf-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(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 informationSection 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 informationa 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 information5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees
/1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our
More informationWeighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths
Dt Strutur LECTURE Shortt pth lgorithm Proprti of hortt pth Bllmn-For lgorithm Dijktr lgorithm Chptr in th txtook (pp ). Wight grph -- rminr A wight grph i grph in whih g hv wight (ot) w(v i, v j ) >.
More informationNefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim
MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07
More informationSolutions 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 informationThe Amorphous FPGA Architecture
ABSTRACT Gnrl Trms Th Amorphous FPGA Arhittur Dsin, Exprimnttion, Msurmnt, Prormn Kywors FPGA, rhittur, morphous, prormn nlysis. 1. INTRODUCTION Dspit mny vnts o FPGA, th hu prormn n ost-iiny p twn FPGAs
More information