Distributed Sleep Transistor Network for Power Reduction

Size: px
Start display at page:

Download "Distributed Sleep Transistor Network for Power Reduction"

Transcription

1 11.3 Dstrbuted Sleep Transstor Network for Power Reducton Changbo Long ECE Department Unversty of Wsconsn, Madson Le He EE Department UCLA ABSTRACT Sleep transstors are effectve to reduce dynamc and leakage power. The cluster-based desgn was proposed to reduce the transstor area by clusterng gates to mnmze the smultaneous swtchng current per cluster and then nsertng a transstor per cluster. In the paper, we propose a novel dstrbuted transstor network (DSTN), and show that DSTNs ntrnscally better than the clusterbased desgn n terms of the transstor area and crcut performance. We reveal propertes of optmal DSTN desgns, and then develop an effcent algorthm for gate level DSTNsynthess. The algorthm obtans DSTNdesgns wth up to 70.7% transstor area reducton compared to cluster-based desgns. Furthermore, we present custom layout desgns to verfy the area reducton by DSTN. Categores and Subject Descrptors B.7.1 [Integrated Crcuts]: Types and Desgn Styles. General Terms Desgn. 1. INTRODUCTION Lowerng supply voltage s effectve for power reducton because of the quadratc relatonshp between supply voltage and dynamc power consumpton. To compensate the performance loss due to a lower supply voltage, transstor s threshold voltage V t should be also reduced, whch causes exponentally ncrease n the sub-threshold leakage current [1]. Mult-threshold CMOS (MTCMOS, see fgure 1) has been ntroduced wth low V t modules connected to ground through hgh V t transstors called transstors [2]. The Ths research s partally supported by NSF CAREER Award , SRC grant HJ-1008, and a grant from Intel. We used computers donated by Hewlett-Packard, Intel and SUNMcrosystems. Address comments to lhe@ee.ucla.edu. Permsson to make dgtal or hard copes of all or part of ths work for personal or classroom use s granted wthout fee provded that copes are not made or dstrbuted for proft or commercal advantage and that copes bear ths notce and the full ctaton on the frst page. To copy otherwse, to republsh, to post on servers or to redstrbute to lsts, requres pror specfc permsson and/or a fee. DAC 2003, June 2 6, 2003, Anahem, Calforna, USA. Copyrght 2003 ACM /03/ $5.00. transstor s turned off to reduce dynamc and leakage power n the standby mode, and s turned on to retan functonaltes n the actve mode. ates V dd V st Vrtual Ground Sleep transstor Fgure 1: MTCMOS crcut structure In ths paper, we propose a novel dstrbuted transstor network (DSTN) wth nherent advantages n area and performance compared to module-based and cluster-based transstor desgns [3, 4]. We wll dscuss background knowledge n Secton 2, ntroduce the concept of DSTNn Secton 3, and propose a gate-level DSTNsynthess methodology n Secton 4. We wll present experments of gate-level synthess and custom layout desgn n Secton 5 and conclude n secton 6. Proofs of all theorems can be found n the techncal report[5]. 2. BACKGROUND When transstors are absent, the propagaton delay for a CMOS gate can be approxmated by T pd C LV dd (V dd V tl) α, (1) where C L s the load capactance, V tl s the threshold voltage n the low V t module, and α s the velocty saturaton ndex for modelng short channel effects [6]. When the transstor s present and the source dran voltage drop s V st, the gate propagaton delay ncreases to T pd MT C LV dd (V dd V st v tl) α. (2) In order to measure the ncrease n propagaton delay, the followng performance loss (PL) s defned [4]: PL = T pd T pd MT. (3) 181

