Clocking Strategies and Scannable Latches for Low Power Applications

Size: px
Start display at page:

Download "Clocking Strategies and Scannable Latches for Low Power Applications"

Transcription

1 locking trtegies nd cnnle Ltches for Low Power pplictions V. Zyun nd. eltzer eserch ivision, T.J. Wtson eserch enter, Yorktown Heights, NY 598 (. eltzer is now with Epson eserch nd evelopment, NY) strct This pper covers rnge of issues in the design of clocking schemes for low-power pplictions. First we revisit, extend nd improve the power-performnce optimiztion methodology for ltches, ttempting to mke it more forml nd comprehensive. t switching fctor nd the glitching ctivity re tken into considertion, using forml nlyticl pproch, then notion of energy-efficient fmily of configurtions is introduced to mke the comprison of different ltch styles in the power-performnce spce more fir, lso the power of the clock distriution is tken into ccount. Prcticl issues of uilding low overhed scn mechnism re considered, nd the power overhed of the scnnle design is nlyzed. low-power L extension to single-phse ltches is proposed, nd results of comprtive study of Lscnnle ltches re shown, supported y experimentl dt mesured on 0:8 test chip. ntroduction ince the importnce of designing low-power high performnce clocking schemes hs een recognized, numer of low-power ltch studies hve een pulished [9,, 8,, 6,,, 5, 4]. Vrious ltch styles hve een compred in the power-performnce design spce, numer of useful criteri hve een introduced, nd severl new low-power ltches hve een suggested. This pper improves the existing power-performnce optimiztion methodology in severl spects. First the methodology is formlized y using nlyticl formuls to tke into ccount oth dt switching ctivity nd the glitching fctor, sed on []. forml optimiztion of every ltch style in the power-performnce spce is performed efore compring different ltch styles through constructing energy-efficient fmilies of configurtions for every ltch. The importnce of the ltch sclility with respect to lowering supply voltge is emphsized y treting s prmeter, rther thn constnt. Power of the clock distriution network is nlyzed, nd the single-phse clocking scheme is compred with twophse clocking. numer of prcticl issues of uilding ltches hve een missing in mny cdemic studies. One of them is the testility issue, prticulrly, the scn mechnism. t the sme time the power overhed of the scnnle design cn e very significnt, nd the complexity of modern designs hs reched the point where sving power y implementing non-scnnle design is not vile. n this work we propose low power overhed scn mechnism for single phse ltches, nd compre it with other pproches in terms of power. Permission to mke digitl or hrd copies of ll or prt of this work for personl or clssroom use is grnted without fee provided tht copies re not mde or distriuted for profit or commercil dvntge nd tht copies er this notice nd the full cittion on the first pge. To copy otherwise, to repulish, to post on servers or to redistriute to lists, requires prior specific permission nd/or fee. LPE 0, ugust 6-7, 00, Huntington ech, liforni, U. opyright /0/ $5.00 Experimentl verifiction of the ides is ecoming incresingly importnt s the technology moves to the deep su-micrometer region, ecuse it is getting more nd more difficult to tke into ccount in simultions ll second order effects of the technology. n this pper we present experimentl results for low-power ltches uilt on stte-of-the rt technology. Optimiztion nd comprison methodology. Performnce esurement The stte of the rt methodology for compring the performnce of different ltches consists in evluting the following metric [8], sed on simultion of the switching of the ltch for vrying vlues of the dt setup time: T setup +! = min[t ;to; +mx( 0!!0)] where T setup is the setup time, nd! is dely through the ltch, mesured from the pproprite trnsition t the clock input nd the corresponding trnsition t the ltch output. n the formul the mx chooses the mximum dely etween the positive nd negtive trnsitions, nd the min chooses the smllest vlue of the sum for ll vlues of the dely etween the trnsitions t the dt nd clock inputs, T ;to;, s shown in Fig.. For this ltch the minimum vlue for the sum is reched when the dely etween the dt nd clock trnsitions is T ;to; =30ps, nd the dely through the ltch t this point is mx( 0!!0) = 80ps. Thus, we put for this ltch T setup +! = 30ps + 80ps =4ps. ll delys re mesured ssuming lod of four minimum size inverters. dely, ns > 0. >0 + to T, ns to Figure : Evlution of the performnce metric.. Power esurement significnt ostcle in clculting power directly y simultion is tht power dissiption is strongly pttern dependent. For exmple, in ltch the power depends on the verge numer of trnsitions t the dt input, s well s their time positions. The stte of the rt 346

