Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms

Size: px
Start display at page:

Download "Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms"

Transcription

1 5. oward Eicient arge-scae Perormance odeing o Integrated Circuits via uti-ode/uti-corner Sparse Regression Wangyang Zhang entor Graphics Corporation Ridder Park Drive San Jose, CA 953 wangyan@ece.cmu.edu sung-hao Chen and ing-yuan ing entor Graphics Corporation Ridder Park Drive San Jose, CA 953 {howard_chen, ming_ting}@mentor.com Xin i Carnegie eon University 5 Forbes Avenue Pittsburgh, PA 53 xini@ece.cmu.edu ABSRAC In this paper, we propose a nove muti-mode/muti-corner sparse regression (SR agorithm to buid arge-scae perormance modes o integrated circuits at mutipe working modes and environmenta corners. Our goa is to eicienty extract mutipe perormance modes to cover dierent modes/corners with a sma number o simuation sampes. o this end, an eicient Bayesian inerence with shared prior distribution (i.e., mode tempate is deveoped to expore the strong perormance correation among dierent modes/corners in order to achieve high modeing accuracy with ow computationa cost. Severa industria circuit exampes demonstrate that the proposed SR achieves up to 85 speedup over east-squares regression [4] and 6.7 speedup over east-ange regression [7] without surrendering any accuracy. Categories and Subject Descriptors B.7. [Integrated Circuits]: Design Aids Veriication Genera erms Agorithms eywords Process Variations, Perormance odeing. INRODUCION As IC technoogy scaes to nanoscae region, process variation has become a critica issue that must be careuy addressed within today s IC design ow []. odeing, anayzing and optimizing process variation is now a critica task in order to guarantee high parametric yied or siicon chips. For this reason, various response surace modeing (RS techniques have been deveoped and used as an eicient method to anayze circuit variabiity []-[7]. he objective o RS is to approximate the circuit perormance (e.g., deay, gain, etc. as an anaytica (either inear or noninear unction o device parameters (e.g., V H, OX, etc.. Once these perormance modes are created, they can be used or many circuit anaysis and optimization appications [8]- [9], e.g., parametric yied prediction, robust circuit design, etc. Whie RS was extensivey studied in the past, severa recent trends o advanced IC technoogy pose a number o new chaenges in this area. Strong noninearity: As process variation becomes reativey arge, noninear (e.g., quadratic modes are required to accuratey capture perormance variabiity []-[7]. High dimensionaity: As random device mismatch becomes dominant at sub-65nm technoogy node, a arge number o random variabes must be used to mode device-eve variation, rendering a high-dimensiona variation space []-[7]. uti-mode/muti-corner operation: oday s integrated circuits oten operate at mutipe working modes (e.g., high perormance vs. ow power and mutipe environmenta corners (e.g., high temperature vs. ow temperature [], [5]. o accuratey capture perormance variabiity, dierent modes/corners must be characterized by dierent perormance modes. It, in turn, resuts in an enormousy arge modeing probem, as a huge number o perormance modes must be created to cover a modes/corners. he aorementioned issues make RS increasingy diicut. o accuratey mode and anayze perormance variabiity o anaog and mixed-signa integrated circuits, we have to buid hundreds o perormance modes and each mode contains thousands o unknown mode coeicients. Whie a number o new RS techniques have been recenty deveoped []-[7], they remain i-equipped to address the tremendous chaenges that we ace today. For instance, the east-ange regression (AR agorithm in [7] can it a high-dimensiona perormance mode with about 3 simuation sampes. I more than perormance modes are required to cover a working modes and environmenta corners (as wi be demonstrated by severa industria circuit exampes in Section 4, over 5 samping points must be generated by SPICE simuation to buid a these modes. his requires a huge amount o simuation time and, hence, suggests a need to re-think our undamenta strategy or RS and deveop a competey new modeing agorithm to accommodate such a arge probem size. In this paper, we propose a nove muti-mode/muti-corner sparse regression (SR method to address the aorementioned modeing chaenges. he key idea is to reduce the number o required simuation sampes and, hence, modeing cost by exporing the oowing two unique properties observed or nanoscae integrated circuits. Sparse mode coeicients: Whie a arge number o basis unctions must be used to span the high-dimensiona, strongy-noninear variation space, not a o them pay an important roe or a given perormance o interest. In other words, ony a sma subset o mode coeicients corresponding to the important basis unctions are non-zero, rendering to a unique sparse structure [7]. Correated perormance variabiity: he perormance modes associated with dierent modes/corners are not independent. Instead, since these modes capture the perormance variabiity o the same circuit [], [5], they are strongy correated. However, we do not know the ocation o the non-zero mode 897

2 5. coeicients or the correation vaue o the perormance variabiity in advance. he undamenta question is how to deveop an eicient agorithm that can accuratey extract this inormation rom a imited number o simuation sampes. he main contribution o this paper is to borrow a new Bayesian inerence recenty deveoped by statistics community [] to derive an eicient numerica agorithm or SR. his Bayesian ramework aims to buid a shared sparse mode tempate or a modes/corners so that their strong correation can be eectivey taken into account to improve modeing accuracy and/or reduce modeing cost. As wi be demonstrated by severa industria circuit exampes in Section 4, the proposed SR achieves up to 85 speedup over east-squares regression (SR [4] and 6.7 speedup over east-ange regression (AR [7] without surrendering any accuracy. he rest o this paper is organized as oows. In Section, the background on principa component anaysis, response surace modeing, and sparse regression is reviewed. he proposed mutimode/muti-corner sparse regression (SR wi then be described in Section 3. he eicacy o SR wi be demonstrated by severa industria circuit exampes in Section 4, oowed by our concusion in Section 5.. BACGROUND.. Principa Component Anaysis Given N process parameters X = [x x... x N ], the process variation X = X X, where X denotes the mean vaue o X, is oten modeed by mutipe zero-mean, correated Norma distributions []-[7]. Principa component anaysis (PCA [] is a statistica method that inds a set o independent actors to represent the correated Norma distributions. Assume that the correation o X is represented by a symmetric, positive semideinite covariance matrix R. PCA decomposes R as []: R = U Σ U ( where = diag(,,..., N contains the eigenvaues o R, and U = [U U... U N ] contains the corresponding eigenvectors that are orthonorma, i.e., U U = I. (I is an identity matrix. PCA deines a set o new random variabes Y = [y y... y N ] :. 5 ΔY = Σ U ΔX. ( he new random variabes in Y are caed the principa components. It is easy to veriy that a principa components in Y are independent and standard Norma (i.e., zero mean and unit variance. ore detais on PCA can be ound in []... Response Surace odeing Given a circuit design, the circuit perormance (e.g., deay, gain, etc. is a unction o the process variation Y deined in (. RS approximates the perormance unction (Y as the inear combination o basis unctions []-[7]: ΔY α g ΔY (3 3 ( m m ( where { m ; m =,,...,} are the mode coeicients, and {g m (Y; m =,,...,} are the basis unctions (e.g., inear, quadratic, etc.. he unknown mode coeicients in (3 can be determined by soving the oowing inear equation at samping points: 4 G α = F (4 where 5 α = [ α α α ] (5 6 F = ( ( ( (6 [ ] ( ( ( ΔY g ΔY ( ( ( ΔY g ΔY ( ( g ( ΔY ( ( g ( ΔY g 7 g. (7 G = ( ( ( ( Δ ( Δ ( Δ g Y g Y g Y In (5-(7, Y (k and (k are the vaues o Y and (Y at the k-th samping point respectivey. he traditiona east-squares regression (SR [4] attempts to sove the east-squares soution or (4. Hence, the number o sampes ( must be equa to or greater than the number o coeicients (. Such an SR becomes intractabe, i is arge (e.g., 4 ~ 6. For this reason, a number o sparse regression techniques [6]-[7] were recenty proposed to address this computationa cost issue..3. Sparse Regression Whie a arge number o basis unctions must be used to span the high-dimensiona and strongy noninear variation space, ony a ew o them are required to approximate a speciic perormance unction o interest. Sparse regression is motivated by this observation. It assumes that the unknown vector in (4 contains a arge number o zeros and, hence, is sparse. o ind such a sparse soution, the oowing -norm reguarization probem: 8 minimize G α F α (8 subject to α λ is soved by east-ange regression (AR [7]. In (8, and denote the -norm and -norm o a vector, respectivey. he vaue o λ shoud be optimay determined by the cross-vaidation scheme described in [7]. It has been demonstrated that AR can it a high-dimensiona perormance mode with about 3 simuation sampes. It, however, remains i-equipped to address the muti-mode/muticorner modeing probem that we study in this paper. For instance, i more than perormance modes are required to cover a modes and corners, over 5 samping points must be generated by SPICE simuation to buid a these modes, resuting in unaordabe computationa cost. We wi deveop a new sparse regression agorithm in this paper that is particuary tuned or muti-mode/muti-corner appications. 3. UI-ODE/UI-CORNER PERFORANCE ODEING Our proposed muti-mode/muti-corner sparse regression (SR is aciitated by a nove Bayesian inerence that is derived rom advanced statistica theories [], [3]. In this section, we describe its mathematica ormuation and highight the noveties. 3.. Probem Deinition he objective o SR is to generate dierent perormance modes or dierent working modes and environmenta corners. oday s integrated circuits oten operate at mutipe modes/corners, e.g., high perormance vs. ow power, high V DD vs. ow V DD, high temperature vs. ow temperature, etc. It is diicut to accuratey capture the perormance variabiity at a these modes/corners by a uniied mode. Instead, mutipe modes must be generated to cover a modes/corners: 9 ΔY α g ΔY =,, (9 (( (, m m( (, where represents the tota number o modes/corners. Simiar to 898

3 5. (4-(7, simuation sampes can be generated or { ( (Y; =,,...,} and a number o inear equations can be created to sove the mode coeicients { (,m ; =,,...,; m =,,...,}: G α = F =,, ( where 3 G ( α g g = g ( ( ( (, [ ] ( α(, α(, α (, ( ( ( F( [ ( ( ( ] ( ( ( ΔY( g ΔY( g ( ( ( ΔY( g ΔY( g = ( = ( ( ( ( ΔY( ( ( ( ΔY( ( ( ( ( ΔY( g( ΔY( g ( ΔY(. (3 In (-(3, Y ( (k and ( (k are the vaues o Y and ( (Y at the k-th samping point o the -th perormance unction. One straightorward way to sove { (,m ; =,,...,; m =,,...,} is to consider each ( (Y independenty and sove a inear equations in ( one by one. his simpe approach, however, is not optima, since it competey ignores the correation among the perormance unctions { ( (Y; =,,...,}. Such correation exists, because these perormance unctions capture the perormance variabiity o the same circuit. It, in turn, motivates us to deveop a new muti-mode/muti-corner sparse regression (SR agorithm that expores the extra correation inormation to improve modeing accuracy and/or reduce modeing cost. his goa is achieved by adapting a nove Bayesian inerence recenty deveoped by statistics community [] to buid a shared sparse mode tempate or a modes/corners. In what oows, we irst present the Bayesian ramework or sparse regression, and then show how to adapt and appy such a Bayesian inerence to muti-mode/muti-corner perormance modeing probems. 3.. Bayesian Inerence Given a set o simuation sampes {G (,F ( ; =,,...,}, most traditiona regression methods []-[7] sove the inear equations in ( and ind the deterministic vaues o a mode coeicients { ( ; =,,...,}. Bayesian inerence, however, takes a competey dierent strategy. It considers a unknown mode coeicients as random variabes and appies Bayes theorem to ind the probabiity density unction {pd( ( G (,F ( ; =,,...,}. he distribution pd( ( G (, F ( contains important inormation about ( that is earned rom the simuation sampes {G (,F ( ; =,,...,}. It tes us: ( the vaue o ( that is most ikey to occur (i.e., determined by the mode o the PDF, and ( the uncertainty o ( that corresponds to perormance modeing error (i.e., determined by the covariance matrix o the PDF. A. Prior Deinition o ormuate a Bayesian inerence, we irst need to deine a so-caed prior distribution or { ( ; =,,...,}. Intuitivey, the prior distribution represents our prior knowedge about { ( ; =,,...,} without seeing any simuation sampes. In genera, i we do not have any prior inormation, a uniorm distribution over (, + can be used to mode the prior distribution {pd( ( ; =,,...,}, impying that each coeicient (,m can possiby take any vaue with equa probabiity. However, in our appication o sparse regression, we know that the coeicient vector ( in ( is sparse. Hence, we shoud deine an appropriate prior distribution to carry this unique inormation o sparsity. o this end, we borrow the idea o hierarchica Bayesian inerence described in []. We irst mode the regression error as a zero-mean Norma distribution. Eq. (9 is re-written as: 4 ΔY = α g ΔY + ε =,, (4 (( (, m m( ( (, where ( represents the regression error and its PDF is: 5 θ(, θ(, ε ( pd ( ε ( θ(, = exp ( =,,,. (5 π In (5, (, is the precision o the Norma distribution. It is equa to the inverse o the variance. In our perormance modeing appication, the precision (, represents the accuracy o the -th perormance mode. he vaue o (, can be estimated by a maximum ikeihood method, as wi be discussed in detai in Section 3..C. Next, we deine the prior distribution o each (,m as a parameterized, zero-mean Norma distribution: θ (, m θ (, m α (, m pd ( α θ = exp π (6 6 (, m (, m ( =,,, ; m =,,, where (,m is the precision o the Norma distribution. he key idea o the hierarchica Bayesian inerence in [] is to assign appropriate vaues to the parameters { (,m ; m =,,...,} so that the coeicient vector ( has a sparse soution. Intuitivey, i the precision (,m is arge (i.e., variance is sma, the corresponding mode coeicient (,m is ikey to be zero. Otherwise, i the precision (,m is sma (i.e., variance is arge, the corresponding (,m can be ar away rom zero. However, we ony know that the coeicient vector ( is sparse, but we do not know the exact ocation o zeros. For this reason, it is not trivia to determine the optima vaues o { (,m ; m =,,...,}. In Section 3..C, we wi present a maximum ikeihood method to address this issue. o compete the deinition o the prior distribution, we assume that the random variabes ( and { (,m ; m =,,...,} are mutuay independent. Hence, the joint PDF o { (, ( } is: 7 pd ( ε (, α( θ(,,, = pd ( ε ( θ(, pd ( α(, m θ(, m. (7 ( =,,, he independence assumption we made simpy impies that we do not know the correation between ( and { (,m ; m =,,...,} in advance. Such correation inormation wi be considered, once the simuation sampes {G (,F ( ; =,,...,} are avaiabe to cacuate the posterior distribution. B. Perormance Correation he prior distributions deined in (5-(7 promote a sparse soution o { ( ; =,,...,}, i the vaues o { (,m ; =,,...,, m =,,...,} are propery seected. For our proposed mutimode/muti-corner sparse regression (SR, we expect that a perormance modes corresponding to dierent working modes and environmenta corners are simiar and, hence, strongy correated. Such correation inormation shoud be expicity expored to improve modeing accuracy and/or reduce modeing cost. In this sub-section, we urther present a systematic methodoogy to take into account the strong correation among a perormance modes. A cose ook at the prior distributions (5-(7 motivates severa additiona assumptions that we can make to expore the simiarity among { ( (Y; =,,...,}. First, we assume that 899 3

4 5. the vaues o { (, ; =,,...,} in (5 are identica: 8 θ θ = = θ =. (8 (, = (, (, θ Eq. (8 impies that the error o a perormance modes oows the same Norma distribution with identica variance. (Note that even with the same prior distribution {pd( ( ; =,,...,}, the regression error ( can sti vary or dierent perormance modes. his assumption is typicay vaid, especiay i a proper scaing is appied to a perormance unctions (e.g., dividing each perormance unction by its nomina vaue. Next, we urther assume that the vaues o { (,m ; =,,...,} in (6 are identica: 9 θ (, m = θ (, m = = θ(, m = θ m ( m =,,,. (9 Remember that the vaues o { (,m ; =,,...,, m =,,...,} indicate the importance o the corresponding basis unction g m (Y or the -th perormance unction ( (Y. Hence, Eq. (9 simpy impies that a particuar basis unction g m (Y may either simutaneousy impact a perormance unctions or aect no perormance unction at a. In other words, a perormance unctions share the same mode tempate, because they represent the behavior o the same circuit at dierent modes/corners. It is important to note that { (,m ; =,,...,, m =,,...,} are not the unknown mode coeicients { (,m ; =,,...,, m =,,...,} and, hence, Eq. (9 does not necessariy ead to identica mode coeicients. he soution o { (,m ; =,,...,, m =,,...,} wi be determined by cacuating the posterior distribution o the proposed Bayesian inerence, as wi be discussed in detai in Section 3..C. he equaity constraints deined by (8-(9 oer a systematic approach to expore the correation among a perormance unctions. In other words, the same prior distribution {pd( (, (,, ; =,,...,} is now shared by a modes/corners, since they are deined by using the same parameters { m ; m =,,...,}. his unique modeing structure or SR enabes us to achieve superior modeing accuracy and/or cheap modeing cost over the traditiona sparse regression agorithms (e.g., east-ange regression [7], as wi be demonstrated by severa industria circuit exampes in Section 4. In addition, Eq. (8-(9 aso reduce the compexity o the proposed prior distribution. Namey, they reduce the number o independent parameters that deine the prior distribution. In what oows, we wi describe an eicient agorithm to determine the vaues o { m ; m =,,...,} rom a imited number o simuation sampes. Once { m ; m =,,...,} are ound, the prior distribution in (5-(9 is uniquey determined. C. Posterior Cacuation A critica component o the aorementioned Bayesian inerence is to determine the vaues o { m ; m =,,...,} so that the prior distribution o { ( ; =,,...,} is accurate. In this subsection, we wi irst present an eicient maximum ikeihood estimation (E method to sove { m ; m =,,...,}. Next, we wi urther show a maximum posterior method (AP to determine the vaues o the unknown mode coeicients { ( ; =,,...,}. Given a set o simuation sampes {G (, F ( ; =,,...,} coected or a perormance unctions, the key idea o E is to determine { m ; m =,,...,} or the shared prior distribution so that the samping points {G (, F ( ; =,,...,} are most ikey to occur. Namey, we aim to maximize the oowing conditiona probabiity: maximize θ,, θ pd ( F θ (,,,, ( I a simuation sampes {G (, F ( ; =,,...,} are created independenty, pd(f (,,,, can be represented as: pd F θ = pd F θ. ( ( (,,,, (,, = ( aking the ogarithm o ( resuts in the og-ikeihood: og pd F θ = og pd F θ. ( [ ( (,,,, ] ( = [ ( ],, Since og( monotonicay increases, maximizing the PDF in ( is equivaent to maximizing the og-ikeihood in (, yieding: 3 maximize og pd θ. (3 θ,, θ = [ ( ] F(,, o sove (3, we need to ind an eicient way to cacuate the og-ikeihood unction. owards this goa, we appy the Bayes theorem [3]: 4 pd α pd ( α ( θ,, pd ( F( α (, θ,, ( ( F(, θ,, = pd ( F θ (,,. (4 By simpy rearranging (4, we have: 5 pd ( ( ( ( α θ,, pd ( F( α(, θ,, pd F θ,, =. (5 pd ( α( F(, θ,, Eq. (5 impies that we can easiy cacuate pd(f (,, i we know pd( (,,, pd(f ( (,,, and pd( ( F (,,,. First, we note that pd( (,, is the prior distribution or (, as deined in (6-(7 and (9: 6 θ θ ( m α m, m pd ( α ( = θ,, exp. (6 π Second, pd(f ( (,,, is reerred to as the ikeihood unction. Based on the perormance mode in (4-(5, we know that once ( and { m ; m =,,...,} are ixed, pd(f ( (,,, is a Norma distribution determined by the modeing error [], [3]: 7 θ θ G( ( ( ( ( ( α F = (7 pd F α, θ,, exp π where is the number o simuation sampes or the -th perormance unction. Finay, pd( ( F (,,, is the posterior distribution or (. It modes the uncertainty o ( ater we observe the simuation sampes {G (, F ( }. Given the prior distribution in (6 and the ikeihood unction in (7, the posterior distribution pd( ( F (,,, is Norma and its covariance Σ ( and mean μ ( are respectivey equa to [], [3]: 8 Σ( ( ( ( = θ G G + A (8 9 μ ( = θ Σ( G( F (9 ( where θ 3 (3 A = θ is a diagona matrix. Combining (5-(9, it can be shown that the optimization in (3 is equivaent to: 3 og[ det( θ ( (] I + G A G + (3 minimize θ,, θ = F( ( + ( ( ( θ I G A G F where det( stands or the determinant o a matrix. Eq. (3 presents an anaytica orm o the cost unction that we shoud 9 4

5 5. minimize. Given this compicated cost unction, the optimization in (3 is not convex. An eicient greedy agorithm has been deveoped in [] to sove { m ; m =,,...,} rom (3. Even though goba convergence is not guaranteed, the greedy agorithm in [] has been demonstrated as a robust numerica sover or many practica probems. Due to imited space, we wi not discuss the numerica sover here. ore detais on the greedy agorithm can be ound in []. Once the parameters { m ; m =,,...,} are determined, the posterior distribution o ( is Norma and its mean μ ( and covariance Σ ( are speciied by (8-(9. Since a Norma distribution is peaked at the mean vaue μ (, the maximum posterior soution o ( (i.e., the vaue o ( that is most ikey to occur is exacty equa to μ ( : 3 α ( = μ( = θ Σ( G( F. (3 ( Eq. (3 soves the unknown mode coeicients { ( ; =,,...,} or our proposed muti-mode/muti-corner perormance modeing probem Summary As shown in Figure, the key idea o the proposed mutimode/muti-corner spare regression (SR is to appy the same prior distribution (i.e., mode tempate to a perormance unctions. Agorithm summarizes the major steps o the SR method. Starting rom a number o random samping points {G (, F ( ; =,,...,}, Agorithm irst soves the parameters { m ; m =,,...,} o the shared prior distribution by using the greedy agorithm described in []. Next, the maximum posterior soution o the unknown mode coeicients { ( ; =,,...,} is determined by Bayesian inerence. Due to the shared prior distribution appied by SR, the number o required simuation sampes or each perormance mode can be signiicanty reduced, as wi be demonstrated by industria circuit exampes in Section 4. Simuation Sampes Shared Prior Distribution ode ode ode G (, F ( G (, F ( G (, F ( pd( (, (,,, ode ( ( Coeicients ( Figure. he same prior distribution (i.e., mode tempate is shared by a perormance modes or muti-mode/muti-corner sparse regression (SR. Agorithm : uti-ode/uti-corner Sparse Regression. Randomy generate the samping points {G (, F ( ; =,,...,} or perormance unctions where samping points are associated with each perormance unction, as shown in ( and (3.. Deine the prior distribution or the mode coeicients { ( ; =,,...,} and the regression errors { ( ; =,,...,}, as shown in (5-(9. 3. Sove the optimization in (3 to determine the parameters { m ; m =,,...,} by using the greedy agorithm described in []. 4. Find the posterior distribution (which is Norma or the mode coeicients { ( ; =,,...,} using (8-(9. 5. Determine the maximum posterior soution o the mode coeicients { ( ; =,,...,} using (3. 4. NUERICA EXAPES In this section, we demonstrate the eicacy o SR using severa industria circuit exampes. A circuits are designed in a commercia COS process. For each circuit exampe, there are mutipe working modes and environmenta corners. One perormance mode is extracted or each o these modes/corners. owards this goa, two independent random samping sets, caed training set and testing set respectivey, are generated. he training set is used or coeicient itting (i.e., Agorithm, whie the testing set is used or mode vaidation. A numerica experiments are perormed on a 3GHz inux server. 4.. High-Speed Adder A ~A 7 B ~B 7 C Adder C 8 S ~S 7 Figure. Bock diagram o an 8-bit adder odeing Error (% SR # o raining Sampes per ode odeing Error (% Figure 3. inear perormance modeing error AR SR # o raining Sampes per ode abe. inear perormance modeing cost SR AR SR # Sampes per ode Simuation (Sec Fitting (Sec ota (Sec Figure shows the bock diagram o an 8-bit adder. In this exampe, we aim to mode the path deay rom the input A to the output S 7. Both goba variation and oca mismatch are taken into account. Ater PCA based on oundry data, 3876 independent random variabes are extracted to mode the variations. In addition, we consider the circuit to operate at 3 dierent V DD corners with 7 dierent input sopes at A and 8 dierent output oad capacitors at S 7, resuting in 68 dierent modes/corners. Such a mutimode/muti-corner modeing probem occurs in severa practica appications, e.g., statistica timing ibrary characterization [5]. Figure 3 shows the inear modeing error or three dierent techniques: east-squares regression (SR [4], east-ange regression (AR [7], and the proposed muti-mode/muti-corner sparse regression (SR. Given the same number o training sampes, SR yieds substantiay better accuracy than SR and AR. his is because SR expores the strong correation between dierent modes/corners by appying the same prior distribution (i.e., mode tempate, as shown in Agorithm. On the other hand, or a given accuracy requirement, SR requires much ess training sampes than SR and AR. Studying Figure 3, one woud notice that to achieve 5% modeing error, 9 5

6 5. SR ony requires 3 sampes per mode (68 modes in tota, whie SR and AR require 4 and 9 sampes per mode, respectivey. abe urther shows the computationa cost or the aorementioned three techniques. Note that SR is computationay cheaper than SR and AR in both simuation cost (i.e., to generate simuation sampes and itting cost (i.e., to sove mode coeicients. In this exampe, SR achieves 4 speedup over SR and 6.3 speedup over AR. 4.. Simpiied SRA Read Path Figure 4. Simpiied circuit schematic o an SRA read path odeing Error (% SR (inear # o raining Sampes per ode odeing Error (% AR (inear SR (inear SR (Quad # o raining Sampes per ode Figure 5. inear and quadratic perormance modeing error abe. inear perormance modeing cost SR AR SR # Sampes per ode 56 3 Simuation (Sec Fitting (Sec ota (Sec Shown in Figure 4 is the simpiied circuit schematic o an SRA read path. Ater PCA based on oundry data, 3345 independent random variabes are extracted to mode both goba variation and oca mismatch. Simiar to the previous exampe, we consider the circuit to operate at 3 dierent V DD corners with 7 dierent word ine sopes and 8 dierent output oad capacitors, resuting in 68 dierent modes/corners. In this exampe, we irst buid inear perormance modes or read path deay using three dierent techniques: SR [4], AR [7], and SR. Figure 5 shows the modeing error as a unction o the number o training sampes per mode (68 modes in tota. o achieve 3% modeing error, SR ony requires 3 sampes per mode, whie SR and AR require 56 and sampes per mode, respectivey. abe urther shows the computationa cost or these three modeing techniques. In this exampe, SR achieves 85 speedup over SR and 6.7 speedup over AR, as shown in abe. o urther improve accuracy, we seect a subset o important process parameters corresponding to non-zero inear mode coeicients. Next, we create quadratic perormance modes or these critica process parameters using SR. Figure 5 aso shows the quadratic modeing error or SR. Compared to simpe inear modeing, the proposed quadratic modeing scheme urther reduces modeing error rom % to % ( reduction, i a suicient number o simuation sampes (more than sampes per mode are avaiabe. 5. CONCUSIONS In this paper, we propose a nove muti-mode/muti-corner spare regression (SR method to eicienty generate arge-scae perormance modes o integrated circuits at mutipe working modes and environmenta corners. An eicient Bayesian inerence with shared prior distribution (i.e., mode tempate is appied to expore the strong perormance correation among dierent modes/corners to improve modeing accuracy and/or reduce modeing cost. Severa industria circuit exampes demonstrate that SR achieves up to 85 speedup over eastsquares regression (SR [4] and 6.7 speedup over east-ange regression (AR [7] without surrendering any accuracy. he proposed SR agorithm can be appied to a number o practica appications or both anaog and digita circuits such as statistica timing ibrary characterization and parametric yied estimation. 6. REFERENCES [] Semiconductor Industry Associate, Internationa echnoogy Roadmap or Semiconductors, 7. [] X. i, J. e,. Pieggi and A. Strojwas, Projection-based perormance modeing or inter/intra-die variations, IEEE ICCAD, pp. 7-77, 5. [3] Z. Feng and P. i, Perormance-oriented statistica parameter reduction o parameterized systems via reduced rank regression, IEEE ICCAD, pp , 6. [4] A. Singhee and R. Rutenbar, Beyond ow-order statistica response suraces: atent variabe regression or eicient, highy noninear itting, IEEE DAC, pp. 56-6, 7. [5] A. itev,. areat, D. a and J. Wang, Principe Hessian direction based parameter reduction or interconnect networks with process variation, IEEE ICCAD, pp , 7. [6] X. i and H. iu, Statistica regression or eicient highdimensiona modeing o anaog and mixed-signa perormance variations, IEEE DAC, pp , 8. [7] X. i, "Finding deterministic soution rom underdetermined equation: arge-scae perormance modeing by east ange regression," IEEE DAC, pp , 9. [8] F. Schenke,. Pronath, S. Zizaa, R. Schwencker, H. Graeb and. Antreich, ismatch anaysis and direct yied optimization by spec-wise inearization and easibiityguided search, IEEE DAC, pp ,. [9]. cconaghy and G. Gieen, empate-ree symboic perormance modeing o anaog circuits via canonica-orm unctions and genetic programming, IEEE rans. CAD, vo. 8, no. 8, pp. 6-75, Aug. 9. [] B. Foyd and D. Ozis, ow-noise ampiier comparison at GHz in.5-m and.8-m RF-COS and SiGe BiCOS, IEEE RFIC, pp , 4. [] S. Ji, D. Dunson and. Carin, uti-task compressive sensing, IEEE rans. Signa Processing, vo. 57, no., pp. 9-6, Jan. 9. [] G. Seber, utivariate Observations, Wiey Series, 984. [3] G. Casea and R. Berger, Statistica Inerence, Duxbury Press,. [4]. Hastie, R. ibshirani and J. Friedman, he Eements o Statistica earning, Springer, 3. [5] S. Sapatnekar, iming, Springer,

A Brief Introduction to Markov Chains and Hidden Markov Models

A Brief Introduction to Markov Chains and Hidden Markov Models A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,

More information

FRST Multivariate Statistics. Multivariate Discriminant Analysis (MDA)

FRST Multivariate Statistics. Multivariate Discriminant Analysis (MDA) 1 FRST 531 -- Mutivariate Statistics Mutivariate Discriminant Anaysis (MDA) Purpose: 1. To predict which group (Y) an observation beongs to based on the characteristics of p predictor (X) variabes, using

More information

A Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c)

A Simple and Efficient Algorithm of 3-D Single-Source Localization with Uniform Cross Array Bing Xue 1 2 a) * Guangyou Fang 1 2 b and Yicai Ji 1 2 c) A Simpe Efficient Agorithm of 3-D Singe-Source Locaization with Uniform Cross Array Bing Xue a * Guangyou Fang b Yicai Ji c Key Laboratory of Eectromagnetic Radiation Sensing Technoogy, Institute of Eectronics,

More information

A Fictitious Time Integration Method for a One-Dimensional Hyperbolic Boundary Value Problem

A Fictitious Time Integration Method for a One-Dimensional Hyperbolic Boundary Value Problem Journa o mathematics and computer science 14 (15) 87-96 A Fictitious ime Integration Method or a One-Dimensiona Hyperboic Boundary Vaue Probem Mir Saad Hashemi 1,*, Maryam Sariri 1 1 Department o Mathematics,

More information

Interactive Fuzzy Programming for Two-level Nonlinear Integer Programming Problems through Genetic Algorithms

Interactive Fuzzy Programming for Two-level Nonlinear Integer Programming Problems through Genetic Algorithms Md. Abu Kaam Azad et a./asia Paciic Management Review (5) (), 7-77 Interactive Fuzzy Programming or Two-eve Noninear Integer Programming Probems through Genetic Agorithms Abstract Md. Abu Kaam Azad a,*,

More information

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with?

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with? Bayesian Learning A powerfu and growing approach in machine earning We use it in our own decision making a the time You hear a which which coud equay be Thanks or Tanks, which woud you go with? Combine

More information

Statistical Learning Theory: A Primer

Statistical Learning Theory: A Primer Internationa Journa of Computer Vision 38(), 9 3, 2000 c 2000 uwer Academic Pubishers. Manufactured in The Netherands. Statistica Learning Theory: A Primer THEODOROS EVGENIOU, MASSIMILIANO PONTIL AND TOMASO

More information

Explicit overall risk minimization transductive bound

Explicit overall risk minimization transductive bound 1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,

More information

XSAT of linear CNF formulas

XSAT of linear CNF formulas XSAT of inear CN formuas Bernd R. Schuh Dr. Bernd Schuh, D-50968 Kön, Germany; bernd.schuh@netcoogne.de eywords: compexity, XSAT, exact inear formua, -reguarity, -uniformity, NPcompeteness Abstract. Open

More information

Leader-Follower Consensus Modeling Representative Democracy

Leader-Follower Consensus Modeling Representative Democracy Proceedings o the Internationa Conerence o Contro, Dynamic Systems, and Robotics Ottawa, Ontario, Canada, May 7-8, 2015 Paper o. 156 Leader-Foower Consensus Modeing Representative Democracy Subhradeep

More information

CS229 Lecture notes. Andrew Ng

CS229 Lecture notes. Andrew Ng CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view

More information

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries c 26 Noninear Phenomena in Compex Systems First-Order Corrections to Gutzwier s Trace Formua for Systems with Discrete Symmetries Hoger Cartarius, Jörg Main, and Günter Wunner Institut für Theoretische

More information

ASummaryofGaussianProcesses Coryn A.L. Bailer-Jones

ASummaryofGaussianProcesses Coryn A.L. Bailer-Jones ASummaryofGaussianProcesses Coryn A.L. Baier-Jones Cavendish Laboratory University of Cambridge caj@mrao.cam.ac.uk Introduction A genera prediction probem can be posed as foows. We consider that the variabe

More information

(This is a sample cover image for this issue. The actual cover is not yet available at this time.)

(This is a sample cover image for this issue. The actual cover is not yet available at this time.) (This is a sampe cover image for this issue The actua cover is not yet avaiabe at this time) This artice appeared in a journa pubished by Esevier The attached copy is furnished to the author for interna

More information

AST 418/518 Instrumentation and Statistics

AST 418/518 Instrumentation and Statistics AST 418/518 Instrumentation and Statistics Cass Website: http://ircamera.as.arizona.edu/astr_518 Cass Texts: Practica Statistics for Astronomers, J.V. Wa, and C.R. Jenkins, Second Edition. Measuring the

More information

18-660: Numerical Methods for Engineering Design and Optimization

18-660: Numerical Methods for Engineering Design and Optimization 8-660: Numerica Methods for Engineering esign and Optimization in i epartment of ECE Carnegie Meon University Pittsburgh, PA 523 Side Overview Conjugate Gradient Method (Part 4) Pre-conditioning Noninear

More information

A. Distribution of the test statistic

A. Distribution of the test statistic A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch

More information

Appendix of the Paper The Role of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Model

Appendix of the Paper The Role of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Model Appendix of the Paper The Roe of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Mode Caio Ameida cameida@fgv.br José Vicente jose.vaentim@bcb.gov.br June 008 1 Introduction In this

More information

Cindy WANG CNNIC 5 Nov. 2009, Beijing

Cindy WANG CNNIC 5 Nov. 2009, Beijing Cindy WANG (wangxin@cnnic.cn), CNNIC 5 Nov. 009, Beijing Agenda Motivation What we want to earn? How we do it? Concusions and Future work Discussions Agenda Motivation What we want to earn? How we do it?

More information

Testing for the Existence of Clusters

Testing for the Existence of Clusters Testing for the Existence of Custers Caudio Fuentes and George Casea University of Forida November 13, 2008 Abstract The detection and determination of custers has been of specia interest, among researchers

More information

Unconditional security of differential phase shift quantum key distribution

Unconditional security of differential phase shift quantum key distribution Unconditiona security of differentia phase shift quantum key distribution Kai Wen, Yoshihisa Yamamoto Ginzton Lab and Dept of Eectrica Engineering Stanford University Basic idea of DPS-QKD Protoco. Aice

More information

Simulation of single bubble rising in liquid using front tracking method

Simulation of single bubble rising in liquid using front tracking method Advances in Fuid Mechanics VI 79 Simuation o singe bubbe rising in iquid using ront tracking method J. Hua & J. Lou Institute o High Perormance Computing, #01-01 The Capricorn, Singapore Abstract Front

More information

Target Location Estimation in Wireless Sensor Networks Using Binary Data

Target Location Estimation in Wireless Sensor Networks Using Binary Data Target Location stimation in Wireess Sensor Networks Using Binary Data Ruixin Niu and Pramod K. Varshney Department of ectrica ngineering and Computer Science Link Ha Syracuse University Syracuse, NY 344

More information

SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS

SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS ISEE 1 SUPPLEMENTARY MATERIAL TO INNOVATED SCALABLE EFFICIENT ESTIMATION IN ULTRA-LARGE GAUSSIAN GRAPHICAL MODELS By Yingying Fan and Jinchi Lv University of Southern Caifornia This Suppementary Materia

More information

NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION

NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION Hsiao-Chang Chen Dept. of Systems Engineering University of Pennsyvania Phiadephia, PA 904-635, U.S.A. Chun-Hung Chen

More information

II. PROBLEM. A. Description. For the space of audio signals

II. PROBLEM. A. Description. For the space of audio signals CS229 - Fina Report Speech Recording based Language Recognition (Natura Language) Leopod Cambier - cambier; Matan Leibovich - matane; Cindy Orozco Bohorquez - orozcocc ABSTRACT We construct a rea time

More information

4 Separation of Variables

4 Separation of Variables 4 Separation of Variabes In this chapter we describe a cassica technique for constructing forma soutions to inear boundary vaue probems. The soution of three cassica (paraboic, hyperboic and eiptic) PDE

More information

Alberto Maydeu Olivares Instituto de Empresa Marketing Dept. C/Maria de Molina Madrid Spain

Alberto Maydeu Olivares Instituto de Empresa Marketing Dept. C/Maria de Molina Madrid Spain CORRECTIONS TO CLASSICAL PROCEDURES FOR ESTIMATING THURSTONE S CASE V MODEL FOR RANKING DATA Aberto Maydeu Oivares Instituto de Empresa Marketing Dept. C/Maria de Moina -5 28006 Madrid Spain Aberto.Maydeu@ie.edu

More information

Asynchronous Control for Coupled Markov Decision Systems

Asynchronous Control for Coupled Markov Decision Systems INFORMATION THEORY WORKSHOP (ITW) 22 Asynchronous Contro for Couped Marov Decision Systems Michae J. Neey University of Southern Caifornia Abstract This paper considers optima contro for a coection of

More information

Tracking Control of Multiple Mobile Robots

Tracking Control of Multiple Mobile Robots Proceedings of the 2001 IEEE Internationa Conference on Robotics & Automation Seou, Korea May 21-26, 2001 Tracking Contro of Mutipe Mobie Robots A Case Study of Inter-Robot Coision-Free Probem Jurachart

More information

Power Control and Transmission Scheduling for Network Utility Maximization in Wireless Networks

Power Control and Transmission Scheduling for Network Utility Maximization in Wireless Networks ower Contro and Transmission Scheduing for Network Utiity Maximization in Wireess Networks Min Cao, Vivek Raghunathan, Stephen Hany, Vinod Sharma and. R. Kumar Abstract We consider a joint power contro

More information

Delay Analysis of Maximum Weight Scheduling in Wireless Ad Hoc Networks

Delay Analysis of Maximum Weight Scheduling in Wireless Ad Hoc Networks 1 Deay Anaysis o Maximum Weight Scheduing in Wireess Ad Hoc Networks ong Bao e, Krishna Jagannathan, and Eytan Modiano Abstract This paper studies deay properties o the weknown maximum weight scheduing

More information

6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17. Solution 7

6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17. Solution 7 6.434J/16.391J Statistics for Engineers and Scientists May 4 MIT, Spring 2006 Handout #17 Soution 7 Probem 1: Generating Random Variabes Each part of this probem requires impementation in MATLAB. For the

More information

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network

An Algorithm for Pruning Redundant Modules in Min-Max Modular Network An Agorithm for Pruning Redundant Modues in Min-Max Moduar Network Hui-Cheng Lian and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University 1954 Hua Shan Rd., Shanghai

More information

Lecture Note 3: Stationary Iterative Methods

Lecture Note 3: Stationary Iterative Methods MATH 5330: Computationa Methods of Linear Agebra Lecture Note 3: Stationary Iterative Methods Xianyi Zeng Department of Mathematica Sciences, UTEP Stationary Iterative Methods The Gaussian eimination (or

More information

https://doi.org/ /epjconf/

https://doi.org/ /epjconf/ HOW TO APPLY THE OPTIMAL ESTIMATION METHOD TO YOUR LIDAR MEASUREMENTS FOR IMPROVED RETRIEVALS OF TEMPERATURE AND COMPOSITION R. J. Sica 1,2,*, A. Haefee 2,1, A. Jaai 1, S. Gamage 1 and G. Farhani 1 1 Department

More information

Statistical Learning Theory: a Primer

Statistical Learning Theory: a Primer ??,??, 1 6 (??) c?? Kuwer Academic Pubishers, Boston. Manufactured in The Netherands. Statistica Learning Theory: a Primer THEODOROS EVGENIOU AND MASSIMILIANO PONTIL Center for Bioogica and Computationa

More information

A Comparison Study of the Test for Right Censored and Grouped Data

A Comparison Study of the Test for Right Censored and Grouped Data Communications for Statistica Appications and Methods 2015, Vo. 22, No. 4, 313 320 DOI: http://dx.doi.org/10.5351/csam.2015.22.4.313 Print ISSN 2287-7843 / Onine ISSN 2383-4757 A Comparison Study of the

More information

Distributed Cross-Layer Optimization of Wireless Sensor Networks: A Game Theoretic Approach

Distributed Cross-Layer Optimization of Wireless Sensor Networks: A Game Theoretic Approach Distributed Cross-Layer Optimization o Wireess Sensor Networks: A Game Theoretic Approach Jun Yuan and Wei Yu Eectrica and Computer Engineering Department, University o Toronto {steveyuan, weiyu}@commutorontoca

More information

Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms

Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms 4. Statistical Regression for Efficient High-Dimensional odeling of Analog and ixed-signal Performance Variations Xin Li Department of ECE, Carnegie ellon University 5 Forbes Avenue, Pittsburgh, PA 53

More information

Published in: Proceedings of the Twenty Second Nordic Seminar on Computational Mechanics

Published in: Proceedings of the Twenty Second Nordic Seminar on Computational Mechanics Aaborg Universitet An Efficient Formuation of the Easto-pastic Constitutive Matrix on Yied Surface Corners Causen, Johan Christian; Andersen, Lars Vabbersgaard; Damkide, Lars Pubished in: Proceedings of

More information

An Information Geometrical View of Stationary Subspace Analysis

An Information Geometrical View of Stationary Subspace Analysis An Information Geometrica View of Stationary Subspace Anaysis Motoaki Kawanabe, Wojciech Samek, Pau von Bünau, and Frank C. Meinecke Fraunhofer Institute FIRST, Kekuéstr. 7, 12489 Berin, Germany Berin

More information

Expectation-Maximization for Estimating Parameters for a Mixture of Poissons

Expectation-Maximization for Estimating Parameters for a Mixture of Poissons Expectation-Maximization for Estimating Parameters for a Mixture of Poissons Brandon Maone Department of Computer Science University of Hesini February 18, 2014 Abstract This document derives, in excrutiating

More information

Bayesian Unscented Kalman Filter for State Estimation of Nonlinear and Non-Gaussian Systems

Bayesian Unscented Kalman Filter for State Estimation of Nonlinear and Non-Gaussian Systems Bayesian Unscented Kaman Fiter for State Estimation of Noninear and Non-aussian Systems Zhong Liu, Shing-Chow Chan, Ho-Chun Wu and iafei Wu Department of Eectrica and Eectronic Engineering, he University

More information

Stochastic Complement Analysis of Multi-Server Threshold Queues. with Hysteresis. Abstract

Stochastic Complement Analysis of Multi-Server Threshold Queues. with Hysteresis. Abstract Stochastic Compement Anaysis of Muti-Server Threshod Queues with Hysteresis John C.S. Lui The Dept. of Computer Science & Engineering The Chinese University of Hong Kong Leana Goubchik Dept. of Computer

More information

Moreau-Yosida Regularization for Grouped Tree Structure Learning

Moreau-Yosida Regularization for Grouped Tree Structure Learning Moreau-Yosida Reguarization for Grouped Tree Structure Learning Jun Liu Computer Science and Engineering Arizona State University J.Liu@asu.edu Jieping Ye Computer Science and Engineering Arizona State

More information

Combining reaction kinetics to the multi-phase Gibbs energy calculation

Combining reaction kinetics to the multi-phase Gibbs energy calculation 7 th European Symposium on Computer Aided Process Engineering ESCAPE7 V. Pesu and P.S. Agachi (Editors) 2007 Esevier B.V. A rights reserved. Combining reaction inetics to the muti-phase Gibbs energy cacuation

More information

Source and Relay Matrices Optimization for Multiuser Multi-Hop MIMO Relay Systems

Source and Relay Matrices Optimization for Multiuser Multi-Hop MIMO Relay Systems Source and Reay Matrices Optimization for Mutiuser Muti-Hop MIMO Reay Systems Yue Rong Department of Eectrica and Computer Engineering, Curtin University, Bentey, WA 6102, Austraia Abstract In this paper,

More information

A proposed nonparametric mixture density estimation using B-spline functions

A proposed nonparametric mixture density estimation using B-spline functions A proposed nonparametric mixture density estimation using B-spine functions Atizez Hadrich a,b, Mourad Zribi a, Afif Masmoudi b a Laboratoire d Informatique Signa et Image de a Côte d Opae (LISIC-EA 4491),

More information

A Fundamental Storage-Communication Tradeoff in Distributed Computing with Straggling Nodes

A Fundamental Storage-Communication Tradeoff in Distributed Computing with Straggling Nodes A Fundamenta Storage-Communication Tradeoff in Distributed Computing with Stragging odes ifa Yan, Michèe Wigger LTCI, Téécom ParisTech 75013 Paris, France Emai: {qifa.yan, michee.wigger} @teecom-paristech.fr

More information

Two-sample inference for normal mean vectors based on monotone missing data

Two-sample inference for normal mean vectors based on monotone missing data Journa of Mutivariate Anaysis 97 (006 6 76 wwweseviercom/ocate/jmva Two-sampe inference for norma mean vectors based on monotone missing data Jianqi Yu a, K Krishnamoorthy a,, Maruthy K Pannaa b a Department

More information

Automobile Prices in Market Equilibrium. Berry, Pakes and Levinsohn

Automobile Prices in Market Equilibrium. Berry, Pakes and Levinsohn Automobie Prices in Market Equiibrium Berry, Pakes and Levinsohn Empirica Anaysis of demand and suppy in a differentiated products market: equiibrium in the U.S. automobie market. Oigopoistic Differentiated

More information

Nonlinear Gaussian Filtering via Radial Basis Function Approximation

Nonlinear Gaussian Filtering via Radial Basis Function Approximation 51st IEEE Conference on Decision and Contro December 10-13 01 Maui Hawaii USA Noninear Gaussian Fitering via Radia Basis Function Approximation Huazhen Fang Jia Wang and Raymond A de Caafon Abstract This

More information

Separation of Variables and a Spherical Shell with Surface Charge

Separation of Variables and a Spherical Shell with Surface Charge Separation of Variabes and a Spherica She with Surface Charge In cass we worked out the eectrostatic potentia due to a spherica she of radius R with a surface charge density σθ = σ cos θ. This cacuation

More information

STA 216 Project: Spline Approach to Discrete Survival Analysis

STA 216 Project: Spline Approach to Discrete Survival Analysis : Spine Approach to Discrete Surviva Anaysis November 4, 005 1 Introduction Athough continuous surviva anaysis differs much from the discrete surviva anaysis, there is certain ink between the two modeing

More information

Research of Data Fusion Method of Multi-Sensor Based on Correlation Coefficient of Confidence Distance

Research of Data Fusion Method of Multi-Sensor Based on Correlation Coefficient of Confidence Distance Send Orders for Reprints to reprints@benthamscience.ae 340 The Open Cybernetics & Systemics Journa, 015, 9, 340-344 Open Access Research of Data Fusion Method of Muti-Sensor Based on Correation Coefficient

More information

Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels

Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channes arxiv:cs/060700v1 [cs.it] 6 Ju 006 Chun-Hao Hsu and Achieas Anastasopouos Eectrica Engineering and Computer Science Department University

More information

9th International Symposium on Quality Electronic Design

9th International Symposium on Quality Electronic Design 9th International Symposium on Quality Electronic Design Projection-Based Piecewise-Linear Response Surface Modeling for Strongly Nonlinear VLSI Performance Variations Xin Li Department of Electrical and

More information

Scalable Spectrum Allocation for Large Networks Based on Sparse Optimization

Scalable Spectrum Allocation for Large Networks Based on Sparse Optimization Scaabe Spectrum ocation for Large Networks ased on Sparse Optimization innan Zhuang Modem R&D Lab Samsung Semiconductor, Inc. San Diego, C Dongning Guo, Ermin Wei, and Michae L. Honig Department of Eectrica

More information

Worst Case Analysis of the Analog Circuits

Worst Case Analysis of the Analog Circuits Proceedings of the 11th WSEAS Internationa Conference on CIRCUITS, Agios Nikoaos, Crete Isand, Greece, Juy 3-5, 7 9 Worst Case Anaysis of the Anaog Circuits ELENA NICULESCU*, DORINA-MIOARA PURCARU* and

More information

Paper presented at the Workshop on Space Charge Physics in High Intensity Hadron Rings, sponsored by Brookhaven National Laboratory, May 4-7,1998

Paper presented at the Workshop on Space Charge Physics in High Intensity Hadron Rings, sponsored by Brookhaven National Laboratory, May 4-7,1998 Paper presented at the Workshop on Space Charge Physics in High ntensity Hadron Rings, sponsored by Brookhaven Nationa Laboratory, May 4-7,998 Noninear Sef Consistent High Resoution Beam Hao Agorithm in

More information

PERFORMANCE COMPARISON OF OPEN AND CLOSED LOOP OPERATION OF UPFC

PERFORMANCE COMPARISON OF OPEN AND CLOSED LOOP OPERATION OF UPFC OL. 3, NO. 5, OCTOE 008 ISSN 89-6608 AN Journa o Engineering and Appied Sciences 006-008 Asian esearch ubishing Networ (AN. A rights reserved. www.arpnournas.com EFOMANCE COMAISON OF OEN AND CLOSED LOO

More information

Statistics for Applications. Chapter 7: Regression 1/43

Statistics for Applications. Chapter 7: Regression 1/43 Statistics for Appications Chapter 7: Regression 1/43 Heuristics of the inear regression (1) Consider a coud of i.i.d. random points (X i,y i ),i =1,...,n : 2/43 Heuristics of the inear regression (2)

More information

A Statistical Framework for Real-time Event Detection in Power Systems

A Statistical Framework for Real-time Event Detection in Power Systems 1 A Statistica Framework for Rea-time Event Detection in Power Systems Noan Uhrich, Tim Christman, Phiip Swisher, and Xichen Jiang Abstract A quickest change detection (QCD) agorithm is appied to the probem

More information

Algorithms to solve massively under-defined systems of multivariate quadratic equations

Algorithms to solve massively under-defined systems of multivariate quadratic equations Agorithms to sove massivey under-defined systems of mutivariate quadratic equations Yasufumi Hashimoto Abstract It is we known that the probem to sove a set of randomy chosen mutivariate quadratic equations

More information

Collective organization in an adaptative mixture of experts

Collective organization in an adaptative mixture of experts Coective organization in an adaptative mixture of experts Vincent Vigneron, Christine Fuchen, Jean-Marc Martinez To cite this version: Vincent Vigneron, Christine Fuchen, Jean-Marc Martinez. Coective organization

More information

A Novel Learning Method for Elman Neural Network Using Local Search

A Novel Learning Method for Elman Neural Network Using Local Search Neura Information Processing Letters and Reviews Vo. 11, No. 8, August 2007 LETTER A Nove Learning Method for Eman Neura Networ Using Loca Search Facuty of Engineering, Toyama University, Gofuu 3190 Toyama

More information

A Tool for Converting FEM Models into Representations Suitable for Control Synthesis

A Tool for Converting FEM Models into Representations Suitable for Control Synthesis Proceedings o the 17th Word Congress The Internationa Federation o Automatic Contro Seou, Korea, Juy 6-11, 8 A Too or Converting FEM Modes into Representations Suitabe or Contro Synthesis Syed Fawad Raza

More information

arxiv: v1 [cs.lg] 31 Oct 2017

arxiv: v1 [cs.lg] 31 Oct 2017 ACCELERATED SPARSE SUBSPACE CLUSTERING Abofaz Hashemi and Haris Vikao Department of Eectrica and Computer Engineering, University of Texas at Austin, Austin, TX, USA arxiv:7.26v [cs.lg] 3 Oct 27 ABSTRACT

More information

BP neural network-based sports performance prediction model applied research

BP neural network-based sports performance prediction model applied research Avaiabe onine www.jocpr.com Journa of Chemica and Pharmaceutica Research, 204, 6(7:93-936 Research Artice ISSN : 0975-7384 CODEN(USA : JCPRC5 BP neura networ-based sports performance prediction mode appied

More information

Statistical Astronomy

Statistical Astronomy Lectures for the 7 th IAU ISYA Ifrane, nd 3 rd Juy 4 p ( x y, I) p( y x, I) p( x, I) p( y, I) Statistica Astronomy Martin Hendry, Dept of Physics and Astronomy University of Gasgow, UK http://www.astro.ga.ac.uk/users/martin/isya/

More information

Learning Structural Changes of Gaussian Graphical Models in Controlled Experiments

Learning Structural Changes of Gaussian Graphical Models in Controlled Experiments Learning Structura Changes of Gaussian Graphica Modes in Controed Experiments Bai Zhang and Yue Wang Bradey Department of Eectrica and Computer Engineering Virginia Poytechnic Institute and State University

More information

Optimality of Inference in Hierarchical Coding for Distributed Object-Based Representations

Optimality of Inference in Hierarchical Coding for Distributed Object-Based Representations Optimaity of Inference in Hierarchica Coding for Distributed Object-Based Representations Simon Brodeur, Jean Rouat NECOTIS, Département génie éectrique et génie informatique, Université de Sherbrooke,

More information

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES Separation of variabes is a method to sove certain PDEs which have a warped product structure. First, on R n, a inear PDE of order m is

More information

Multi-server queueing systems with multiple priority classes

Multi-server queueing systems with multiple priority classes Muti-server queueing systems with mutipe priority casses Mor Harcho-Bater Taayui Osogami Aan Scheer-Wof Adam Wierman Abstract We present the first near-exact anaysis of an M/PH/ queue with m > 2 preemptive-resume

More information

High Spectral Resolution Infrared Radiance Modeling Using Optimal Spectral Sampling (OSS) Method

High Spectral Resolution Infrared Radiance Modeling Using Optimal Spectral Sampling (OSS) Method High Spectra Resoution Infrared Radiance Modeing Using Optima Spectra Samping (OSS) Method J.-L. Moncet and G. Uymin Background Optima Spectra Samping (OSS) method is a fast and accurate monochromatic

More information

From Margins to Probabilities in Multiclass Learning Problems

From Margins to Probabilities in Multiclass Learning Problems From Margins to Probabiities in Muticass Learning Probems Andrea Passerini and Massimiiano Ponti 2 and Paoo Frasconi 3 Abstract. We study the probem of muticass cassification within the framework of error

More information

Maximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problem

Maximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problem 1 Maximum ikeihood decoding of treis codes in fading channes with no receiver CSI is a poynomia-compexity probem Chun-Hao Hsu and Achieas Anastasopouos Eectrica Engineering and Computer Science Department

More information

Active Learning & Experimental Design

Active Learning & Experimental Design Active Learning & Experimenta Design Danie Ting Heaviy modified, of course, by Lye Ungar Origina Sides by Barbara Engehardt and Aex Shyr Lye Ungar, University of Pennsyvania Motivation u Data coection

More information

Appendix A: MATLAB commands for neural networks

Appendix A: MATLAB commands for neural networks Appendix A: MATLAB commands for neura networks 132 Appendix A: MATLAB commands for neura networks p=importdata('pn.xs'); t=importdata('tn.xs'); [pn,meanp,stdp,tn,meant,stdt]=prestd(p,t); for m=1:10 net=newff(minmax(pn),[m,1],{'tansig','purein'},'trainm');

More information

An approximate method for solving the inverse scattering problem with fixed-energy data

An approximate method for solving the inverse scattering problem with fixed-energy data J. Inv. I-Posed Probems, Vo. 7, No. 6, pp. 561 571 (1999) c VSP 1999 An approximate method for soving the inverse scattering probem with fixed-energy data A. G. Ramm and W. Scheid Received May 12, 1999

More information

Incremental Reformulated Automatic Relevance Determination

Incremental Reformulated Automatic Relevance Determination IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60, NO. 9, SEPTEMBER 22 4977 Incrementa Reformuated Automatic Reevance Determination Dmitriy Shutin, Sanjeev R. Kukarni, and H. Vincent Poor Abstract In this

More information

<C 2 2. λ 2 l. λ 1 l 1 < C 1

<C 2 2. λ 2 l. λ 1 l 1 < C 1 Teecommunication Network Contro and Management (EE E694) Prof. A. A. Lazar Notes for the ecture of 7/Feb/95 by Huayan Wang (this document was ast LaT E X-ed on May 9,995) Queueing Primer for Muticass Optima

More information

BALANCING REGULAR MATRIX PENCILS

BALANCING REGULAR MATRIX PENCILS BALANCING REGULAR MATRIX PENCILS DAMIEN LEMONNIER AND PAUL VAN DOOREN Abstract. In this paper we present a new diagona baancing technique for reguar matrix pencis λb A, which aims at reducing the sensitivity

More information

Introduction. Figure 1 W8LC Line Array, box and horn element. Highlighted section modelled.

Introduction. Figure 1 W8LC Line Array, box and horn element. Highlighted section modelled. imuation of the acoustic fied produced by cavities using the Boundary Eement Rayeigh Integra Method () and its appication to a horn oudspeaer. tephen Kirup East Lancashire Institute, Due treet, Bacburn,

More information

Structural Control of Probabilistic Boolean Networks and Its Application to Design of Real-Time Pricing Systems

Structural Control of Probabilistic Boolean Networks and Its Application to Design of Real-Time Pricing Systems Preprints of the 9th Word Congress The Internationa Federation of Automatic Contro Structura Contro of Probabiistic Booean Networks and Its Appication to Design of Rea-Time Pricing Systems Koichi Kobayashi

More information

Stochastic Automata Networks (SAN) - Modelling. and Evaluation. Paulo Fernandes 1. Brigitte Plateau 2. May 29, 1997

Stochastic Automata Networks (SAN) - Modelling. and Evaluation. Paulo Fernandes 1. Brigitte Plateau 2. May 29, 1997 Stochastic utomata etworks (S) - Modeing and Evauation Pauo Fernandes rigitte Pateau 2 May 29, 997 Institut ationa Poytechnique de Grenobe { IPG Ecoe ationae Superieure d'informatique et de Mathematiques

More information

Physics 127c: Statistical Mechanics. Fermi Liquid Theory: Collective Modes. Boltzmann Equation. The quasiparticle energy including interactions

Physics 127c: Statistical Mechanics. Fermi Liquid Theory: Collective Modes. Boltzmann Equation. The quasiparticle energy including interactions Physics 27c: Statistica Mechanics Fermi Liquid Theory: Coective Modes Botzmann Equation The quasipartice energy incuding interactions ε p,σ = ε p + f(p, p ; σ, σ )δn p,σ, () p,σ with ε p ε F + v F (p p

More information

8 Digifl'.11 Cth:uits and devices

8 Digifl'.11 Cth:uits and devices 8 Digif'. Cth:uits and devices 8. Introduction In anaog eectronics, votage is a continuous variabe. This is usefu because most physica quantities we encounter are continuous: sound eves, ight intensity,

More information

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After

More information

In-plane shear stiffness of bare steel deck through shell finite element models. G. Bian, B.W. Schafer. June 2017

In-plane shear stiffness of bare steel deck through shell finite element models. G. Bian, B.W. Schafer. June 2017 In-pane shear stiffness of bare stee deck through she finite eement modes G. Bian, B.W. Schafer June 7 COLD-FORMED STEEL RESEARCH CONSORTIUM REPORT SERIES CFSRC R-7- SDII Stee Diaphragm Innovation Initiative

More information

Minimizing Total Weighted Completion Time on Uniform Machines with Unbounded Batch

Minimizing Total Weighted Completion Time on Uniform Machines with Unbounded Batch The Eighth Internationa Symposium on Operations Research and Its Appications (ISORA 09) Zhangiaie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 402 408 Minimizing Tota Weighted Competion

More information

LECTURE NOTES 8 THE TRACELESS SYMMETRIC TENSOR EXPANSION AND STANDARD SPHERICAL HARMONICS

LECTURE NOTES 8 THE TRACELESS SYMMETRIC TENSOR EXPANSION AND STANDARD SPHERICAL HARMONICS MASSACHUSETTS INSTITUTE OF TECHNOLOGY Physics Department Physics 8.07: Eectromagnetism II October, 202 Prof. Aan Guth LECTURE NOTES 8 THE TRACELESS SYMMETRIC TENSOR EXPANSION AND STANDARD SPHERICAL HARMONICS

More information

LIKELIHOOD RATIO TEST FOR THE HYPER- BLOCK MATRIX SPHERICITY COVARIANCE STRUCTURE CHARACTERIZATION OF THE EXACT

LIKELIHOOD RATIO TEST FOR THE HYPER- BLOCK MATRIX SPHERICITY COVARIANCE STRUCTURE CHARACTERIZATION OF THE EXACT LIKELIHOOD RATIO TEST FOR THE HYPER- BLOCK MATRIX SPHERICITY COVARIACE STRUCTURE CHARACTERIZATIO OF THE EXACT DISTRIBUTIO AD DEVELOPMET OF EAR-EXACT DISTRIBUTIOS FOR THE TEST STATISTIC Authors: Bárbara

More information

A Solution to the 4-bit Parity Problem with a Single Quaternary Neuron

A Solution to the 4-bit Parity Problem with a Single Quaternary Neuron Neura Information Processing - Letters and Reviews Vo. 5, No. 2, November 2004 LETTER A Soution to the 4-bit Parity Probem with a Singe Quaternary Neuron Tohru Nitta Nationa Institute of Advanced Industria

More information

Estimating the Power Spectrum of the Cosmic Microwave Background

Estimating the Power Spectrum of the Cosmic Microwave Background Estimating the Power Spectrum of the Cosmic Microwave Background J. R. Bond 1,A.H.Jaffe 2,andL.Knox 1 1 Canadian Institute for Theoretica Astrophysics, Toronto, O M5S 3H8, CAADA 2 Center for Partice Astrophysics,

More information

Discrete Techniques. Chapter Introduction

Discrete Techniques. Chapter Introduction Chapter 3 Discrete Techniques 3. Introduction In the previous two chapters we introduced Fourier transforms of continuous functions of the periodic and non-periodic (finite energy) type, we as various

More information

Introduction to LMTO method

Introduction to LMTO method 1 Introduction to MTO method 24 February 2011; V172 P.Ravindran, FME-course on Ab initio Modeing of soar ce Materias 24 February 2011 Introduction to MTO method Ab initio Eectronic Structure Cacuations

More information

Turbo Codes. Coding and Communication Laboratory. Dept. of Electrical Engineering, National Chung Hsing University

Turbo Codes. Coding and Communication Laboratory. Dept. of Electrical Engineering, National Chung Hsing University Turbo Codes Coding and Communication Laboratory Dept. of Eectrica Engineering, Nationa Chung Hsing University Turbo codes 1 Chapter 12: Turbo Codes 1. Introduction 2. Turbo code encoder 3. Design of intereaver

More information

Nonlinear Analysis of Spatial Trusses

Nonlinear Analysis of Spatial Trusses Noninear Anaysis of Spatia Trusses João Barrigó October 14 Abstract The present work addresses the noninear behavior of space trusses A formuation for geometrica noninear anaysis is presented, which incudes

More information