2 Accordng to the analyss n [4], for PL = δ, wehave V st = δ(v dd V tl), (4) R st = δ(v dd V tl) I st, (5) ( W L )st = I st δµ nc ox(v dd V tl)(v dd V th), (6) where I st s the swtchng current n the low V t module, V th s the threshold voltage of the transstor and s hgher than V tl n the low V t module (we assume V tl = 350mV and V th = 500mV n ths paper), and R st s the channel resstance of the transstor n the lnear-operaton regon. The tolerable performance loss can be dfferent among transstors. For example, f all the gates n a partcular low V t module are not n the crtcal path, large performance loss n ths module s acceptable as long as the module does not become a part of the crtcal path. For the smplcty of presentaton, we assume n ths paper that all modules share the same PL value. On the other hand, I st s dfferent wth respect to dfferent nput vectors. To guarantee that the PL constrant holds for all possble nput vectors, the maxmum smultaneous swtchng current (MSSC) should be used to replace I st n (6) to calculate the sze of the transstor. Our work s nspred by the followng MSSC analyss. In cluster-based desgns [4], one cluster of gates share one transstor. The area of the transstor st s proportonal to MSSC(c ), where c P denotes a cluster. If transstors are deally szed, the total area A of all transstors s proportonal to MSSC(c),.e., A = k P MSSC(c) wthk beng a constant. On the other hand, the entre crcut s accommodated only by one large transstor n module-based desgns [3]. The deal sze of ths transstor P s k MSSC(ckt), where MSSC(ckt) s MSSC of the entre crcut. Note that MSSC(ckt) smuch smaller than MSSC(c) when the cluster sze s small. For example, consder an extreme case that every cluster contans only one gate. P MSSC(c) s the sum of the peak current for all gates. MSSC(ckt) sthesumofpeak current for those gates that smultaneously swtch under a same nput vector. Snce only a small part of gates can swtch smultaneously, MSSC(ckt) s much smaller than P MSSC(ct). Therefore, the module-based desgn saves transstor area compared to the cluster-based desgn. Let vrtual-ground wres be nterconnects connectng the transstor to low-v t gates. The above analyss does not consder the vrtual-ground wres. The module-based desgn, however, leads to long vrtual-ground wres as ponted out n [4]. The ncreased resstance of vrtual-ground wres has to be compensated by more area n the transstor. Such overhead can be avoded by havng a local transstor per cluster, and transstor area can be further reduced by clusterng gates to mnmze the MSSC n the cluster. Mnmzng MSSC ntroduces extra constrants for placement, and may conflct wth tmng-drven placement. In the next secton, we wll propose our DSTNdesgn, and show that DSTNhas a reduced area for both transstors and vrtual-ground wres, and s compatble wth tmng-drven placement. Owng to the fact that the clusterbased desgn s better than the module-based desgn [4], we compare DSTNmanly wth cluster-based desgn n the rest of the paper. 3. SLEEP TRANSISTOR NETWORK We llustrate the cluster-based transstor desgn n fgure 2.(a), where gates n a cluster are connected to the transstor for ths cluster by vrtual-ground wres. Vrtualground wres of dfferent clusters are not connected. By addng more wres to form a mesh contanng all vrtualground wres, we obtan the DSTNstructure n fgure 2.(b). We assume that all transstors share a common control sgnal n both desgns. Gates VDD Sleep Transstor (a) Vrtual Ground Tappng Pont (b) Vrtual Ground Fgure 2: (a) Cluster-based desgn, and (b) Dstrbuted transstor network Module 1 Dschargng current Dschargng current Transstor 1 Transstor 2 Module 2 Module 3 Dschargng current Transstor 3 Fgure 3: Current dschargng balance n DSTN We wll show that DSTNreduces the transstor area compared to the cluster-based desgn. The area savng can be explaned by the dschargng current balance phenomenon. As shown n fgure 3, the swtchng current n module 2 s larger than those n module 1 and module 3. When dschargng current flows over transstors, the voltage drop n transstor 2 tends to be larger than the voltage drop n transstor 1 and 3, whch causes a part of current from module 2 flowng to transstors 1 and 3 1. The total area of all the transstors n DSTNcan thus be sgnfcantly reduced wth presence of such current dschargng balance. However, owng to the parastc resstance and capactance n vrtual-ground wres, the total transstor area should be larger than the followng MSSC(ckt) δµ nc ox(v dd V tl)(v dd V th), (7) whch s the optmum area for the sngle transstor n the module-based desgn ntroduced n [3], and also the deal total transstor area n DSTN. 1 A smlar dschargng current balance has been dscussed n P/G modelng [7]. 182

3 Addtonal connecton for STN MSSC(Cluster) Sleep transstor Path connectng transstors Low Vt Module R Rst Fgure 4: Physcal desgn of the STN Fgure 5: Resstance network modelng of the DSTN The routng area overhead s a crucal aspect for all three types of transstor desgn because every gate n the crcut has to be connected to a transstor. Dfferent transstor desgns mpose dfferent requrements for routng n terms of wre length and wre sze. We assume n ths paper that transstors are connected to the deal ground. Although DSTNand the module-based desgn may have the same topology for vrtual-ground wres, the wre sze for DSTNs found to be smaller due to the proxmty of transstors. On the other hand, DSTNneeds more vrtual-ground wre segments than the cluster-based desgn. As llustrated by the DSTNlayout n fgure 4, where the dotted lnes are vrtual-ground wres nsde modules and are requred by both DSTNand cluster-based desgn. Sold lnes are vrtual-ground wres that are needed by DSTN. These sold lnes are short for compacted layout desgn. When the chp has a few solated compacted layout regons such as IP-blocks n system-on-chp desgns, we can smply apply ndvdual DSTNnsde each IP-block wthout ntroducng extralongvrtual-groundwres. Furthermore, ntroducng cluster methodologes n the transstor desgn can affect placement. A good clusterng soluton mnmzng the cluster MSSC s crucal to reducng transstor area n the cluster-based desgn. Such clusterng helps DSTNas well. However, our experments to be presented shows that DSTNwthout cluster current mnmzaton acheves sgnfcant transstor area reducton compared to the cluster-desgn wth cluster current mnmzaton. Due to the adverse effect of MSSC mnmzaton on tmng-drven placement, we suggest not applyng cluster current mnmzaton to DSTN. 4. GATE LEVEL DSTN DESIGN In ths secton, we frst present the DSTNmodelng, then formulate and solve the DSTNszng problem. In order to compare dfferent desgn styles, we wll also ntroduce a rgorous algorthm for cluster-based transstor desgn. 4.1 DSTN modelng We model both transstors and vrtual-ground wres as resstors. Therefore, DSTNcan be modeled as a resstance network shown n fgure 5, wth resstance R st for a transstor and R for a vrtual-ground nterconnect. Note that R s needed to accurately model the dscharge current balance. Exact estmaton of R, however, requres detaled layout nformaton. In gate level desgn, we assume that R s unform for each wre. Specfcally, we assume that the wre resstance s 0.05Ω/µm. We consder vrtual-ground wres that are 200µm and 1000µm long,.e., we consder R = 10Ω and 50Ω, respectvely. Gven our assumpton that each cluster has about sx gates (decded by the typcal transstor sze n secton 4.2), 200µm s a conservatve estmaton for vrtual-ground wres between clusters, and 1000µm serves as the worst-case scenaro to analyze the mpact of R. 4.2 DSTN szng Problem formulaton We assume n ths paper that the topology of DSTNs defned as apror, and formulate the followng DSTNszng problem: Formulaton 1. DSTN szng problem(dstn-sp): For gven DSTN topology, the DSTN-SP problem fnds a sze for every transstor n DSTN such that the total area of DSTN s mnmzed and the PL constrant s satsfed for every cluster. Note that DSTN szng s totally dfferent from the transstor szng n the cluster-based desgn. The sze of the transstor n the cluster-based desgn s solely determned by the MSSC of the accommodated cluster. Owng to dschargng current balance n DSTN, the sze of a transstor n DSTNdepends on the current gong through the accommodated cluster, the adjacent clusters, and even non-adjacent clusters. Ths makes the DSTNszng problem much harder than the szng problem of the cluster-based desgn. More precsely, DSTNcan be modeled by a resstance network, and then the accurate transstor szng can be obtaned by algorthms smlar to P/G szng algorthms n [8]. We expect that well-desgned heurstcs may as well lead to good solutons, but n a more effcent fashon. We reveal below a few mportant propertes n order to develop effectve heurstcs Propertes Note that our propertes are based on an mportant observaton about the resstance network: R s normally much smaller than R st. The channel resstance of the transstor n the lnear-operaton regon s 1 R st = µ nc ox(v dd V ( L ). (8) th) W We assume V th = 500mV, a typcal transstor n DSTNhas W =6,andV L dd =1.3V n 100nm technology. 183