2 methodology used y other uthors typiclly estimtes the power of ltch for two vlues of the switching ctivity t the dt input: = 0 nd =, nd then estimtes the verge power s liner comintion of the power under these extreme cses, with the weights depending on the dt switching fctor. The spurious switching ctivity, or glitching t the dt input is typiclly either neglected or dded in n d hoc mnner. n our study we used more forml pproch developed in [] which models the circuit s directed grph, clled the stte trnsition digrm, T [3, 7], such tht there is one-to-one correspondence etween edges in the grph nd power-dissipting events in circuit Tle : echle sttes in the T of the modified ltch. nd 0 designte voltge levels t the nodes of the circuit. node stte nme ,, G H To construct T for ltch we uild stte tree using the stte tree lgorithm []. n the first row we drw one circle for ech comintion of voltge vlues t the input nodes. n the second row we specify ll nodes whose voltges re uniquely specified given the voltge vlues t the nodes in the first row. Then the tree rnches, ech rnch corresponding to the stte of some node whose voltge vlue is so fr independent of those t ll nodes in this rnch ove it. n the next row, gin, we write ll nodes whose sttes re uniquely specified given the voltges t the nodes in the rnch ove them. This repets until ll nodes re specified. s n exmple, Tle shows ll rechle sttes for the modified sense mplifier ltch, shown in Fig. 3. The modifiction of the ltch consists in interchnging input to the NNs in the second stge, so tht the signl is connected to the lower input nd the signl to the upper input of the corresponding NN gtes. The result of this modifiction is tht the cpcitnce chrged/dischrged on the slower :! 0 trnsition is minimized t the expense of somewht higher cpcitnce chrged/dischrged on the other trnsition. Though simple modifiction, it results in 5% dely reduction, compred to the configurtion where oth nd signls re connected to the lower inputs of the NN gtes, nd in 3% dely reduction compred to the configurtion where oth nd signls re connected to the upper inputs of the NN gtes. The ility to do this sort of nlysis esily is nother reson for using the T nlysis. fter ll sttes hve een specified, we uild T y strting with one stte tht is oviously rechle. For every stte in the grph we find two other sttes rechle from it vi edges corresponding to trnsitions t the clock nd dt inputs. This process is repeted until oth edges leving every node enter sttes tht hve lredy een counted. The T for the modified ltch is shown in Fig., with the sttes designted in Tle. To simplify the explntion in this section, we will merge the sttes in Fig. tht differ only y the voltge levels t nodes G nd H. Then sttes with n index in Fig. merge with those tht hve index, reducing the T to simpler one, shown in Fig.. For our lyout of the ltch the cpcitnces t nodes H nd G re out 8 times smller thn those t nodes nd, mking the simplifiction quite resonle. till, the methodology cn e crried out Figure : tte trnsition digrm of the modified sense mplifier ltch (); simplified T (). without ny simplifying ssumptions, nd ll results presented in this pper re sed on the full nlysis of the T for every ltch. t is importnt to emphsize tht we ttriute the power dissipted for chrging/dischrging cpcitnces t the clock nd dt inputs to the ltch itself, rther thn to fn-in gte or the clock distriution tree. t is importnt tht the input cpcitnce of the wiring within the ltch lyout e included. imilrly, we do not include the power dissipted for chrging/dischrging the lod driven y ltch into ltch power. However, the output cpcitnce of the wiring within the ltch lyout must e included. uch convention mkes the power comprison etween different ltches more fir, however this lso mkes the T more complicted compred to those pulished in other works. Energy weights for every edge in the T re clculted using n nlog simultor or, for rough estimtes, mnully, using the formul P iv dd4v, where P i is the sum of cpcitnces t ll nodes tht hve different voltge levels in the sttes connected y the edge. Then, sed on the proilistic nlysis of the T, presented in [], nlyticl formuls re derived for the power of ltch tht express ltch power in terms of true nd spurious switching ctivities t the dt input. where P true = f( 0 + P + ) () 0 = E 00 = E ; E 00 = (E0 + E ; E00 ; E) n these formuls is the switching ctivity s defined in [], P is the proility of ltching, E mn re energy weights of pths p mn m n = f0 g in the grph tht re trversed when m ws ltched in the previous clock cycle nd the dt hs chnged to n (or hs not chnged if m = n). For the simplified T in Fig. some of the pths re p 0 = fs 3! s 6! s 5! s g, p = fs! s 8! s 7! s 3g, p 00 = fs 3! s 6! s 3g, nd p = fs! s 8! s g. The pth energy weight is otined y summing energy weights of ll edges long it. For ccurte estimtes, we simulte the ltch, using n input pttern tht cuses the ltch to go through every single edge in the T, nd energy weights re mesured y the simultor. t turns out tht every term in power formuls includes only energies dissipted on complete cycles in the T, which llows us to mesure these energies y integrting the current of the power supply, in cse the simultor does not support the mesurements of the instntneous power. n the presence of the spurious ctivity t the dt input formul similr to () is derived in [] tht is vlid for ll resonle 347

3 G H Figure 3: Trnsistor digrms: modified sense mplifier ltch, true single phse ltch. ltches known to the uthors: P totl = 0P true + f h E cycle + E cycle + ( ; 0)( P ) i ().3 Tuning Trnsistor izes efore compring it with other ltches, every ltch must e optimized for power-performnce metric, in order to mke sure tht the est configurtions of every ltch re compred. However, it turns out tht it is virtully impossile to come up with single metric tht would e fir for every ltch some ltches re more suitle for high-speed designs, others for low-power, ut slower designs. To void this uncertinty, we uilt for every ltch n energyefficient fmily of configurtions, which is fmily of configurtions, otined y optimizing ltch to minimize the cost function (E=E 0) +(;)(= 0) for ll vlues of the optimiztion prmeter in the rnge 0. Here, is the sum of the setup time nd the dely through the ltch, s defined in section., nd E is the verge energy dissipted y the ltch in one clock cycle, determined ccording to section.. This cost function ws used ecuse it resulted in consistent convergence of the circuit tuner. Thus, every configurtion in the energy-efficient fmily is the one tht results in the highest performnce mong ll configurtions dissipting the sme power, or the one tht dissipted the lest power mong ll configurtions tht deliver the sme performnce. f plotted in the power-versus-performnce coordintes, energy-efficient configurtions form convex hull of ll possile configurtions of given ltch, Fig.4. 0 enery efficient fmily ll configurtions where 0 P 0 = p E ij ;E cycle, 0 P = 00 p E ij ; P p E ij, P 00 0 P = p E ij + 0 p E ij ; P p E ij ; P 00 p E ij. Here P true is the verge power in the sence of glitches, clculted y (), the verge numer of spurious pulses during one clock cycle clculted s P = k k, where k is the proility tht k spurious pulses occur during one clock cycle. n mny ltches spurious pulses occurring when clock is high dissipte more (or less) energy thn those occurring when clock is low. This is ccounted y the term Ecycle, where is the verge numer of spurious pulses per cycle occurring while clock is high. n the ove formuls p k ij denote pth in T trversed when i ws ltched in the previous clock cycle nd the true dt vlue hs chnged to j (or hs not chnged if i = j) nd when k spurious pulses occurred in this clock cycle. n the ove formul the summtion of the energy weights is tken long such pths. For exmple, in Fig., p 00 = fs 3! s 6! s 5! s 6! s 3g, nd p 0 = fs 3! s 6! s 5! s 6! s 5! s g. E cycle is the energy dissipted y one spurious pulse, provided tht t lest one spurious pulse hs occurred efore it. For the T in Fig., E cycle is the energy dissipted on the cycle p cycle = fs 6! s 5! s 6g, or p cycle = fs 8! s 7! s 8g, nd E cycle is the energy dissipted on the cycle p cycle = fs 3! s! s 3g, orp cycle = fs! s 4! s g. There is one more cycle in the T in Fig., p cycle = fs 3! s! s 3 g,orp cycle = fs! s 4! s g, ut it hs the sme energy. Thus, the verge totl ltch power in () is sum of the true portion multiplied y the proility tht no spurious pulses occur during one clock cycle, 0, nd the spurious portion which depends on three prmeters: nd the verge numer of spurious pulses per cycle, when clock is low nd high, respectively, nd 0. The term f( ; 0)( P ) ccounts for the the difference etween the energies dissipted y the first nd susequent spurious pulses. For mny ltches (which is the cse for the T in Fig. ), it cncels h with 0P true, ndithe expression reduces to P 0 totl = P true + f E cycle + E cycle. POWE, uw/ghz T + T, ps ETUP Figure 4: uilding energy-efficient fmily for ltch. Hving uilt energy-efficient fmilies for every ltch llows us to compre different ltches over the whole energy-performnce design trdeoff spce, rther thn compring prticulr configurtions of every ltch. lock istriution Power When compring different ltches for energy efficiency it is essentil tht the power dissipted in the clocking tree e tken into ccount, ecuse different ltches present different requirements s well s different mounts of cpcitive lod on the clock distriution network. oreover, some ltch styles require two clock phses, while others use only one phse. To evlute the effect of the power of the clock distriution tree on the ltch energy efficiency, we simulted clock distriution tree for 3-it dtpth ltch, with trck it step, using 0:8 technology with set to V. When clculting the cpcitive lod presented y ltch to the clock distriution network, it is importnt to include the cpcitnce of the clock wiring inside the ltch cell. We found tht for ltch design using very smll trnsistor sizes, the internl wiring my represent from 5% to 0% of the totl cpcitive lod on the clock. 348

