Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements


 Aldous Moore
 1 years ago
 Views:
Transcription
1 Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley CA947 USA Emal: Abstract In today s deep submcron technology the couplng capactances among ndvdual onchp RC trees have essental effect on the sgnal delay and crosstalk and the nterconnects should be modeled as coupled RC trees. We provde smple explct formulas for the Elmore delay and hgher order voltage moments and a lnear order recursve algorthm for the voltage moment computaton for lumped and dstrbuted coupled RC trees. By usng the formulas and algorthms the moment matchng method can be effcently mplemented to deal wth delay and crosstalk estmaton model order reducton and optmal desgn of nterconnects. Introducton The RC tree s a typcal model for onchp nterconnects. The Elmore delay and the moment matchng method have been successfully used for the delay estmaton model order reducton and nterconnect optmzaton []. These tasks can be very effcently mplemented as there are explct formulas and a lnear order algorthm for the moment computaton of such RC trees []. In today s deep submcron technology due to the dense placement of the nterconnect wres and the large aspect rato of wre heght over wre wdth the couplng capactance between two wres may be even larger than the ground capactance of each wre and can never be neglected. In ths case the nterconnects should be modeled by several RC trees wth floatng capactors connected among the tree nodes. We call such knd of nterconnect model coupled RC trees. It s well known that the capactve couplng has sgnfcant effects on the sgnal delay and crosstalks. Unfortunately no smple formulas and lnear order algorthms have been publshed for the computaton of the Elmore delay and hgher order voltage moments of such coupled RC trees so that these effects cannot be as effcently dealt wth as n the sngle RC tree case. In the lterature three ways are often used. The frst one relys on the decouplng technque whch s typcally restrcted to some very smple cases [6 7]. The second one relys on the general methods for RC nterconnect networks [8 9] where the advantage of the tree structure s not taken so s not effcent enough. The thrd one uses very rough model e.g. usng the length of overlap between two wres as the metrc of the crosstalk[] whch s far from accurate. In ths paper we provde explct formulas and a lnear order recursve algorthm for the computaton of the Elmore delay and hgher order voltage moments of coupled RC trees consstng of lumped andor dstrbuted elements. They are based on the moment model of a capactor whch s a current source wth a known value. We use the technque of source splttng to splt each floatng current source nto two ground sources so that the coupled RC trees are decoupled durng moment computaton and the algorthm for a sngle RC tree can be appled. For dstrbuted RC lnes by usng the same model and technque for dstrbuted capactances we show that the moments of voltage and capactve current along a lne are polynomals of the coordnate of the lne. We derve recursve formulas for the coeffcent of these polynomals and set up an exact moment model for RC lnes. Wth these models we extend the lnear moment computaton algorthm for a sngle RC tree wth lumped elements to coupled RC trees wth both lumped and dstrbuted elements wthout the need of dscretzaton of the dstrbuted lnes. Ths algorthm s exact and very effcent. It s useful n the delay and crosstalk estmaton model order reducton and optmal desgn of such type of nterconnects. Coupled RC trees wth lumped elements. Defntons A set of coupled RC trees s an RC network whch conssts of a number of RC trees wth floatng capactors connected among the nonground nodes of ndvdual trees. Let be the node voltage at the th node of the th tree
2 * and ts Laplace transform. Let then s called the kth order moment of moments of currents are smlarly defned.. The Elmore delay.. Formula. The It s well known that when a unt mpulse voltage s appled to the root of the th tree and all other roots are grounded the negatve of the frst order moment s called the Elmore delay of node voltage. From the v characterstc of a capactance : and let and be the kth order moment of and respectvely we have and.e. the capactor behaves as an open crcut when the th order moment s concerned and a current source when the kth ( ) order moment s concerned. Therefore when we are concerned about the Elmore delay of all the th order voltage moments on the trees are equal to ther root voltages. Let be the tree node set of the th tree and be the pth node n then and! #"%$ '&. For the frst order moment each capactor connected to ether grounded or floatng behaves as a current source valued. Let ( be the total capactance connected to the node and ) be the total capactve current flowng out of then ts frst order moment ) +* (. Let be the path from the root of the th tree to node. and the total resstance on the path. Then the current ) * flows along path and causes a component ( for. Therefore we have 4. Also note that ( () Denote the Elmore delay of as then ( () It can be seen that the couplng capactances n the actve tree have the same contrbutons to the Elmore delay as the ground capactances do and the formulas of the Elmore delay are the same for both the sngle tree and coupled RC trees... Effect of nonzero ntal states on sgnal delay It s well known that the sgnal delay n a net s affected by the sgnals at ts neghbour[] especally when the two nets are suppled by complement dgtal sgnals at the same tme.e. one net s source voltage goes up from to and another one s from to zero. In the extreme case that the source voltage of the second net s a step down functon t s equvalent to the case that the voltage supply for the second net s zero but ts ntal states are. Now we gve a formula to show the effect of the nonzero ntal states on the Elmore delay of the sgnal propagaton n the frst net. Suppose that the th tree s n the zero ntal state and suppled by a unt mpulse voltage and let 7 be ts capactvely coupled trees wth unt valued ntal states and zero valued voltage supples. Recall that from the v characterstc of a capactor C: &8 when 49#: =>? 9< => % where a current source valued and n the opposte drecton of the capactor voltage represents the effect of the ntal state. be the total couplng capactance connected among and the nodes n the trees n BDCFE # # s the couplng capactance connected between and then there are total capactve gong along the path from ts source to node where nodes whose contrbuton to the zeroth order moment and the component of the zeroth order moment of the coupled neghbourng trees s s caused by the effect of the nonzero ntal states of () and the component of caused by the source s * I ( KMLNLOL (4) where the superscrpts "nt" and "s" refer to the effect of the ntal states and the source voltage respectvely. Now suppose that a unt step voltage s appled to the th tree then by superposton * * P ( MLNLOL QMLNLOL (5) Now the negatve coeffcent of n the parentheses ( s an "equvalent Elmore delay" t s n the set of (. Note that for each too and the effect of the couplng capactance to the Elmore delay due to the nonzero ntal states n the worst case s equvalent to doublng the capactance value. Example. For the coupled trees show n Fg. tree s suppled by and tree s suppled by. When tree s n
3 zero ntal states the Elmore delays of and are as follows: Q When the ntal states of tree are the "equvalent Elmore delays" of and are as follows: Compared wth the frst case t can be seen that the couplng capactances 7 8 and 9 are doubled n the second case.. Hgher order moments Consder the kth order voltage moments wth %. As mentoned n Sec.. each ground capactance connected to node s equvalent to a current source * and each couplng capactance connected between nodes and s equvalent to a current source * * wth drecton from node to node. Usng the source splttng technque n crcut theory ths floatng current source can be splt nto two ground sources wth one from node to ground valued * * and the other from node to ground valued * * as shown n Fg.. It s obvous that the two sources contrbute to the kth order voltage moments n the & th and & th tree respectvely n the way smlar to that the ground sources * and * do. The splttng of the floatng current source nto two ground sources s equvalent to decouplng the coupled RC trees durng moment computaton and for each decoupled RC tree the moment formulas and moment computaton algorthm for a sngle RC tree can be appled. Based on ths reasonng we have the formulas for the moments of a set of coupled trees as follows where s the set of couplng capactances connected to node : & +* ) E E B ) ) E # (6) +* * ( +* ) E E ) ) # * B E (7) In the last expresson of the above equaton the frst term n the summaton ( * s the same as n the sngle RC tree case and n addton each couplng capactance has a contrbuton # * to the moment * whch s partcular for the coupled RC trees. Example. For the coupled RC trees shown n Fg. for we have * 7 * 7 4* 8 * 8 5* 9 * I 9 6* * 7 * 7 4* 8 * 8 5* 9 * 9 6* * 7 * 7 4* 8 * 8 5* 9 * 9 6* Coupled RC trees wth dstrbuted lnes. Moment model of dstrbuted RC lnes An RC lne located n Tree & and connected between nodes and ts father node s denoted by & For smplcty we consder two coupled lnes & and & and the result s easly extended to multple coupled lnes. Assumng that the length of the two lnes s normalzed to and and correspond to the near and far end of each lne. For & let and be ts total ground capactance and resstance respectvely the th order voltage moment at coordnate ) * the total kth order moment of capactve current at coordnate z wth an nfntesmal nterval and the kth order current enterng and leavng the lne. Let be the total couplng capactance between &. and & We frst show by nducton that and. ) * are polynomals of and gve recursve formulas to compute the coeffcents of the polynomals. Startng from order t s known that ) * whch s denoted by *. Smlarly s a constant and s denoted by *. For the " order moment wth for & we have ) * * * * (8)
4 where when & %& and versa and & %& and ) * ) * and vce (9) It can be seen from the formulas that when s a polynomal of of order ) * * s a polynomal of z of the same order and * s of order. It can be derved that. Let ) * * and * *. From Eq(8) we have * and from Eq(9) we have we have and * * * * * () () * * () () Eqs()() form a set of recursve formulas to compute the parameters s and s. When the kth order s s are known where (4) ) * * (5) s the total kth order capactve current moment contrbuted by & and where * (6) ) * * (7) s the total kth order moment of the voltage drop on the lne contrbuted by ts kth order capactve current moment. From the above two equatons the moment model of an RC lne can be presented by Fg... Equaton of voltage moments The voltage moment s contrbuted by both lumped and dstrbuted elements. The component correspondng to the contrbuton of lumped elements s gven by Eq(7). From Fg. t can be seen that the current source s connected to node so that the contrbuton of the current source s * and for each & on the path the voltage source contrbutes an amount of. We ntroduce a functon & & such that & A& ff the branch connected between and s a lne and & A& otherwse. We defne a functon " & such that " A& f and " A& otherwse. Then we have the formula for the voltage moments wth order as follows where s the lumped ground capactance connected to. * & A& +* ) E E * B ) ) E # +* * " A& (8) 4 Algorthm for moment computaton From the prncples descrbed n the prevous sectons we provde an effcent recursve algorthm for the computaton of moments n coupled RC trees. The computaton s done from order up to some specfed maxmum order wth the use of KCL and KVL of the moment model of the crcut. Wth order the computaton s carred out by computng current moments from the leaves of each tree upstream to ts root then computng the voltage moments from the root of each tree downstream to ts leaves. The algorthm s descrbed as follows. & "!! "! # $! f(rc lnes exst) for each tree 5 do!%! A& A& & (' A& & O "!! "! for each tree 5 wth source voltage do for each node n 5 do for each & do Compute * for each & do LNLOL
5 Compte * LOLOL Compute and!%! (! &!%! = f( $ A& )!%!! "! ) * for each couplng capactance! * * for each of the son node of!"!!%! & %!%! f( & & )!"! return(!%! ) (' (! & & ) f( else * f( & & ) for each of the son node of & ' A& % do! "! ) do do When applyng the algorthm to lumped RC trees for each order each grounded capactor s vsted once and each floatng capactor vssted twce n the call of functon!%! and each floatng node s vsted once n the call of functon ('. Therefore the computaton cost s proportonal to the total number of capactors tmes the maxmum order of nterest. In practcal cases the number of capactors connected to each node s lmted by a constant and the computaton complexty of the algorthm can be expressed as where s the number of the nodes n the network and s the maxmum order requred. Ths s a lnear order algorthm and s very effcent. When applyng the algorthm to dstrbuted RC trees suppose that there s an RC lne connected between each floatng node and ts father node then the computaton complexty s as the number of s and s grows lnearly wth the order. However f dscrete model s used to represent each RC lne as used n RICE [] f for each lne there are sectons n the model then the computaton cost wll be. It has been shown [] that n order to get exact moment matchng by a nonunform dscrete model and t s often seen n the lterature e.g. n [] that a large number of unform RC sectons are used to model a lne and the number of sectons s proportonal to the length of the lne but n our algorthm the computaton cost s ndependent of the lne length. Therefore ths algorthm runs both more accurately and much faster than the usng of dscrete model for RC lnes. error A SP NEW max(%) ( ) average(%) ( ) large tems 9 (5) 9 7 Table. Test data for coupled RC lnes error A SP NEW max(%) ( ) average(%)..57 ( ) large tems 45 () Table. Test data for coupled RC trees 5 Examples Based on the effcent algorthm for moment computaton we developed a new crosstalk model for coupled RC trees. The model s based on the moment matchng model wth slght modfcatons so that the model s more accurate and always stable. Because of the lmtaton of the paper there s no space for ts detaled descrpton whch can be found n [5]. We have tested 4 examples and the results are summerzed n Table and for coupled RC lnes and trees respectvely. In the frst lne of each table "" and "" refer to the one pole and two pole model generated by approxmaton wth moment matchng up to the order of and. " " refers to the model by [] whch s an approxmated second order model. "7 " refers to the model of [] and " " refers to our new model. The tem "large tems" refers to the number of tests that the absolute error exceedng %. It can be seen that our new model works better than the models marked "" "A" and "SP". Compared wth the model marked "" (the rd order model) note that there are 5 cases n the RC lne tests and 8 cases n the RC tree tests that the pole model s unstable the data lsted outsde the parentheses only refer to the stable tests and those nsde the parentheses refer to all the tests. It can be seen that the new model performs better than exstng models thus far. 6 Conclusons We have provded smple explct formulas for Elmore delay and hgher order voltage moments and a lnear order recursve algorthm for the moment computaton for coupled RC trees wth lumped andor dstrbuted elements. As there s no dscretzaton for dstrbuted EC lnes t s exact and
6 V s R R R C C C V F()k I k E k R () I () +  k V k V s C C C R 4 4 R 5 5 R 6 6 k C C C 4 Fgure. Moment Model of RC Lne n n I Fgure. Coupled RC Trees C n n n (a) k n (b) Ik I (C) Fgure. Moment Model of Floatng Capactor very effcent. Wth the explct formulas the formulas for the senstvty of moments w.r.t. the crcut parameters can be easly derved whch wll be very useful when nterconnect desgn and optmzaton s concerned. These formulas and algorthms provde an effcent way to deal wth the delay and crosstalk estmaton and model order reducton and wll be benefcal for the nterconnect desgn optmzaton and smulaton. These formulas and algorthms can also be easly extended to RLC trees wth both capactve and nductve couplng. References [].Cong et al "Interconnect desgn for deep submcron IC s" Proc. ICCAD 97 Nov. 997 pp [] Q.Yu & E.S.Kuh "Exact moment matchng model of transmsson lnes and applcaton to nterconnect delay estmaton" IEEE Trans. on VLSI Sys. vol. pp. une 995. [].S.Ym & C.M.Kyung "Reducng crosscouplng among nterconnect wres n deepsubmcron datapath desgn" Proc. of 6th DAC une 999 pp k [4] K..Kerns et al "Stable and effcent reducton of substrate model networks usng congruence transforms" Proc. ICCAD 95 Nov. 995 pp.74. [5] Q.Yu and E.S.Kuh "New effcent and accurate moment matchng based model for crosstalk estmaton n coupled RC trees" Proc. ISQED March. [6] T.Sakura"Closed form expressons for nterconnecton delay couplng and crosstalk n VLSIs" IEEE Trans. on Electron Devces vol.4 No. pp [7] H.Kawaguch and T.Sakura "Delay and nose formulas for capactvely coupled dstrbuted RC lnes" Proc. ASPDAC 98 pp.54 Feb [8] P.Feldmann & R.W.Fruend "Crcut nose evaluaton by approxmaton based model orderreducton technques" Proc. ICCAD 97 pp.8 Nov [9] K.L.Shepard et al "lobal Harmony: Coupled nose analyss for fullchp RC nterconnect networks" Proc. ICCAD 97 pp.946 Nov.997. [] H.Zhou and D.F.Wang"An optmal algorthm for rver routng wth crosstalk constrants" Proc. ICCAD 96 pp.5 Nov [] C.L.Ratzlaff and L.T.Pllage "RICE: rapd nterconnect evaluaton usng AWE" IEEE TCAD vol. pp une 994. [] E.Acar et al "SP: a stable pole RC delay and couplng nose metrc" Proc. 9th reat Lakes Symp. on VLSI pp.6 March 999. [] A.Vttal et al "Crosstalk n VLSI nterconnects" IEEE Trans. on CAD vol.8 No. pp.874 Dec.999.
Parallelism for Nested Loops with Nonuniform and Flow Dependences
Parallelsm for Nested Loops wth Nonunform and Flow Dependences SamJn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseodong, Cheonan, Chungnam, 33080, Korea. seong@cheonan.ac.kr
More informationRepeater Insertion for TwoTerminal Nets in ThreeDimensional Integrated Circuits
Repeater Inserton for TwoTermnal Nets n ThreeDmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI  EPFL, CH5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationA Fast ContentBased Multimedia Retrieval Technique Using Compressed Data
A Fast ContentBased Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationCrosstalkAffected Propagation Delay in Nanometer Technologies
Int'l Journal of Electroncs, 2008 ABSTRACT CrosstalkAffected Propagaton Delay n Nanometer Technologes Shahn Nazaran Massoud Pedram Unversty of Southern Calforna, EE Dept., Los Angeles, CA shahn@usc.edu
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 Bsplne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationParasitic Aware Routing Methodology based on Higher Order RLCK Moment Metrics
Parastc ware Routng Methodology based on Hgher Order RLCK Moment Metrcs mtava Bhadur and Ranga emur Department of ECECS Unversty of Cncnnat, Cncnnat, OH 4522 {bhadhua, ranga}@ececs.uc.edu BSTRCT In the
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationCircuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)
Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 631, Nuku, Katsuskaku,
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAXSAT wth weghts, such that the
More informationConditional Speculative Decimal Addition*
Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 12041208, 2008 ISSN 19918178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8, 7 ISSN 5966 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. AlRababah and Mohammad A. AlRababah Faculty of IT, AlAhlyyah Amman Unversty,
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationData Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach
Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract In the study of data representaton n dgtal desgn and computer
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stockmarket
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationReading. 14. Subdivision curves. Recommended:
eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton
More informationX Chart Using ANOM Approach
ISSN 16848403 Journal of Statstcs Volume 17, 010, pp. 33 Abstract X Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationPreconditioning Parallel Sparse Iterative Solvers for Circuit Simulation
Precondtonng Parallel Sparse Iteratve Solvers for Crcut Smulaton A. Basermann, U. Jaekel, and K. Hachya 1 Introducton One mportant mathematcal problem n smulaton of large electrcal crcuts s the soluton
More informationSolving Route Planning Using Euler Path Transform
Solvng Route Plannng Usng Euler Path ransform YChong Zeng Insttute of Informaton Scence Academa Snca awan ychongzeng@s.snca.edu.tw Abstract hs paper presents a method to solve route plannng problem n
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and ZhHua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationEWA: Exact WiringSizing Algorithm
EWA: Exact WrngSzng Algorthm Rony Kay, Gennady Bucheuv and Lawrence T. Plegg Carnege Mellon Unversty Department of Electrcal and Computer Engneerng Pttsburgh, PA 15213 ABSTRACT The wre szng problem under
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 91, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 91, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationContent Based Image Retrieval Using 2D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSRJECE) eissn: 78834,p ISSN: 788735.Volume 9, Issue, Ver. IV (Mar  Apr. 04), PP 007 Content Based Image Retreval Usng D Dscrete Wavelet wth
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth HernándezReyes, J.A. CarrascoOchoa, and J.Fco. MartínezTrndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationKiran Joy, International Journal of Advanced Engineering Technology EISSN
Kran oy, nternatonal ournal of Advanced Engneerng Technology ESS 09763945 nt Adv Engg Tech/Vol. V/ssue /Aprlune,04/995 Research Paper DETERMATO O RADATVE VEW ACTOR WTOUT COSDERG TE SADOWG EECT Kran
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationOptimal Workloadbased Weighted Wavelet Synopses
Optmal Workloadbased Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 8893 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationAnalysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationPositive Semidefinite Programming Localization in Wireless Sensor Networks
Postve Semdefnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationParallel matrixvector multiplication
Appendx A Parallel matrxvector multplcaton The reduced transton matrx of the threedmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationType2 Fuzzy Nonuniform Rational Bspline Model with Type2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationCHAPTER 4 PARALLEL PREFIX ADDER
93 CHAPTER 4 PARALLEL PREFIX ADDER 4.1 INTRODUCTION VLSI Integer adders fnd applcatons n Arthmetc and Logc Unts (ALUs), mcroprocessors and memory addressng unts. Speed of the adder often decdes the mnmum
More informationSteps for Computing the Dissimilarity, Entropy, HerfindahlHirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, HerfndahlHrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of BozenBolzano Faculty of Computer Scence Academc Year 01101 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationLecture 5: Probability Distributions. Random Variables
Lecture 5: Probablty Dstrbutons Random Varables Probablty Dstrbutons Dscrete Random Varables Contnuous Random Varables and ther Dstrbutons Dscrete Jont Dstrbutons Contnuous Jont Dstrbutons Independent
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 49 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationLOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit
LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS  T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationPYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES
PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES Ruxandra Olmd Faculty of Mathematcs and Computer Scence, Unversty of Bucharest Emal: ruxandra.olmd@fm.unbuc.ro Abstract Vsual secret sharng schemes
More informationElectrical analysis of lightweight, triangular weave reflector antennas
Electrcal analyss of lghtweght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lghtweght reflector antenna
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationVanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,
Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery
More informationDetermining the Optimal Bandwidth Based on Multicriterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Multcrteron Fuson HaL Lang 1+, XanMn
More informationLine Clipping by Convex and Nonconvex Polyhedra in E 3
Lne Clppng by Convex and Nonconvex Polyhedra n E 3 Václav Skala 1 Department of Informatcs and Computer Scence Unversty of West Bohema Unverztní 22, Box 314, 306 14 Plzeò Czech Republc emal: skala@kv.zcu.cz
More informationMemory Modeling in ESLRTL Equivalence Checking
11.4 Memory Modelng n ESLRTL Equvalence Checkng Alfred Koelbl 2025 NW Cornelus Pass Rd. Hllsboro, OR 97124 koelbl@synopsys.com Jerry R. Burch 2025 NW Cornelus Pass Rd. Hllsboro, OR 97124 burch@synopsys.com
More informationAnalysis of Min Sum Iterative Decoder using Buffer Insertion
Analyss of Mn Sum Iteratve ecoder usng Buffer Inserton Saravanan Swapna M.E II year, ept of ECE SSN College of Engneerng M. Anbuselv Assstant Professor, ept of ECE SSN College of Engneerng S.Salvahanan
More informationNewtonRaphson division module via truncated multipliers
NewtonRaphson dvson module va truncated multplers Alexandar Tzakov Department of Electrcal and Computer Engneerng Illnos Insttute of Technology Chcago,IL 60616, USA Abstract Reducton n area and power
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 21415 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationRoutability Driven Modification Method of Monotonic Via Assignment for 2layer Ball Grid Array Packages
Routablty Drven Modfcaton Method of Monotonc Va Assgnment for 2layer Ball Grd Array Pacages Yoch Tomoa Atsush Taahash Department of Communcatons and Integrated Systems, Toyo Insttute of Technology 2 12
More informationHighBoost Mesh Filtering for 3D Shape Enhancement
HghBoost Mesh Flterng for 3D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, AzuWakamatsu 9658580 Japan y Computer Graphcs Group,
More informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Examplebased Method Anatomcal models Sknnng Assume
More informationWavefront Reconstructor
A Dstrbuted Smplex BSplne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 1412201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex BSplnes
More informationTN348: Openlab Module  Colocalization
TN348: Openlab Module  Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More information(1) The control processes are too complex to analyze by conventional quantitative techniques.
Chapter 0 Fuzzy Control and Fuzzy Expert Systems The fuzzy logc controller (FLC) s ntroduced n ths chapter. After ntroducng the archtecture of the FLC, we study ts components step by step and suggest a
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More information3. CR parameters and MultiObjective Fitness Function
3 CR parameters and Multobjectve Ftness Functon 41 3. CR parameters and MultObjectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationDelay Variation Optimized Traffic Allocation Based on Network Calculus for Multipath Routing in Wireless Mesh Networks
Appl. Math. Inf. Sc. 7, No. 2L, 467474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network
More informationAn Efficient Genetic Algorithm with Fuzzy cmeans Clustering for Traveling Salesman Problem
An Effcent Genetc Algorthm wth Fuzzy cmeans Clusterng for Travelng Salesman Problem JongWon Yoon and SungBae Cho Dept. of Computer Scence Yonse Unversty Seoul, Korea jwyoon@sclab.yonse.ac.r, sbcho@cs.yonse.ac.r
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce  1. Introducton Vector 3D model representaton n computer graphcs requres
More informationOptimal Scheduling of Capture Times in a Multiple Capture Imaging System
Optmal Schedulng of Capture Tmes n a Multple Capture Imagng System Tng Chen and Abbas El Gamal Informaton Systems Laboratory Department of Electrcal Engneerng Stanford Unversty Stanford, Calforna 9435,
More informationOptimizing Document Scoring for Query Retrieval
Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley ChunHung
More informationMinimum Cost Optimization of Multicast Wireless Networks with Network Coding
Mnmum Cost Optmzaton of Multcast Wreless Networks wth Network Codng Chengyu Xong and Xaohua L Department of ECE, State Unversty of New York at Bnghamton, Bnghamton, NY 13902 Emal: {cxong1, xl}@bnghamton.edu
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More informationIntegrated interconnect circuit modeling for VLSI design
Integrated nterconnect crcut modelng for VLSI desgn WonYoung Jung, GhunUp Cha, YoungBae Km, JunHo Baek, ChoonKyung Km LG Semcon Co.,Ltd. D.A. Center 16, Woomyeondong, Seochogu, Seoul, 137140, Korea.
More informationBFF1303: ELECTRICAL / ELECTRONICS ENGINEERING. Direct Current Circuits : Methods of Analysis
BFF1303: ELECTRICAL / ELECTRONICS ENGINEERING Drect Current Crcuts : Methods of Analyss Ismal Mohd Kharuddn, Zulkfl Md Yusof Faculty of Manufacturng Engneerng Unerst Malaysa Pahang Drect Current Crcut
More informationTPLAware Displacementdriven Detailed Placement Refinement with Coloring Constraints
TPLware Dsplacementdrven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981x manuscrpts OPEN ACCES UbCC Journal ISSN 19928424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
More informationArray transposition in CUDA shared memory
Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some
More informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0 Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (SemCentralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of IllnosUrbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationREMOTE SENSING REQUIREMENTS DEVELOPMENT: A SIMULATIONBASED APPROACH
REMOTE SENSING REQUIREMENTS DEVEOPMENT: A SIMUATIONBASED APPROAC V. Zanon a, B. Davs a, R. Ryan b, G. Gasser c, S. Blonsk b a Earth Scence Applcatons Drectorate, Natonal Aeronautcs and Space Admnstraton,
More informationCategories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms
3. Fndng Determnstc Soluton from Underdetermned Equaton: LargeScale Performance Modelng by Least Angle Regresson Xn L ECE Department, Carnege Mellon Unversty Forbs Avenue, Pttsburgh, PA 3 xnl@ece.cmu.edu
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro GómezMoreno, Saturnno MaldonadoBascón, Francsco LópezFerreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. MadrdBarcelona
More informationHow Accurately Can We Model Timing In A Placement Engine?
How Accurately Can We Model Tmng In A Placement Engne? Amt Chowdhary, Karth Raagopal, Satsh Venatesan, Tung Cao, Vladmr Tourn, Yegna Parasuram, Bll Halpn Intel Corporaton Serra Desgn Automaton Synplcty,
More informationTerm Weighting Classification System Using the Chisquare Statistic for the Classification Subtask at NTCIR6 Patent Retrieval Task
Proceedngs of NTCIR6 Workshop Meetng, May 1518, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Chsquare Statstc for the Classfcaton Subtask at NTCIR6 Patent Retreval Task Kotaro Hashmoto
More informationA Facet Generation Procedure. for solving 0/1 integer programs
A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,
More informationNGPM  A NSGAII Program in Matlab
Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 20110726 Contents Contents... 1. Introducton...
More information