4 Thus, the typcal resstance value for R st s around 218 Ω. On the other hand, a 200µm long vrtual-ground wre has R of about 10Ω n 100nm technology. Therefore, t s reasonable to assume that R st s much larger then R. Theorem 1. Assumng R =0and PL = δ, the total transstor area n DSTN s determned by: X ( W L ) = MSSC(ckt) δµ nc ox(v dd V tl)(v dd V th) When R = 0, all transstors n DSTNcan be vewed as one sngle transstor wth channel resstance and (W/L) of: 1 R = (10) P W L =X 1/Rst (9) ( W L )st (11) Because the current of the entre crcut goes through ths sngle transstor, the followng equaton holds: W L = MSSC(ckt) δµ nc ox(v dd V tl)(v dd V th) Combnng (12) and (11) leads to (9). We can also prove: (12) Theorem 2. To mantan PL as a constant, the total area of DSTN ncreases when R ncreases. As R ncreases, the effectve resstance seen by the current source at each tappng pont ncreases. Thus, the voltage drop n the transstor ncreases when the current s constant. To mantan PL as a constant, the transstor resstance has to be decreased, whch results n more area consumpton n DSTN. The total area of DSTNcan be roughly determned by Theorems1and2together.IfR = 0, the total area of the DSTNs gven by (9). However, accordng to Theorem 2, the total transstor area n DSTNmust be larger than the value n (9). Nevertheless, the effectve resstance ncrease at the tappng pont s lmted because R s much smaller than R st. The ncrease of transstor area n DSTNs therefore lmted. Theorem 3. Assumng the current I that flows nto each tappng pont t beng constant and the total area of the DSTN gven, every transstor st accommodatng t should be szed proportonal to current I n order to mnmze the maxmum voltage drop among all transstors. Note that Theorem 3 s an deal case to allocate area to ndvdual transstors n DSTN. Although the current at each tappng pont t s not constant n real desgns, Theorem 3 helps gudng the desgn of our DSTNtransstor szng scheme below Algorthm The overall flow of the transstor szng scheme s descrbed as follows. We frst calculate MSSC(ckt) for example by genetc algorthm [9]. We then compute the total area n DSTNaccordng to the followng formula: MSSC(ckt) A =(1+β) δµ nc ox(v dd V tl)(v dd V. (13) th) Our experment shows that β should range from 0.05 to 0.5 and a larger β should be used for a bgger crcut. Fnally, accordng to Theorem 3, the total DSTNarea s allocated to each transstor st proportonally to the correspondent cluster MSSC. 4.3 Cluster based transstor nserton The total area of transstors for the cluster-based transstor P P desgn s proportonal to MSSC(c). Clusterng together gates wth dfferent swtchng tmes helps reduce MSSC(c), and n turn reduce the total area of transstors. The cluster based transstor nserton problem s formulated as follows, Formulaton 2. Cluster based transstor nserton: Gven a crcut and cluster sze, partton gates nto clusters such that the sum of MSSC for these clusters, and n turn the total area of all transstors s mnmzed. A cluster-based desgn methodology has been proposed wth placement constrants [4]. In ths paper, we target at reachng the P maxmum potental of transstor area reducton. Therefore we propose to apply smulated annealng (SA) for MSSC(c) mnmzaton wthout placement constrants. In SA, each cluster s assocated wth a cost of MSSC. The cost for the entre crcut s the sum of costs for all clusters. The objectve s to mnmze the cost for the entre crcut. We take advantage of the freedom that a gate can be assgned to any cluster. Specfcally, two gates are randomly pcked from two clusters and exchanged n each move. We start SA from temperature of 100 and termnate at 0.1. The number of moves at a partcular temperature s 200x of the number of clusters n the crcut. After these moves, the temperature s decreased by a factor of Cluster MSSC calculaton The prmary objectve of MSSC calculaton s to search the nput vector space to dentfy the maxmum swtchng current value. The genetc algorthm(ga) based [9] and automatc test pattern generaton(atpg) based algorthm[10] have been developed for MSSC estmaton. We employ GA algorthm to calculate the MSSC for the entre module n ths paper. However, GA algorthm s neffcent to calculate MSSC for a large number of clusters. Therefore, we propose an effcent heurstc algorthm for cluster MSSC calculatons n ths secton. The reader who s only nterested n experments may skp secton 4.4. MSSC estmaton searches for the maxmum current value consderng both swtchng tme and nput vector. In order to smplfy the problem, we frst solve the MSSC estmaton problem at a fxed tme, that s, we frst estmate MSSC(c, t) based on a small number of random smulatons. For example, we want to estmate the maxmum current for the cluster of gates G1 to G7. We frst smulate the cluster for a number of random nput vectors. The swtchng actvtes at tme t for all gates n all smulatons can be encoded n a table shown n fgure 6, where 1 stands for swtchng and 0 means no swtchng. For example, row S1 (.e., smulaton S1) means that G1, G2 and G6 swtch whle G3, G4,G5orG7donotswtch. AlthoughG3,G4,G5and G7 never swtch smultaneously wth G1, G2 and G6 at S1, they may swtch smultaneously wth G1, G2 and G6 under 184