4 The simulted circuitry included clock splitter tht genertes two non-overlpping clock phses nd distriution network feeding every ltch. Trnsistor sizes in the clock drivers were set to the miniml sizes tht re needed to gurntee tht the slope t every node in the clock distriution network is no more thn 0ps. The simultion results showed tht the whole simulted clock distriution network dissiptes 40fJ per clock cycle, of which 0fJ is dissipted for driving the wire cpcitnce nd ltch input cpcitnce, nd 40fJ is dissipted in clock drivers. ivided y 3 ltches in the simulted structure, this yields 7.5fJ per ltch per clock cycle. Note tht the power dissipted for driving the cpcitnce t the clock input of the ltch is counted s power dissipted in the ltch, rther thn in the distriution tree. Tking this into ccount yields n estimte of 6.5fJ per ltch per clock cycle overhed for distriuting one clock phse. The overhed for distriuting two clock phses is 3fJ per ltch per clock cycle, which is comprle to the energy dissipted within the ltch itself, if the ltter is uilt using very smll trnsistor sizes. This nlysis indictes tht in low power design which uses very smll trnsistors, ltch tht cn work with single phse of the clock hs 30% power dvntge over ltch tht requires two phses for roust opertion. 3 cnnle ltches The integrtion nd complexity of modern systems hs grown to the point where sving power y uilding non-scnnle design is no longer n option. The power overhed of the scnnle design my e very significnt. For exmple, the study in [] hs reported 54% increse in power of n L stndrd cell design over the identicl non-scnnle design. However, the effect of scnnle design on power hs not received sufficient ttention in recent works on low-power ltches. n this work we try to fill this gp y nlyzing the power overhed of existing pproches to uilding scnnle ltches nd proposing new, low power overhed L comptile extension to edge-triggered ltches. There exist two mjor pproches to uilding scnnle designs: edge-triggered nd level sensitive, L scn. ecuse the L scn is rce free, it is more roust thn the edge-triggered scn, nd it preserves the integrity of the scn chin even in the presence of significnt clock skews []. For this reson L is the scn mechnism of our choice. P P Figure 5: L trnsmission gte ltch (ove) nd NO ltch (elow). The stndrd wy of implementing n L mster-slve ltch is shown in Fig. 5 for the trnsmission-gte ltch (clled PowerP ltch in [8]), nd NO ltch (clled O ltch in [8]). n these ltches the power overhed of the scn is quite smll only drin cpcitnces of trnsistors nd P (which re cut off) re chrged/dischrged during the norml opertion mode. However, these ltches require two phses of clock, nd, in the norml opertion mode, which, ccording to ection, increses the totl power of the clocking system y 30%. n order to void the power penlty of the second clock phse, the ltch should operte with single clock phse during the norml mode, nd during the scn mode it should operte s mster-slve ltch with two non-overlpping clock phses, s required y the L stndrd. Fig. 6 shows the proposed L extension to the sense mplifier ltch tht hs this property. O O N scn ltch N3 N4 cn N3 E N5 Figure 6: cnnle sense mplifier ltch: proposed L scnnle ltch, prior rt [6] edge-triggered scnnle ltch. The result is chieved y mixing in the scn-in dt t the second stge of the ltch, - stge. The scn-in dt signl, is written to the - stge of the ltch through trnsistors nd N, or N nd N4. High level of clock enles the scn-in write opertion. The scn ltch in Fig. 6 is level sensitive ltch controlled y clock. uring the scn mode the clock is kept t the low level, nd the - stge of the ltch nd the scn ltch work s mster-slve ltch, controlled y clocks nd, s required y L. uring the norml opertion mode clocks nd re kept t the low level, nd the ltch opertes s the conventionl ltch. The power overhed of the proposed scn extension is reduced to the drin cpcitnce of two minimum-sized trnsistors nd N3, connected to the output nodes nd. This extr cpcitnce is chrged or dischrged t most once per clock cycle, nd is not ffected y spurious trnsitions t the dt input. Thus, the power overhed of the scn extension is 4P = f where is the drin cpcitnce of trnsistors nd N3 in Fig. 6, nd is the true switching ctivity t the dt input. prior rt edge-triggered scnnle version of the ltch [6] is shown in Fig. 6. uring the norml mode of opertion the input N4 N F N6 349