5 S1 S2 S3 S4 S30 S31 S32 S33 G1 G2 G3 G4 G5 G6 G G1G2G {G1G2G4, G1G4G6, G2G4G6} G2G4G G1G4G Fgure 6: Database contanng pre-smulatons for cluster MSSC other nput vectors. In ths case, the swtchng current at those nput vectors s larger than the one n S1. We want to capture ths potental and expand the lst of smultaneous swtchng gates as much as we can. We llustrate the dea of expandng smultaneous swtchng lsts by usng lst S1, n whch the smultaneous swtchng gates are G1, G2 and G6. Instead of checkng whether G4 can swtch smultaneously wth G1, G2 and G6, we check whether all the combnatons of three gates,.e., G1G2G4, G1G4G6 and G2G4G6 canswtchsmultaneously. Asshownnfgure6,G1G2G4, G2G4G6 and G1G4G6 do happen n S3, S30 and S33. Thus, G4 has a large potental to swtch smultaneously wth G1, G2 and G6. G4 s then set to be swtchng at S1 and the swtchng current of G4 s added nto the total swtchng current of S1. The swtchng lst for each smulaton s expanded untl no more expanson s possble. The maxmum current value among all the smulatons s MSSC(c, t). Overall, our method for cluster MSSC estmaton contans two phases. In the frst phase, we carry out a number of random smulatons and choose the tme (called peak tme) for the peak current of each smulaton. In the second phase, we apply the above MSSC(c, t) for every peak tme. 5. EXPERIMENT RESULTS 5.1 Gate level synthess All proposed algorthms have been mplemented nsde SIS[11] envronment. We use ISCAS benchmark crcuts and report experment results n Table 1. A gate-level smulator has also been mplemented to calculate voltages and current waveforms. Parameters needed to smulate a crcut, such as gate delay, loadng capactance, and swtchng current, are all extracted from SPICE smulatons and bult nto tables. Smulaton results from our smulator are wthn 20% dfference from SPICE smulatons, but t s much faster than the SPICE smulaton. Ths smulator was used to verfy the gate level synthess n ths sub-secton. We frst compare the area (.e., transstor wdth) used by DSTNand cluster-based desgn (CB-STD), respectvely. We measure area by the total channel wdth of transstors. One can see that DSTNuses sgnfcantly smaller area than CB-STD does. On average, the area reducton s 49.8%. Because we do not consder the delay constrant durng placement for CB-STD, we obtan a lower bound of the cluster MSSC n a tmng-drven placement and n turn a lower bound of the transstor area n CB-STD. Therefore, the area reducton by DSTNwould be larger compared to CB-STD f consderng practcal placement constrants. We then compare performance loss. We have used extensve random smulatons to verfy the qualty for both szng schemes. Specfcally, 10,000 random smulatons for each crcut have been conducted to calculate the maxmum PL (n short, MPL) for each crcut. For DSTN, the peak current for each module n each smulaton s appled to the resstance network as the current source. We compute the transstor channel resstance by (8), and use R = 10Ω and 50Ω for vrtual-ground wres. The resultng resstance network s solved by a sparse lnear equaton solver ntegrated wth SIS. The calculated voltages at tappng ponts are used to compute the performance loss va (3). Note that the resultng MPL value n Table 1 s an upper bound of MPL for the followng reasons: () the above R values are conservatve as dscussed n Secton 4.1. () the peak current for an ndvdual module normally happens at dfferent tmes, but we assume that all the peak current happens at the same tme n our experment. The same random smulatons have been appled to calculate MPL n CB-STD, where PL s calculated va (6). Although the peak current value s also used to calculate MPL, t wll not overestmate the PL because each module only dscharge from one transstor n CB-STD. Instead, gnorng the resstance of vrtual ground n CB-STD leads to a lower bound estmaton. As shown n Table 1, when R = 10Ω (a conservatve case as dscussed n Secton 4.1), MPL of DSTNs on average 10% smaller than that of CB-STD. When R = 50Ω,.e., an extreme worst-case scenaro as dscussed n Secton 4.1, MPL of DSTNs about 6% worse than CB-STD. However, R s normally 5 15 Ω n 100nm technology when the cluster sze s 6. Furthermore, the MPL presented n Table 1 s an upper bound of the real MPL n DSTN, and s a lower bound of the real MPL n CB-STD. Therefore, t s far to say that DSTNs better than CB-STD n terms of MPL. Note that MPL for both DSTN and CB-STD are larger than 5%, the PL bound n our experments. It s because the current values n a large number of random smulatons may be bgger than the estmated cluster MSSC. Ths underdesgn can be easly removed by scalng up the estmated MSSC. 5.2 Custom Layout Desgn The exact evaluaton of most parameters, such as PL and transstor area, can only be obtaned after a layout desgn. Therefore, we mplement and compare three layout desgns, transstor free(st-free) desgn, clusterbased transstor desgn(cb-std) and DSTN, for a 4- bt carry-lookahead(cla) adder. The three layout desgns are mplemented as follows. Frst, a ST-free layout, consstng of four sum modules and one CLA module, s mplemented. Then, a CB-STD layout s mplemented by parttonng each module nto 2-3 clusters and accommodatng each cluster by one transstor. Sleep transstor szes are determned by SPICE smulatons to keep PL below 5%. Fnally, we mplement a DSTNdesgn by accommodatng the entre CLA adder va sx dstrbuted transstors. All these transstors are connected 185

6 Table 1: Area and MPL for DSTN and CB-STD Crcut #Gate* #PI #PO Area (W/L) MPL(%) CB-STD DSTN Reducton CB-STD DSTN(upper bound) (%) (lower bound) R =10 R =50 C C C C C C C C C C Avg *Crcut gate number after mappng n SIS. together and have a same sze 2. As n the cluster-based desgn, szes of the transstors n DSTNare determned by SPICE smulatons to make PL below 5%. Propertes ST-free CB-STD DSTN Leakage(nA) Crtcal path delay(ns) ST area(µm 2 ) Chp area(µm 2 ) Table 2: Layout desgn comparson. As shown n Table 2, compared to the ST-free desgn, both CB-STD and DSTNacheve sgnfcant leakage current reducton but DSTNs approxmately fve tmes better than CB-STD. Both CB-STD and DSTNncrease the crtcal path delay but DSTNhas a much smaller delay than CB-STD. DSTNhas a transstor area several tmes smaller than CB-STD. These comparsons are consstent wth prevous theoretcal analyss and experment results. 6. CONCLUSION AND FUTURE WORK Sleep transstors are effectve to reduce both dynamc and leakage power. We have proposed a novel dstrbuted transstor network (DSTN), and have convncngly llustrated that DSTNhas reduced area, less supply voltage drop, and no conflct wth tmng-drven placement when compared to exstng module-based and cluster-based transstor structures. We have revealed several propertes of the optmal soluton to the DSTNszng problem, and have proposed an effectve and effcent DSTNszng algorthm based on these propertes. Based on the expermental comparson wth a rgorous cluster-based desgn, DSTN assumng conservatve vrtual-ground wres acheves on average 49.8% transstor area reducton and leads to less performance lost. Havng these advantages, DSTNcan be used to mplement power gatng for reducng dynamc and leakage power [12]. Sleep transstor can be vewed as an essental part of the power/ground network. We assume that the power/ground 2 Same sze s used because transstor area optmzaton technques for ndvdual transstors make lttle dfference n ths small crcut. network (both global and vrtual) s gven aprorn ths study, and plan to nvestgate the co-desgn of DSTNand power/ground network n the future. 7. REFERENCES [1] J. Kao, S. Narendra, and A. Chandrakasan, Subthreshold leakage modelng and reducton technques, n Proc. Int. Conf. on Computer Aded Desgn, pp , Nov [2] S.Mutah and et al., 1-v power supply hgh-speed dgtal crcut technology wth multthreshold-voltage cmos, IEEE Journal of Sold-State Crcuts, August [3] J. Kao, S. Narendra, and A. Chandrakasan, Mtcmos herarchcal szng based on mutual exclusve dscharge patterns, n DAC, [4] M. Ans, S. Areb, and M. Elmasry, Dynamc and leakage power reducton n MTCMOS crcuts usng an automated effcent gate clusterng technque, n DAC, [5] C. Long and L. He, Dstrbuted transstor network for power reducton, tech. rep., UCLA EE Dept., [6] T. Sakura and A. Newton, Alpha-power law MOSFET model and ts applcatons to CMOS nverter delay and other formulas, IEEE Journal of Sold-State Crcuts, vol. 25, pp , Aprl [7] Y.M.Jang,K.T.Cheng,andA.C.Deng, Estmatonof maxmum power supply nose for deep sub-mcron desgns, n IEEE Proc. Of Sym. On Low Power Electroncs and Desgn, pp , [8] X. D. Tan and C. J. Sh, Relablty-constraned area optmzaton of VLSI power/ground networks va sequence of lnear programmngs, n Proc. Desgn Automaton Conf, pp , [9] Y.M.Jang,K.T.Cheng,andA.Krstc, Estmatonof maxmum power and nstantaneous current usng a genetc algorthm, n Proc. IEEE Custom Integrated Crcuts Conf.., pp , May [10] A. Krstc and K. T. Cheng, Vector generaton for maxmum nstantaneous current through supply lnes for cmos crcuts, n Proc. Desgn Automaton Conf, pp , June [11] E. M. Sentovch, K. J. Sngh, L. Lavagno, and etc., Ss: a system for sequental crcut synthess, Memorandum NO. UCB/ERL M92/41, May [12] W. Lao and L. He, Leakage power modelng and reducton wth data retenton, n Proc.Int.Conf.on Computer Aded Desgn, pp ,

Coarse-Grain MTCMOS Sleep

Coarse-Grain MTCMOS Sleep Coarse-Gran MTCMOS Sleep Transstor Szng Usng Delay Budgetng Ehsan Pakbazna and Massoud Pedram Unversty of Southern Calforna Dept. of Electrcal Engneerng DATE-08 Munch, Germany Leakage n CMOS Technology

More information

Statistical Circuit Optimization Considering Device and Interconnect Process Variations

Statistical Circuit Optimization Considering Device and Interconnect Process Variations Statstcal Crcut Optmzaton Consderng Devce and Interconnect Process Varatons I-Jye Ln, Tsu-Yee Lng, and Yao-Wen Chang The Electronc Desgn Automaton Laboratory Department of Electrcal Engneerng Natonal Tawan

More information

Effective Power Optimization combining Placement, Sizing, and Multi-Vt techniques