5 Tle : Power overhed of dding scn the ltch. pproch energy overhed vlue vlue for V dd =v formul =0:3 =0:3 prior rt V dd (V dd ; V T )4 4.7 ff.0 fj mux-sed ( + )V dd mux 5. ff 4.6 fj proposed V dd. ff 0.3 fj signl cn is low, nd the current flows through trnsistors or N, controlled y the input dt signls nd. uring the scn mode the signl cn is high, nd the current flows through trnsistors N3 or N4, controlled y the scn-in signls nd. This implementtion of the scn-in cpility hs very high power overhed, ecuse it significntly increses cpcitnce t the ottom prt of the ltch (nodes,, E, F nd ). ince these nodes re chrged nd dischrged every clock cycle, independent of the switching ctivity, the increse in power dissiption equls 4P = f (; V T ) 4 where 4 is the increse of the cpcitnce t nodes,, E, F nd in Fig. 6. n lterntive implementtion of the scn cpility y mens of multiplexing the input nd scn-in dt degrdes the performnce of the ltch y incresing the setup time, moreover, it leds to n increse of the the power dissiption which is proportionl to the sum of the input dt switching ctivity nd glitching fctor, 4P 3 = f mux ( + ) where mux is the cpcitnce of the multiplexor t the input, is the input dt switching ctivity, nd is the glitching fctor t the dt input. sed on cpcitnce vlues for 0:3 technology, Tle estimtes the power overhed of dding the scn feture to the ltch using the two prior rt pproches nd the proposed pproch. The fourth column gives the energy overhed estimtes for typicl vlues of the dt switching ctivity nd the glitching fctor. The Tle shows tht the proposed L extension reduces the energy overhed of the scnnle ltch times (which could e even more in high glitching nodes), compred to the input multiplexed design, nd 37 times, compred to the prior rt design in Fig. 6. Under the sme conditions the full sense mplifier ltch in Fig. 6 dissiptes out 8.5fJ per clock cycle. Thus, using the proposed pproch results in more thn 50% power svings in the scnnle ltch, nd out 30% svings in the totl ltch power, including the clock distriution tree. n terms of the effect on the ltch performnce, the proposed scn extension hs pproximtely the sme decrese in performnce s the prior rt pproch in Fig. 6, nd significntly smller decrese in performnce thn the multiplexor-sed pproch. The proposed L extension cn e used with mny other single phse ltches, including those descried in []. 4 omprtive study We hve done comprtive study of lrge numer of different ltch styles to identify the ones tht re most suitle for low power design. ince the power supply reduction is essentil for reducing power, we primrily focused on sttic nd semi-sttic ltches ecuse of their higher noise mrgin. lso, since reduction plys such n importnt role, we were prticulrly interested in those ltches whose performnce degrdes the lest s is reduced. n this pper we show results only for four ltch styles: L scnnle NO nd trnsmission gte ltches, Fig. 5, proposed L sense mplifier ltch, Fig 6 nd semi-sttic true single phse ltch, Fig 3, derived from []. The optimiztion descried in ection ws pplied to every ltch. The optimiztion prmeter ws chnged in the rnge from 0. to 0.9 to generte the energy efficient curve for ech ltch for =0.9V. ulk technology ws used with 0:3 feture size. The power nd performnce of the tuned ltch were mesured s descried in ection. Then ll energy efficient configurtions of every ltch were simulted for lower vlues of, =0.8V nd =0.7V. No dditionl tuning ws done, however. The results re shown in Fig. 7, for the ctivity fctor of 0.3 trnsitions per cycle, nd the spurious ctivity of 0.5 glitches per cycle. ENEGY PE YLE, fj NO 09V TG 09V TG 08V TG 07V 09V 08V 07V 0.9V 0.8V 0.7V T ETUP + T, ps Figure 7: verge energy per cycle versus performnce. witching fctor = 0:3, glitching ctivity = 0:5 ( = 0: = 0:0 3 = 0:005). olid lines connect points of energy efficient configurtions for every vlue of. Extensive use of clock gting effectively increses the switching fctor nd the glitching ctivity. Fig. 8 plots the verge energy per cycle of the sme ltches for higher vlue of the switching nd glitching ctivities. Low power consumption of the L sense mplifier ltch even in the presence of significnt glitching ctivity, s well s its ility to operte with reduced swing signls mke it very good cndidte for low power designs. 5 Experimentl dt test site ws constructed in n experimentl 0.8 micron O process to investigte the ility of single clock sense mplifier style ltches uilt of very smll width devices to cpture dt with poor slew rtes nd low. The true/complement input sense mplifier style ltch ws modified for single ended input in two versions s shown in Fig. 9. The first version used gte input with n dded inverter of minimum size devices to drive the opposite gte. The second version used mixed gte plus source input. The input ws connected to four.6mm wires with 6 tristte drivers distriuted long ech wire. The driver dt nd selects re controlled y scn ltch chin nd the output of the sense mplifier ltch is oserved t the pds. The experiment mesured the mximum frequency t which the ltch could cpture lternting ones nd zeroes inserted t the end of the long wire versus. ecuse the solute frequency is proportionl to oth the lrge wire dely nd the setup+hold time of the ltch, the results of the experiment re presented in reltive terms. Figure shows the results over the voltge rnge equl to 0.55V to.5v. oth circuits operted 350

6 ENEGY PE YLE, fj NO 09V TG 09V TG 08V TG 07V 09V 08V 07V 0.9V 0.8V 0.7V rtio: gte input design / mixed input design mx frequency rtio energy rtio T ETUP + T, ps (volts) Figure : Ltch comprison experiment: gte-input (Fig. 9) versus mixed-input designs (Fig. 9). Figure 8: verge energy per cycle versus performnce. witching fctor =0:5, glitching ctivity =0:55 ( =0: = 0: 3 =0:05). olid lines connect points of energy efficient configurtions for every vlue of. Figure 9: Ltches on the test chip: gte input ltch, mixed input ltch. over the full voltge rnge, including the extreme low voltge corresponding to V TP +V TN. The conventionl gte input showed etter setup+hold time s well s lower energy. 6 onclusions Power-performnce optimiztion methodology for ltches ws extended to formlly prmeterize ltch power in terms of switching fctor nd glitching ctivity. The concept of energy efficient fmily of configurtions ws introduced nd used for forml comprison of different ltch styles in the power-performnce spce. lock distriution power ws found to e significnt component of the totl power of the clocking system in low-power designs, nd ltches using single clock phse were found to dissipte 30% less power thn those requiring two phses of clock. Prcticl issues of uilding low power overhed scn mechnism were considered, nd low-power L extension to single-phse ltches ws proposed nd demonstrted to significntly reduce the power overhed of L design. esults of comprtive study of L ltches re shown, nd the modified sense mplifier ltch with the proposed L extension ws found to e very strong cndidte for low-power designs. esults re supported y experimentl dt mesured on 0:8 test chip which showed roust opertion of the sense mplifier ltch uilt of very smll width devices over the full voltge rnge. Gte-input version of the sense mplifier ltch ws found to e oth fster nd lower-power thn the mixed-input vrition. cknowledgment The uthors would like to thnk. Kosonocky, K. hin,. Hen,. Kneel nd W. Hwng for useful discussions;. mmedito for mesuring experimentl dt; G. Gristede for tool support; nd K. Wrren nd J. oreno for mngement support. eferences []. Fris. ircuit design for full scn TPG. n Forth nnul EEE nterntionl onference, pges , 99. [] T. Lng, E. usoll, nd J. ortdell. ndividul flip-flops with gted clocks for low power dtpths. EEE Trnsctions on ircuits nd ystems : nlog nd igitl ignl Processing, 44(6):507 56, June 997. [3] J.Y. Lin, T.. Liu, nd W.Z. hen. cell-sed power estimtion in O comintionl circuits., pges , 994. [4] N. Nedovic nd V. Oklodzij. ynmic flip-flop with improved power. n Proceedings of the nterntionl onference on omputer esign, 000. [5] N. Nedovic nd V. Oklodzij. Hyrid ltch flip-flop with improved power efficiency. n Proceedings of the ymposium on ntegrted ircuits nd ystems esign, 000. [6]. Nikolic et l. mproved sense-mplifier-sed flip-flop: esign nd mesurements. EEE Journl of olid-tte ircuits, 35(6): , June 000. [7] J. H. tynryn nd K. K. Prhi. Het: Hierrchicl energy nlysis tool. Proceedings of the 33rd esign utomtion onference, pges 9 4, June 996. [8] V. tojnovic nd V. Oklodzij. omprtive nlysis of msterslve ltches nd flip-flops for high-performnce nd low-power systems. EEE Journl of olid-tte ircuits, 34(4): , pril 999. [9] V. tojnovic, V. Oklodzij, nd. jw. unified pproch in the nlysis of ltches nd flip-flops for low-power systems. n Proceedings of the nterntionl ymposium on Low Power Electronics nd esign, pges 7 3, ugust 998. []. vensson nd J. Yun. Ltches nd flip-flops for low power systems. n. hndrksn nd. rodersen, editors, Low Power O esign, pges EEE Press, 998. [] J. Yun nd. vensson. New single-clock O ltches nd flipflops with improved speed nd power svings. EEE Journl of olid-tte ircuits, 3():6 69, Jnury 997. [] V. Zyun nd P. Kogge. ppliction of T to ltch-power estimtion. EEE Trnsctions on VL ystems, 7(), rch

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