Effective Power Optimization combining Placement, Sizing, and Multi-Vt techniques Effectve Power Optmzaton combnng Placement, Szng, and Mult-Vt technques Tao Luo, Davd Newmark*, and Davd Z Pan Department of Electrcal and Computer Engneerng, Unversty of Texas at Austn *Advanced Mcro

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Sleep Transistor Distribution in Row-Based MTCMOS Designs

Sleep Transistor Distribution in Row-Based MTCMOS Designs Sleep Transstor Dstrbuton n Row-Based MTCMOS Desgns Chanseok Hwang 1, Peng Rong 2, Massoud Pedram 3 1 Samsung Electroncs, Seoul, South Korea 2 LSI Logc Corp, Mlptas, CA, USA 3 Unversty of Southern Calforna,

More information

Clock-Gating and Its Application to Low Power Design of Sequential Circuits

Clock-Gating and Its Application to Low Power Design of Sequential Circuits Clock-Gatng and Its Applcaton to Low Power Desgn of Sequental Crcuts ng WU Department of Electrcal Engneerng-Systems, Unversty of Southern Calforna Los Angeles, CA 989, USA, Phone: (23)74-448 Massoud PEDRAM

More information

Interconnect Optimization for Deep-Submicron and Giga-Hertz ICs

Interconnect Optimization for Deep-Submicron and Giga-Hertz ICs Interconnect Optmzaton for Deep-Submcron and Gga-Hertz ICs Le He http://cadlab.cs.ucla.edu/~hele UCLA Computer Scence Department Los Angeles, CA 90095 Outlne Background and overvew LR-based STIS optmzaton

More information

Run-time Active Leakage Reduction By Power Gating And Reverse Body Biasing: An Energy View

Run-time Active Leakage Reduction By Power Gating And Reverse Body Biasing: An Energy View Run-tme Actve Leakage Reducton By Power Gatng And Reverse Body Basng: An Energy Vew Hao Xu, Ranga Vemur and Wen-Ben Jone Department of Electrcal and Computer Engneerng, Unversty of Cncnnat Cncnnat, Oho

More information

Leakage and Dynamic Glitch Power Minimization Using Integer Linear Programming for V th Assignment and Path Balancing

Leakage and Dynamic Glitch Power Minimization Using Integer Linear Programming for V th Assignment and Path Balancing Leakage and Dynamc Gltch Power Mnmzaton Usng Integer Lnear Programmng for V th Assgnment and Path Balancng Yuanln Lu and Vshwan D. Agrawal Auburn Unversty, Department of ECE, Auburn, AL 36849, USA luyuanl@auburn.edu,

More information

Appendix B: Resampling Algorithms

Appendix B: Resampling Algorithms 407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles

More information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information

Lab 2e Thermal System Response and Effective Heat Transfer Coefficient

Lab 2e Thermal System Response and Effective Heat Transfer Coefficient 58:080 Expermental Engneerng 1 OBJECTIVE Lab 2e Thermal System Response and Effectve Heat Transfer Coeffcent Warnng: though the experment has educatonal objectves (to learn about bolng heat transfer, etc.),

More information

Chapter Newton s Method

Chapter Newton s Method Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve

More information

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments

More information

The optimal delay of the second test is therefore approximately 210 hours earlier than =2.

The optimal delay of the second test is therefore approximately 210 hours earlier than =2. THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple

More information

Variability-Driven Module Selection with Joint Design Time Optimization and Post-Silicon Tuning

Variability-Driven Module Selection with Joint Design Time Optimization and Post-Silicon Tuning Asa and South Pacfc Desgn Automaton Conference 2008 Varablty-Drven Module Selecton wth Jont Desgn Tme Optmzaton and Post-Slcon Tunng Feng Wang, Xaoxa Wu, Yuan Xe The Pennsylvana State Unversty Department

More information

A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS

A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS Shervn Haamn A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS INTRODUCTION Increasng computatons n applcatons has led to faster processng. o Use more cores n a chp

More information

Department of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution

Department of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution Department of Statstcs Unversty of Toronto STA35HS / HS Desgn and Analyss of Experments Term Test - Wnter - Soluton February, Last Name: Frst Name: Student Number: Instructons: Tme: hours. Ads: a non-programmable

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

Reliable Power Delivery for 3D ICs

Reliable Power Delivery for 3D ICs Relable Power Delvery for 3D ICs Pngqang Zhou Je Gu Pulkt Jan Chrs H. Km Sachn S. Sapatnekar Unversty of Mnnesota Power Supply Integrty n 3D Puttng the power n s as mportant as gettng the heat out Hgher

More information

( ) = ( ) + ( 0) ) ( )

( ) = ( ) + ( 0) ) ( ) EETOMAGNETI OMPATIBIITY HANDBOOK 1 hapter 9: Transent Behavor n the Tme Doman 9.1 Desgn a crcut usng reasonable values for the components that s capable of provdng a tme delay of 100 ms to a dgtal sgnal.

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

Estimating Delays. Gate Delay Model. Gate Delay. Effort Delay. Computing Logical Effort. Logical Effort

Estimating Delays. Gate Delay Model. Gate Delay. Effort Delay. Computing Logical Effort. Logical Effort Estmatng Delas Would be nce to have a back of the envelope method for szng gates for speed Logcal Effort ook b Sutherland, Sproull, Harrs Chapter s on our web page Gate Dela Model Frst, normalze a model

More information

Module 9. Lecture 6. Duality in Assignment Problems

Module 9. Lecture 6. Duality in Assignment Problems Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

More information

Formulas for the Determinant

Formulas for the Determinant page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use

More information

A Robust Method for Calculating the Correlation Coefficient

A Robust Method for Calculating the Correlation Coefficient A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal

More information

CHAPTER 13. Exercises. E13.1 The emitter current is given by the Shockley equation:

CHAPTER 13. Exercises. E13.1 The emitter current is given by the Shockley equation: HPT 3 xercses 3. The emtter current s gen by the Shockley equaton: S exp VT For operaton wth, we hae exp >> S >>, and we can wrte VT S exp VT Solng for, we hae 3. 0 6ln 78.4 mv 0 0.784 5 4.86 V VT ln 4

More information

Chapter 13: Multiple Regression

Chapter 13: Multiple Regression Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

Department of Electrical & Electronic Engineeing Imperial College London. E4.20 Digital IC Design. Median Filter Project Specification

Department of Electrical & Electronic Engineeing Imperial College London. E4.20 Digital IC Design. Median Filter Project Specification Desgn Project Specfcaton Medan Flter Department of Electrcal & Electronc Engneeng Imperal College London E4.20 Dgtal IC Desgn Medan Flter Project Specfcaton A medan flter s used to remove nose from a sampled

More information

Lecture 4: Adders. Computer Systems Laboratory Stanford University

Lecture 4: Adders. Computer Systems Laboratory Stanford University Lecture 4: Adders Computer Systems Laboratory Stanford Unversty horowtz@stanford.edu Copyrght 2004 by Mark Horowtz (w/ Fgures from Hgh-Performance Mcroprocessor Desgn IEEE And Fgures from Bora Nkolc 1

More information

Annexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances

Annexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton

More information

VQ widely used in coding speech, image, and video

VQ widely used in coding speech, image, and video at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1 P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the

More information

Analysis of Queuing Delay in Multimedia Gateway Call Routing

Analysis of Queuing Delay in Multimedia Gateway Call Routing Analyss of Queung Delay n Multmeda ateway Call Routng Qwe Huang UTtarcom Inc, 33 Wood Ave. outh Iseln, NJ 08830, U..A Errol Lloyd Computer Informaton cences Department, Unv. of Delaware, Newark, DE 976,

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

A New Design of Multiplier using Modified Booth Algorithm and Reversible Gate Logic

A New Design of Multiplier using Modified Booth Algorithm and Reversible Gate Logic Internatonal Journal of Computer Applcatons Technology and Research A New Desgn of Multpler usng Modfed Booth Algorthm and Reversble Gate Logc K.Nagarjun Department of ECE Vardhaman College of Engneerng,

More information

Week 11: Differential Amplifiers

Week 11: Differential Amplifiers ELE 0A Electronc rcuts Week : Dfferental Amplfers Lecture - Large sgnal analyss Topcs to coer A analyss Half-crcut analyss eadng Assgnment: hap 5.-5.8 of Jaeger and Blalock or hap 7. - 7.3, of Sedra and

More information

Chapter - 2. Distribution System Power Flow Analysis

Chapter - 2. Distribution System Power Flow Analysis Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load

More information

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

POWER AND PERFORMANCE OPTIMIZATION OF STATIC CMOS CIRCUITS WITH PROCESS VARIATION

POWER AND PERFORMANCE OPTIMIZATION OF STATIC CMOS CIRCUITS WITH PROCESS VARIATION POWER AND PERFORMANCE OPTIMIZATION OF STATIC CMOS CIRCUITS WITH PROCESS VARIATION Except where reference s made to the work of others, the work descrbed n ths dssertaton s my own or was done n collaboraton

More information

An Admission Control Algorithm in Cloud Computing Systems

An Admission Control Algorithm in Cloud Computing Systems An Admsson Control Algorthm n Cloud Computng Systems Authors: Frank Yeong-Sung Ln Department of Informaton Management Natonal Tawan Unversty Tape, Tawan, R.O.C. ysln@m.ntu.edu.tw Yngje Lan Management Scence

More information

Chapter 6. Supplemental Text Material

Chapter 6. Supplemental Text Material Chapter 6. Supplemental Text Materal S6-. actor Effect Estmates are Least Squares Estmates We have gven heurstc or ntutve explanatons of how the estmates of the factor effects are obtaned n the textboo.

More information

arxiv:cs.cv/ Jun 2000

arxiv:cs.cv/ Jun 2000 Correlaton over Decomposed Sgnals: A Non-Lnear Approach to Fast and Effectve Sequences Comparson Lucano da Fontoura Costa arxv:cs.cv/0006040 28 Jun 2000 Cybernetc Vson Research Group IFSC Unversty of São

More information

Supporting Information

Supporting Information Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to

More information

CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION

CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING N. Phanthuna 1,2, F. Cheevasuvt 2 and S. Chtwong 2 1 Department of Electrcal Engneerng, Faculty of Engneerng Rajamangala

More information

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS) Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998

More information

TOPICS MULTIPLIERLESS FILTER DESIGN ELEMENTARY SCHOOL ALGORITHM MULTIPLICATION

TOPICS MULTIPLIERLESS FILTER DESIGN ELEMENTARY SCHOOL ALGORITHM MULTIPLICATION 1 2 MULTIPLIERLESS FILTER DESIGN Realzaton of flters wthout full-fledged multplers Some sldes based on support materal by W. Wolf for hs book Modern VLSI Desgn, 3 rd edton. Partly based on followng papers:

More information

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud

Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal

More information

Energy Storage Elements: Capacitors and Inductors

Energy Storage Elements: Capacitors and Inductors CHAPTER 6 Energy Storage Elements: Capactors and Inductors To ths pont n our study of electronc crcuts, tme has not been mportant. The analyss and desgns we hae performed so far hae been statc, and all

More information

Uncertainty in measurements of power and energy on power networks

Uncertainty in measurements of power and energy on power networks Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:

More information

Queueing Networks II Network Performance

Queueing Networks II Network Performance Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled

More information

Nodal analysis of finite square resistive grids and the teaching effectiveness of students projects