CS12N: The Coming Revolution in Computer Architecture Laboratory 2 Preparation

CS12N: The Coming Revolution in Computer Architecture Laboratory 2 Preparation CS2N: The Coming Revolution in Computer Architecture Lortory 2 Preprtion Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

1B40 Practical Skills

1B40 Practical Skills B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need

More information

Designing finite automata II

Designing finite automata II Designing finite utomt II Prolem: Design DFA A such tht L(A) consists of ll strings of nd which re of length 3n, for n = 0, 1, 2, (1) Determine wht to rememer out the input string Assign stte to ech of

More information

Convert the NFA into DFA

Convert the NFA into DFA Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:

More information

expression simply by forming an OR of the ANDs of all input variables for which the output is

expression simply by forming an OR of the ANDs of all input variables for which the output is 2.4 Logic Minimiztion nd Krnugh Mps As we found ove, given truth tle, it is lwys possile to write down correct logic expression simply y forming n OR of the ANDs of ll input vriles for which the output

More information

Math 8 Winter 2015 Applications of Integration

Math 8 Winter 2015 Applications of Integration Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl

More information

1 Nondeterministic Finite Automata

1 Nondeterministic Finite Automata 1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you

More information

Bayesian Networks: Approximate Inference

Bayesian Networks: Approximate Inference pproches to inference yesin Networks: pproximte Inference xct inference Vrillimintion Join tree lgorithm pproximte inference Simplify the structure of the network to mkxct inferencfficient (vritionl methods,

More information

Outline Last time: Deriving the State Diagram & Datapath (Cont.) Mapping the Datapath onto Control

Outline Last time: Deriving the State Diagram & Datapath (Cont.) Mapping the Datapath onto Control Outline Lst time: Deriving the Stte Digrm & Dtpth (Cont.) Mpping the Dtpth onto Control This lecture: Comintionl Testility nd Test-pttern Genertion Fults in digitl circuits Wht is test? : Controllility

More information

Resources. Introduction: Binding. Resource Types. Resource Sharing. The type of a resource denotes its ability to perform different operations

Resources. Introduction: Binding. Resource Types. Resource Sharing. The type of a resource denotes its ability to perform different operations Introduction: Binding Prt of 4-lecture introduction Scheduling Resource inding Are nd performnce estimtion Control unit synthesis This lecture covers Resources nd resource types Resource shring nd inding

More information

Chapter 4: Techniques of Circuit Analysis. Chapter 4: Techniques of Circuit Analysis

Chapter 4: Techniques of Circuit Analysis. Chapter 4: Techniques of Circuit Analysis Chpter 4: Techniques of Circuit Anlysis Terminology Node-Voltge Method Introduction Dependent Sources Specil Cses Mesh-Current Method Introduction Dependent Sources Specil Cses Comprison of Methods Source

More information

Module wires will get worse, but only slowly You don t think to rethink your wires in your adder, memory Or even your super-scalar processor core It

Module wires will get worse, but only slowly You don t think to rethink your wires in your adder, memory Or even your super-scalar processor core It Module wires will get worse, ut only slowly ou don t think to rethink your wires in your dder, memory Or even your super-sclr processor core It does let you design more modules Continued scling of uniprocessor

More information

Industrial Electrical Engineering and Automation

Industrial Electrical Engineering and Automation CODEN:LUTEDX/(TEIE-719)/1-7/(7) Industril Electricl Engineering nd Automtion Estimtion of the Zero Sequence oltge on the D- side of Dy Trnsformer y Using One oltge Trnsformer on the D-side Frncesco Sull

More information

Fig. 1. Open-Loop and Closed-Loop Systems with Plant Variations

Fig. 1. Open-Loop and Closed-Loop Systems with Plant Variations ME 3600 Control ystems Chrcteristics of Open-Loop nd Closed-Loop ystems Importnt Control ystem Chrcteristics o ensitivity of system response to prmetric vritions cn be reduced o rnsient nd stedy-stte responses

More information

Designing Information Devices and Systems I Spring 2018 Homework 7

Designing Information Devices and Systems I Spring 2018 Homework 7 EECS 16A Designing Informtion Devices nd Systems I Spring 2018 omework 7 This homework is due Mrch 12, 2018, t 23:59. Self-grdes re due Mrch 15, 2018, t 23:59. Sumission Formt Your homework sumission should

More information

DIRECT CURRENT CIRCUITS

DIRECT CURRENT CIRCUITS DRECT CURRENT CUTS ELECTRC POWER Consider the circuit shown in the Figure where bttery is connected to resistor R. A positive chrge dq will gin potentil energy s it moves from point to point b through

More information

Model Reduction of Finite State Machines by Contraction

Model Reduction of Finite State Machines by Contraction Model Reduction of Finite Stte Mchines y Contrction Alessndro Giu Dip. di Ingegneri Elettric ed Elettronic, Università di Cgliri, Pizz d Armi, 09123 Cgliri, Itly Phone: +39-070-675-5892 Fx: +39-070-675-5900

More information

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

Degrading Precision Arithmetic for Low Power Signal Processing

Degrading Precision Arithmetic for Low Power Signal Processing Degrding Precision Arithmetic for Low Power Signl Processing Mssimo Petricc, Gin Crlo Crdrilli, Alberto Nnnrelli (1), Mrco Re nd Pietro Albicocco Deprtment of Electronics, University of Rome Tor ergt,

More information

Designing Information Devices and Systems I Spring 2018 Homework 8

Designing Information Devices and Systems I Spring 2018 Homework 8 EECS 16A Designing Informtion Devices nd Systems I Spring 2018 Homework 8 This homework is due Mrch 19, 2018, t 23:59. Self-grdes re due Mrch 22, 2018, t 23:59. Sumission Formt Your homework sumission

More information

Fault Modeling. EE5375 ADD II Prof. MacDonald

Fault Modeling. EE5375 ADD II Prof. MacDonald Fult Modeling EE5375 ADD II Prof. McDonld Stuck At Fult Models l Modeling of physicl defects (fults) simplify to logicl fult l stuck high or low represents mny physicl defects esy to simulte technology

More information

Parse trees, ambiguity, and Chomsky normal form

Parse trees, ambiguity, and Chomsky normal form Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs

More information

332:221 Principles of Electrical Engineering I Fall Hourly Exam 2 November 6, 2006

332:221 Principles of Electrical Engineering I Fall Hourly Exam 2 November 6, 2006 2:221 Principles of Electricl Engineering I Fll 2006 Nme of the student nd ID numer: Hourly Exm 2 Novemer 6, 2006 This is closed-ook closed-notes exm. Do ll your work on these sheets. If more spce is required,

More information

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17 EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,

More information

u( t) + K 2 ( ) = 1 t > 0 Analyzing Damped Oscillations Problem (Meador, example 2-18, pp 44-48): Determine the equation of the following graph.

u( t) + K 2 ( ) = 1 t > 0 Analyzing Damped Oscillations Problem (Meador, example 2-18, pp 44-48): Determine the equation of the following graph. nlyzing Dmped Oscilltions Prolem (Medor, exmple 2-18, pp 44-48): Determine the eqution of the following grph. The eqution is ssumed to e of the following form f ( t) = K 1 u( t) + K 2 e!"t sin (#t + $

More information

Thomas Whitham Sixth Form

Thomas Whitham Sixth Form Thoms Whithm Sith Form Pure Mthemtics Unit C Alger Trigonometry Geometry Clculus Vectors Trigonometry Compound ngle formule sin sin cos cos Pge A B sin Acos B cos Asin B A B sin Acos B cos Asin B A B cos

More information

Things to Memorize: A Partial List. January 27, 2017

Things to Memorize: A Partial List. January 27, 2017 Things to Memorize: A Prtil List Jnury 27, 2017 Chpter 2 Vectors - Bsic Fcts A vector hs mgnitude (lso clled size/length/norm) nd direction. It does not hve fixed position, so the sme vector cn e moved

More information

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata CS103B ndout 18 Winter 2007 Ferury 28, 2007 Finite Automt Initil text y Mggie Johnson. Introduction Severl childrens gmes fit the following description: Pieces re set up on plying ord; dice re thrown or

More information

1 Online Learning and Regret Minimization

1 Online Learning and Regret Minimization 2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in

More information

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17 CS 70 Discrete Mthemtics nd Proility Theory Summer 2014 Jmes Cook Note 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion, y tking

More information

Fast Boolean Algebra

Fast Boolean Algebra Fst Boolen Alger ELEC 267 notes with the overurden removed A fst wy to lern enough to get the prel done honorly Printed; 3//5 Slide Modified; Jnury 3, 25 John Knight Digitl Circuits p. Fst Boolen Alger

More information

Definite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 +

Definite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 + Definite Integrls --5 The re under curve cn e pproximted y dding up the res of rectngles. Exmple. Approximte the re under y = from x = to x = using equl suintervls nd + x evluting the function t the left-hnd

More information

Math 1B, lecture 4: Error bounds for numerical methods

Math 1B, lecture 4: Error bounds for numerical methods Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the

More information

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response

More information

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.) CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts

More information

APPROXIMATE INTEGRATION

APPROXIMATE INTEGRATION APPROXIMATE INTEGRATION. Introduction We hve seen tht there re functions whose nti-derivtives cnnot be expressed in closed form. For these resons ny definite integrl involving these integrnds cnnot be

More information

Chapter 9 Definite Integrals

Chapter 9 Definite Integrals Chpter 9 Definite Integrls In the previous chpter we found how to tke n ntiderivtive nd investigted the indefinite integrl. In this chpter the connection etween ntiderivtives nd definite integrls is estlished

More information

Scanner. Specifying patterns. Specifying patterns. Operations on languages. A scanner must recognize the units of syntax Some parts are easy:

Scanner. Specifying patterns. Specifying patterns. Operations on languages. A scanner must recognize the units of syntax Some parts are easy: Scnner Specifying ptterns source code tokens scnner prser IR A scnner must recognize the units of syntx Some prts re esy: errors mps chrcters into tokens the sic unit of syntx x = x + y; ecomes

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

ANALYSIS OF FAST REACTORS SYSTEMS

ANALYSIS OF FAST REACTORS SYSTEMS ANALYSIS OF FAST REACTORS SYSTEMS M. Rghe 4/7/006 INTRODUCTION Fst rectors differ from therml rectors in severl spects nd require specil tretment. The prsitic cpture cross sections in the fuel, coolnt

More information

Review of Calculus, cont d

Review of Calculus, cont d Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some

More information

Bases for Vector Spaces

Bases for Vector Spaces Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

More information

EECS 141 Due 04/19/02, 5pm, in 558 Cory

EECS 141 Due 04/19/02, 5pm, in 558 Cory UIVERSITY OF CALIFORIA College of Engineering Deprtment of Electricl Engineering nd Computer Sciences Lst modified on April 8, 2002 y Tufn Krlr (tufn@eecs.erkeley.edu) Jn M. Rey, Andrei Vldemirescu Homework

More information

LAMEPS Limited area ensemble forecasting in Norway, using targeted EPS

LAMEPS Limited area ensemble forecasting in Norway, using targeted EPS Limited re ensemle forecsting in Norwy, using trgeted Mrit H. Jensen, Inger-Lise Frogner* nd Ole Vignes, Norwegin Meteorologicl Institute, (*held the presenttion) At the Norwegin Meteorologicl Institute

More information

Genetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary

Genetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary Outline Genetic Progrmming Evolutionry strtegies Genetic progrmming Summry Bsed on the mteril provided y Professor Michel Negnevitsky Evolutionry Strtegies An pproch simulting nturl evolution ws proposed

More information

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by. NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with

More information

Section 4: Integration ECO4112F 2011

Section 4: Integration ECO4112F 2011 Reding: Ching Chpter Section : Integrtion ECOF Note: These notes do not fully cover the mteril in Ching, ut re ment to supplement your reding in Ching. Thus fr the optimistion you hve covered hs een sttic

More information

Section 6.1 Definite Integral

Section 6.1 Definite Integral Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined

More information

Section 6: Area, Volume, and Average Value

Section 6: Area, Volume, and Average Value Chpter The Integrl Applied Clculus Section 6: Are, Volume, nd Averge Vlue Are We hve lredy used integrls to find the re etween the grph of function nd the horizontl xis. Integrls cn lso e used to find

More information

Suppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2.

Suppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2. Mth 43 Section 6. Section 6.: Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot

More information

Interpreting Integrals and the Fundamental Theorem