Nodal analysis of finite square resistive grids and the teaching effectiveness of students projects 2 nd World Conference on Technology and Engneerng Educaton 2 WIETE Lublana Slovena 5-8 September 2 Nodal analyss of fnte square resstve grds and the teachng effectveness of students proects P. Zegarmstrz

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

DUE: WEDS FEB 21ST 2018

DUE: WEDS FEB 21ST 2018 HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant

More information

Note 10. Modeling and Simulation of Dynamic Systems

Note 10. Modeling and Simulation of Dynamic Systems Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada

More information

CHAPTER 17 Amortized Analysis

CHAPTER 17 Amortized Analysis CHAPTER 7 Amortzed Analyss In an amortzed analyss, the tme requred to perform a sequence of data structure operatons s averaged over all the operatons performed. It can be used to show that the average

More information

Solving Nonlinear Differential Equations by a Neural Network Method

Solving Nonlinear Differential Equations by a Neural Network Method Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,

More information

Grover s Algorithm + Quantum Zeno Effect + Vaidman

Grover s Algorithm + Quantum Zeno Effect + Vaidman Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the

More information

Linear Feature Engineering 11

Linear Feature Engineering 11 Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19

More information

x = , so that calculated

x = , so that calculated Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

6.01: Introduction to EECS 1 Week 6 October 15, 2009

6.01: Introduction to EECS 1 Week 6 October 15, 2009 6.0: ntroducton to EECS Week 6 October 5, 2009 6.0: ntroducton to EECS Crcuts The Crcut Abstracton Crcuts represent systems as connectons of component through whch currents (through arables) flow and across

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

An Interactive Optimisation Tool for Allocation Problems

An Interactive Optimisation Tool for Allocation Problems An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents

More information

An Integrated Asset Allocation and Path Planning Method to to Search for a Moving Target in in a Dynamic Environment

An Integrated Asset Allocation and Path Planning Method to to Search for a Moving Target in in a Dynamic Environment An Integrated Asset Allocaton and Path Plannng Method to to Search for a Movng Target n n a Dynamc Envronment Woosun An Mansha Mshra Chulwoo Park Prof. Krshna R. Pattpat Dept. of Electrcal and Computer

More information

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,

More information

9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set

More information

Gated Clock Routing Minimizing the Switched Capacitance *

Gated Clock Routing Minimizing the Switched Capacitance * Gated Clock Routng Mnmzng the Swtched Capactance * Jaewon Oh and Massoud Pedram Dept. of Electrcal Engneerng Systems Unversty of Southern Calforna Los Angeles, CA 989 Tel: (3) 74-448 e-mal: [oh, massoud]@zugros.usc.edu

More information

Lecture 20: November 7

Lecture 20: November 7 0-725/36-725: Convex Optmzaton Fall 205 Lecturer: Ryan Tbshran Lecture 20: November 7 Scrbes: Varsha Chnnaobreddy, Joon Sk Km, Lngyao Zhang Note: LaTeX template courtesy of UC Berkeley EECS dept. Dsclamer:

More information

Economics 101. Lecture 4 - Equilibrium and Efficiency

Economics 101. Lecture 4 - Equilibrium and Efficiency Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of

More information

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

= z 20 z n. (k 20) + 4 z k = 4

= z 20 z n. (k 20) + 4 z k = 4 Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5

More information

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-

More information

Outline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]

Outline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1] DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm

More information

Time-Varying Systems and Computations Lecture 6

Time-Varying Systems and Computations Lecture 6 Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy

More information

Optimal Slack-Driven Block Shaping Algorithm in Fixed-Outline Floorplanning

Optimal Slack-Driven Block Shaping Algorithm in Fixed-Outline Floorplanning Optmal Slack-Drven Block Shapng Algorthm n Fxed-Outlne Floorplannng Jackey Z. Yan Placement Technology Group Cadence Desgn Systems San Jose, CA 9134 USA zyan@cadence.com Chrs Chu Department of ECE Iowa

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Which Separator? Spring 1

Which Separator? Spring 1 Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal

More information

Chapter 8 Indicator Variables

Chapter 8 Indicator Variables Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n

More information

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA 4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected

More information

A Fast Computer Aided Design Method for Filters

A Fast Computer Aided Design Method for Filters 2017 Asa-Pacfc Engneerng and Technology Conference (APETC 2017) ISBN: 978-1-60595-443-1 A Fast Computer Aded Desgn Method for Flters Gang L ABSTRACT *Ths paper presents a fast computer aded desgn method

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem

Interactive Bi-Level Multi-Objective Integer. Non-linear Programming Problem Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan

More information

Single-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition

Single-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Logical Effort of Higher Valency Adders

Logical Effort of Higher Valency Adders Logcal Effort of gher Valency Adders Davd arrs arvey Mudd College E. Twelfth St. Claremont, CA Davd_arrs@hmc.edu Abstract gher valency parallel prefx adders reduce the number of logc levels at the expense

More information

Markov Chain Monte Carlo Lecture 6

Markov Chain Monte Carlo Lecture 6 where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways

More information

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys

More information

Curve Fitting with the Least Square Method

Curve Fitting with the Least Square Method WIKI Document Number 5 Interpolaton wth Least Squares Curve Fttng wth the Least Square Method Mattheu Bultelle Department of Bo-Engneerng Imperal College, London Context We wsh to model the postve feedback

More information

A Novel, Low-Power Array Multiplier Architecture

A Novel, Low-Power Array Multiplier Architecture A Noel, Low-Power Array Multpler Archtecture by Ronak Bajaj, Saransh Chhabra, Sreehar Veeramachanen, MB Srnas n 9th Internatonal Symposum on Communcaton and Informaton Technology 29 (ISCIT 29) Songdo -

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information