Interpreting Integrals and the Fundamental Theorem Interpreting Integrls nd the Fundmentl Theorem Tody, we go further in interpreting the mening of the definite integrl. Using Units to Aid Interprettion We lredy know tht if f(t) is the rte of chnge of

More information

We partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.

We partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b. Mth 255 - Vector lculus II Notes 4.2 Pth nd Line Integrls We begin with discussion of pth integrls (the book clls them sclr line integrls). We will do this for function of two vribles, but these ides cn

More information

INTRODUCTION. The three general approaches to the solution of kinetics problems are:

INTRODUCTION. The three general approaches to the solution of kinetics problems are: INTRODUCTION According to Newton s lw, prticle will ccelerte when it is subjected to unblnced forces. Kinetics is the study of the reltions between unblnced forces nd the resulting chnges in motion. The

More information

12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2014

12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2014 CS125 Lecture 12 Fll 2014 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple

More information

10 Vector Integral Calculus

10 Vector Integral Calculus Vector Integrl lculus Vector integrl clculus extends integrls s known from clculus to integrls over curves ("line integrls"), surfces ("surfce integrls") nd solids ("volume integrls"). These integrls hve

More information

The Minimum Label Spanning Tree Problem: Illustrating the Utility of Genetic Algorithms

The Minimum Label Spanning Tree Problem: Illustrating the Utility of Genetic Algorithms The Minimum Lel Spnning Tree Prolem: Illustrting the Utility of Genetic Algorithms Yupei Xiong, Univ. of Mrylnd Bruce Golden, Univ. of Mrylnd Edwrd Wsil, Americn Univ. Presented t BAE Systems Distinguished

More information

Finite Automata-cont d

Finite Automata-cont d Automt Theory nd Forml Lnguges Professor Leslie Lnder Lecture # 6 Finite Automt-cont d The Pumping Lemm WEB SITE: http://ingwe.inghmton.edu/ ~lnder/cs573.html Septemer 18, 2000 Exmple 1 Consider L = {ww

More information

THERMAL EXPANSION COEFFICIENT OF WATER FOR VOLUMETRIC CALIBRATION

THERMAL EXPANSION COEFFICIENT OF WATER FOR VOLUMETRIC CALIBRATION XX IMEKO World Congress Metrology for Green Growth September 9,, Busn, Republic of Kore THERMAL EXPANSION COEFFICIENT OF WATER FOR OLUMETRIC CALIBRATION Nieves Medin Hed of Mss Division, CEM, Spin, mnmedin@mityc.es

More information

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O 1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the

More information

Flexible Beam. Objectives

Flexible Beam. Objectives Flexile Bem Ojectives The ojective of this l is to lern out the chllenges posed y resonnces in feedck systems. An intuitive understnding will e gined through the mnul control of flexile em resemling lrge

More information

The Influence of Interface and Semiconductor Bulk Traps Generated Under HEFS on MOSFET`s Electrical Characteristics

The Influence of Interface and Semiconductor Bulk Traps Generated Under HEFS on MOSFET`s Electrical Characteristics Proceedings of the 5th Smll Systems Simultion Symposium 2014, Niš, Seri, 12th-14th Ferury 2014 The Influence of Interfce nd Semiconductor Bulk Trps Generted Under HEFS on MOSFET`s Electricl Chrcteristics

More information

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite

More information

Designing Information Devices and Systems I Anant Sahai, Ali Niknejad. This homework is due October 19, 2015, at Noon.

Designing Information Devices and Systems I Anant Sahai, Ali Niknejad. This homework is due October 19, 2015, at Noon. EECS 16A Designing Informtion Devices nd Systems I Fll 2015 Annt Shi, Ali Niknejd Homework 7 This homework is due Octoer 19, 2015, t Noon. 1. Circuits with cpcitors nd resistors () Find the voltges cross

More information

Connected-components. Summary of lecture 9. Algorithms and Data Structures Disjoint sets. Example: connected components in graphs

Connected-components. Summary of lecture 9. Algorithms and Data Structures Disjoint sets. Example: connected components in graphs Prm University, Mth. Deprtment Summry of lecture 9 Algorithms nd Dt Structures Disjoint sets Summry of this lecture: (CLR.1-3) Dt Structures for Disjoint sets: Union opertion Find opertion Mrco Pellegrini

More information

Lecture 08: Feb. 08, 2019

Lecture 08: Feb. 08, 2019 4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny

More information

Acceptance Sampling by Attributes

Acceptance Sampling by Attributes Introduction Acceptnce Smpling by Attributes Acceptnce smpling is concerned with inspection nd decision mking regrding products. Three spects of smpling re importnt: o Involves rndom smpling of n entire

More information

Reading from Young & Freedman: For this topic, read the introduction to chapter 24 and sections 24.1 to 24.5.

Reading from Young & Freedman: For this topic, read the introduction to chapter 24 and sections 24.1 to 24.5. PHY1 Electricity Topic 5 (Lectures 7 & 8) pcitors nd Dielectrics In this topic, we will cover: 1) pcitors nd pcitnce ) omintions of pcitors Series nd Prllel 3) The energy stored in cpcitor 4) Dielectrics

More information

Formal Languages and Automata

Formal Languages and Automata Moile Computing nd Softwre Engineering p. 1/5 Forml Lnguges nd Automt Chpter 2 Finite Automt Chun-Ming Liu cmliu@csie.ntut.edu.tw Deprtment of Computer Science nd Informtion Engineering Ntionl Tipei University

More information

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4 Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one

More information

2. VECTORS AND MATRICES IN 3 DIMENSIONS

2. VECTORS AND MATRICES IN 3 DIMENSIONS 2 VECTORS AND MATRICES IN 3 DIMENSIONS 21 Extending the Theory of 2-dimensionl Vectors x A point in 3-dimensionl spce cn e represented y column vector of the form y z z-xis y-xis z x y x-xis Most of the

More information

Exam 1 Solutions (1) C, D, A, B (2) C, A, D, B (3) C, B, D, A (4) A, C, D, B (5) D, C, A, B

Exam 1 Solutions (1) C, D, A, B (2) C, A, D, B (3) C, B, D, A (4) A, C, D, B (5) D, C, A, B PHY 249, Fll 216 Exm 1 Solutions nswer 1 is correct for ll problems. 1. Two uniformly chrged spheres, nd B, re plced t lrge distnce from ech other, with their centers on the x xis. The chrge on sphere

More information

Bridging the gap: GCSE AS Level

Bridging the gap: GCSE AS Level Bridging the gp: GCSE AS Level CONTENTS Chpter Removing rckets pge Chpter Liner equtions Chpter Simultneous equtions 8 Chpter Fctors 0 Chpter Chnge the suject of the formul Chpter 6 Solving qudrtic equtions

More information

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations. Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one

More information

The practical version

The practical version Roerto s Notes on Integrl Clculus Chpter 4: Definite integrls nd the FTC Section 7 The Fundmentl Theorem of Clculus: The prcticl version Wht you need to know lredy: The theoreticl version of the FTC. Wht

More information

Chapters 4 & 5 Integrals & Applications

Chapters 4 & 5 Integrals & Applications Contents Chpters 4 & 5 Integrls & Applictions Motivtion to Chpters 4 & 5 2 Chpter 4 3 Ares nd Distnces 3. VIDEO - Ares Under Functions............................................ 3.2 VIDEO - Applictions

More information

Shear and torsion interaction of hollow core slabs

Shear and torsion interaction of hollow core slabs Competitive nd Sustinble Growth Contrct Nº G6RD-CT--6 Sher nd torsion interction of hollow core slbs HOLCOTORS Technicl Report, Rev. Anlyses of hollow core floors December The content of the present publiction

More information

Lecture 20: Numerical Integration III

Lecture 20: Numerical Integration III cs4: introduction to numericl nlysis /8/0 Lecture 0: Numericl Integrtion III Instructor: Professor Amos Ron Scribes: Mrk Cowlishw, Yunpeng Li, Nthnel Fillmore For the lst few lectures we hve discussed

More information

3 Regular expressions

3 Regular expressions 3 Regulr expressions Given n lphet Σ lnguge is set of words L Σ. So fr we were le to descrie lnguges either y using set theory (i.e. enumertion or comprehension) or y n utomton. In this section we shll

More information

Numerical Analysis: Trapezoidal and Simpson s Rule

Numerical Analysis: Trapezoidal and Simpson s Rule nd Simpson s Mthemticl question we re interested in numericlly nswering How to we evlute I = f (x) dx? Clculus tells us tht if F(x) is the ntiderivtive of function f (x) on the intervl [, b], then I =

More information

QUADRATURE is an old-fashioned word that refers to

QUADRATURE is an old-fashioned word that refers to World Acdemy of Science Engineering nd Technology Interntionl Journl of Mthemticl nd Computtionl Sciences Vol:5 No:7 011 A New Qudrture Rule Derived from Spline Interpoltion with Error Anlysis Hdi Tghvfrd

More information

Minimal DFA. minimal DFA for L starting from any other

Minimal DFA. minimal DFA for L starting from any other Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA

More information

UNIVERSITY OF CALIFORNIA, BERKELEY College of Engineering Department of Electrical Engineering and Computer Sciences

UNIVERSITY OF CALIFORNIA, BERKELEY College of Engineering Department of Electrical Engineering and Computer Sciences UNIVERSITY OF CALIFORNIA, BERKELEY College of Engineering Deprtment of Electricl Engineering nd Computer Sciences Eld Alon Homework #3 Solutions EECS4 PROBLEM : CMOS Logic ) Implement the logic function

More information

Operations with Polynomials

Operations with Polynomials 38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: How to identify the leding coefficients nd degrees of polynomils How to dd nd subtrct polynomils How to multiply polynomils

More information

Surface maps into free groups

Surface maps into free groups Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The

More information

4.4 Areas, Integrals and Antiderivatives

4.4 Areas, Integrals and Antiderivatives . res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order

More information

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz

More information

ECE 327 Solution to Midterm 2016t1 (Winter)

ECE 327 Solution to Midterm 2016t1 (Winter) ECE 7 Solution to Midterm 6t (Winter) All requests for re-mrks must be submitted in writing to Mrk Agrd before 8:m on ridy Mrch. A rndom collection of midterms were scnned. Exms tht re submitted for re-mrking

More information

Chapter E - Problems

Chapter E - Problems Chpter E - Prolems Blinn College - Physics 2426 - Terry Honn Prolem E.1 A wire with dimeter d feeds current to cpcitor. The chrge on the cpcitor vries with time s QHtL = Q 0 sin w t. Wht re the current

More information

12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2016

12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2016 CS125 Lecture 12 Fll 2016 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple

More information

Potential Changes Around a Circuit. You must be able to calculate potential changes around a closed loop.

Potential Changes Around a Circuit. You must be able to calculate potential changes around a closed loop. Tody s gend: Potentil Chnges Around Circuit. You must e le to clculte potentil chnges round closed loop. Electromotive force (EMF), Terminl Voltge, nd Internl Resistnce. You must e le to incorporte ll

More information

Combinational Logic. Precedence. Quick Quiz 25/9/12. Schematics à Boolean Expression. 3 Representations of Logic Functions. Dr. Hayden So.

Combinational Logic. Precedence. Quick Quiz 25/9/12. Schematics à Boolean Expression. 3 Representations of Logic Functions. Dr. Hayden So. 5/9/ Comintionl Logic ENGG05 st Semester, 0 Dr. Hyden So Representtions of Logic Functions Recll tht ny complex logic function cn e expressed in wys: Truth Tle, Boolen Expression, Schemtics Only Truth

More information

2.4 Linear Inequalities and Interval Notation

2.4 Linear Inequalities and Interval Notation .4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or

More information

The Trapezoidal Rule

The Trapezoidal Rule _.qd // : PM Pge 9 SECTION. Numericl Integrtion 9 f Section. The re of the region cn e pproimted using four trpezoids. Figure. = f( ) f( ) n The re of the first trpezoid is f f n. Figure. = Numericl Integrtion

More information

Chapter 0. What is the Lebesgue integral about?

Chapter 0. What is the Lebesgue integral about? Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous

More information

New data structures to reduce data size and search time

New data structures to reduce data size and search time New dt structures to reduce dt size nd serch time Tsuneo Kuwbr Deprtment of Informtion Sciences, Fculty of Science, Kngw University, Hirtsuk-shi, Jpn FIT2018 1D-1, No2, pp1-4 Copyright (c)2018 by The Institute

More information

Exercise 5.5: Large-scale log-normal fading

Exercise 5.5: Large-scale log-normal fading Exercise 5.5: Lrge-scle log-norml fding Since the system is designed to hndle propgtion loss of 135 db, outge will hppen when the propgtion loss is 8 db higher thn the deterministic loss of 17 db 135 17

More information

Special Relativity solved examples using an Electrical Analog Circuit

Special Relativity solved examples using an Electrical Analog Circuit 1-1-15 Specil Reltivity solved exmples using n Electricl Anlog Circuit Mourici Shchter mourici@gmil.com mourici@wll.co.il ISRAE, HOON 54-54855 Introduction In this pper, I develop simple nlog electricl

More information

Network Analysis and Synthesis. Chapter 5 Two port networks

Network Analysis and Synthesis. Chapter 5 Two port networks Network Anlsis nd Snthesis hpter 5 Two port networks . ntroduction A one port network is completel specified when the voltge current reltionship t the terminls of the port is given. A generl two port on

More information