Outage and Diversity of Linear Receivers in Flat-Fading MIMO Channels

Size: px
Start display at page:

Download "Outage and Diversity of Linear Receivers in Flat-Fading MIMO Channels"

Transcription

1 Outage and Dversty of Lnear Recevers n Flat-Fadng IO Channels Ahmadreza Hedayat ember, IEEE, and Ara Nosratna Senor ember, IEEE Abstract Ths correspondence studes lnear recevers for IO channels under frequency-nonselectve flat quas-statc Raylegh fadng. The outage probablty and dversty gan of SE and Zero Forcng recevers are nvestgated. It s found that contrary to ntuton, SE and zero-forcng recevers may not perform smlarly at hgh SNR. Assumng transmt and N receve antennas, the zero-forcng recever always has dversty N +, unle the SE recever, whose behavor can vary. Under separate spatal encodng, where data from each transmt antenna s separately encoded, SE s no better than n terms of dversty. But for jont spatal encodng systems, where an encoded stream s sent from all the antennas, the SE recever acheves dversty N at low spectral effcences but has dversty only N + at hgh spectral effcences. I. INTRODUCTION The fadng wreless IO channel s characterzed by a mxng nterference of the sgnals arrvng from multple transmtter antennas. Sometmes multple transmt antennas are only used to ncrease relablty, e.g. orthogonal space-tme codes, thus the sgnals from multple antennas are tghtly structured and the nterference can be undone at the recever. However, transmt sgnals do not always have as much structure e.g. n the case of spatal multplexng thus more elaborate methods may be needed to remove the spatal nterference [], [2]. For example, nullng-and-cancellng detectors [], [2], [3] are capable of provdng optmal detecton. Lnear recevers, even though suboptmal, are much smpler and therefore useful for many applcatons. In ths correspondence, we study lnear IO recevers under quasstatc flat fadng. We calculate the dversty of lnear recevers va ther outage probabltes. Snce the outage probablty s closely related to the frame error rate, ths also provdes a tangble measure of the performance of realstc systems. A summary of our results s as follows: For a IO system consstng of transmt and N receve antennas, under flat Raylegh fadng, zero-forcng recevers acheve dversty order N + under all cases studed. SE recevers acheve the same dversty for transmsson strateges that do not allow combned codng of data streams, e.g. horzontal spatal encodng. However, for codng strateges that allow jont encodng of data streams, e.g. D-BLAST, a more nterestng scenaro emerges. In such systems, for low spectral effcences SE recevers can acheve the full dversty of N, whle A. Hedayat s wth Navn Networs, Rchardson, TX, USA Emal: hedayat@eee.org. A. Nosratna s wth the Dept. of Electrcal Engneerng, The Unversty of Texas at Dallas, Rchardson, TX, USA E- mal:ara@utdallas.edu. Ths wor was presented n part at ICASSP 25. for hgh spectral effcences only a dversty of + N s possble. For ntermedate values of R, dverstes n between the two extremes are observed. II. LINEAR RECEIVERS The nput-output system model for flat fadng IO channel wth transmt and N receve antennas s r Hc + n, where c s the transmtted vector, n C N s the Gaussan nose vector, and r s the N receved vector at a gven tme nstant. Throughout ths paper, we assume H has ndependent and dentcally dstrbuted complex Gaussan entres,.e. H C N. We consder lnear recevers and evaluate the outage probablty of a flat fadng IO channel followed by a or SE recever, assumng the channel s perfectly nown to the recever. The recever s F H H H H H, whch transforms the receved sgnal to ˆr F r c + H H H H H n. The SE recever s F SE H H H + ρ I H H, where ρ s the receved SNR. Snce the symbols are detected ndvdually, the SINR of the ndvdual symbols determnes the performance. The detecton nose of recever, ñ H H H H H n, s a complex Gaussan vector wth zero-mean and covarance matrx Rñ σnh 2 H H. The th dagonal element of Rñ s gven by: Rñ, σ 2 nh H H ĤH det Ĥ σn 2 det H H H, where represents the th dagonal element of the nverse of, and Ĥ s obtaned by removng the th row of H. The assocated SINR s γ E x /Rñ,, whch can be shown to be a ch-square random varable wth 2N + degrees of freedom [4], [5]. The CDF of Y χ 2N +, wth varance.5 for the partcpatng Gaussan random varables, s: N + F Y y e y y!. 2 The SINR of the th symbol of SE detector s determned by nose and resdual nterference γ h H Ĥ Ĥ H + ρ I h I + ρh H H 3, where h s the th column of H. Removng ths column from H gves Ĥ C N [6].

2 2 Equaton 3 shows that γ s a quadratc form whose statstcs has been derved n [7] as follows. Consderng the random matrx Ĥ CN and the random vector h C N, the quadratc form Y h H ĤĤH + ρ I h has the CDF F Y y exp y N ρ n A n y y, 4 n! ρ n where the auxlary functons A n y are gven by { N + n A n y + N n Cy N < + n. +y, 5 and C s the coeffcent of y n + y [7]. In general, the SINR of the output symbols of the SE recever are correlated, unle those of the zero-forcng recever. III. OUTAGE PROBABILITY IN SEPARATE SPATIAL ENCODING In separate spatal encodng, the data stream s demultplexed to several sub-streams, one for each transmt antenna. Furthermore, the resultng streams are not jontly encoded, to acheve easer decodng. Horzontally encoded V-BLAST s a promnent example of ths strategy. In ths scenaro, f any of the data streams s n outage, the entre system s n outage. Hence, the outage event O occurs when any of the subchannels cannot support the rate that s assgned to t. In our analyss, we consder equal rate for the sub-channels, however, t s also possble to have a non-unform rate assgnment. After lnear transformaton, the mutual nformaton between the elements of ˆr and the transmtted data vector c s Ic ; ˆr log + γ. Assume the target rate s R, and let L N. Accordng to 2 and 4, the statstcs of γ s nvarant to. Thus, the outage probablty PrO s : { PrO Pr Ic ; ˆr R } Pr Ic ; ˆr R Pr Ic ; ˆr < R, 6 where 6 s accurate when sub-channel outage probabltes are small. In the above, we have assumed that sub-channel outage events are ndependent, whch s vald for. For SE recevers the sub-channel outage events are not strctly ndependent, but the approxmaton used only n ths secton maes the analyss tractable and does not affect dversty. Smulatons show that the approxmaton has been properly used. Alternatvely, one may consder only the outage event of a sngle sub-channel, whch s an approxmaton that s accurate enough for dversty calculaton. Usng the CDF of χ 2N + n the evaluaton of 6 gves the outage probablty for the recever, whch s PrO F Y 2 R/ 2R/ L+ L +! ρ L+, 7 where denotes equvalence n the lmt as ρ. Thus the dversty order s L +. Substtutng the dstrbuton 4 n 6, the SE outage probablty s calculated: PrO F Y 2 R y L+ L +! y + y ρ L+,8 R y2 whch shows that SE dversty order s also L +. However, the and SE outage probabltes are not exactly the same. The rato of 7 to 8 s: PrO + y 2 R PrO SE y. R y2 2 R 9 Note that the rato of outage probabltes n 9 remans fxed regardless of SNR and t only depends on the relatve target rate R. When R s small the outage probablty of becomes larger than that of SE. The rato 9 approaches one when R s large see Secton V. Generalzaton of the above results to non-unform rate assgnment s straghtforward. Unform and non-unform rate assgnment have the same dversty, even though they have dfferent outage probablty performance. IV. OUTAGE PROBABILITY IN JOINT SPATIAL ENCODING In jont spatal encodng, the data stream s encoded and then demultplexed nto sub-streams, each gong to one antenna e.g. D-BLAST. Thus, each data symbol can contrbute to sgnals of all the transmt antennas. The recever s n outage when the aggregate mutual nformaton of all the sub-channels fals to support the target rate. The mutual nformaton between the elements of the lnearly transformed receve sgnal, ˆr and the transmtted data vector c s Ic ; ˆr log + γ. Assumng the target rate s R, the probablty of the outage event O s PrO Pr log + γ < R Pr + γ < 2 R. Theorem : Consder a flat IO channel wth transmt and N receve antennas, and jont spatal encodng. Under perfect channel state nformaton avalable to the recever, the outage probablty of recevers decays wth order of N +. Proof: See the Appendx. Thus, we observe that the dversty s the same for separate and jont spatal encodng. To obtan the SE outage probablty, we substtute the SINR from 3 n, whch gves: PrO Pr I + ρh H H > 2 R. 2 The dependence on the dagonal elements of the random matrx I + ρh H H maes further analyss ntractable.

3 3 Therefore, we proceed to provde an upper bound to ths probablty. Rewrtng the sum mutual nformaton as n, we have I Ic ; ˆr log + ρh H H log I + ρh H H 3 I log tr + ρh H H log, 4 + ρλ where 3 s due to Jensen s nequalty, and λ s are the egenvalues of the Wshart matrx H H H. Substtutng 4 nto gves: PrO Pr 2 R. 5 + ρλ Though 5 s an upper bound of the outage probablty, n Secton V, through smulaton, we show that t s a tght upper bound n low and hgh spectral effcency. Assumng N, the jont PDF of the egenvalues of H H H, λ s, λ λ 2 λ, s f Λ λ K,N λ N λ λ j 2 exp λ, <j 6 where K,N s a normalzng constant [8]. The evaluaton of 5 for a specfc outage rate R s rather dffcult, due to the shape of the outage regon. However, one can calculate the bound for small and large values of R where the the outage regon can be approxmated by regons wth smpler shapes. For a IO channel wth 2 and N 2, the bound 5 s PrO Pr + 2 R ρλ + ρλ 2 For convenence defne Sλ, λ 2 and also defne the set { A λ, λ 2 : + ρλ + + ρλ + + ρλ 2 } 2 R 2. + ρλ 2 Then the rght hand sde of 7 s PrA. Exact calculaton of PrA s not easy, thus we show ts asymptotc behavor by boundng t from below and above. Let R < 2. If λ outage occurs only when λ 2 c 2 2 b ρb, where b 2 R 2. Because the curve Sλ, λ 2 b s convex, the regon A s contaned n the sosceles rght trangle wth the base λ + λ 2 c 2 and the two sdes λ and λ 2, and ntegral over the trangle s always larger than PrA. We now buld another trangle that s contaned by A. Usng the symmetry of Sλ, λ 2, t s not dffcult to calculate that an sosceles trangle wth base λ +λ 2 c 2, where c 2 2 b bρ, s contaned n A and ntegraton over ths trangle s always smaller than PrA. Fnally, we show that probablty ntegrals over the two trangles behave the same asymptotcally, thus completng a sandwch argument. To do so, consder the ntegral over any such sosceles trangle wth parameter c: K 2,N c e λ λ N 2 c λ 2K 2,N N!N 2! λ N 2 2 λ λ 2 2 e λ2 dλ 2 dλ 2N e c c! ρ 2N 8 where c could be c 2 or c 2. Snce PrA s bounded above and below by values that have dversty-2n, t must have dversty 2N. Now recall that PrO PrA therefore we have establshed that outage has dversty no less than 2N. Consderng that 2N s also the maxmum achevable dversty order, we conclude that outage has exactly dversty order 2N. Ths concludes the arguments for small spectral effcences. Now we consder hgh spectral effcences, namely R > 2 and b <. In ths case, λ 2 can drve the system to outage regardless of the value of λ and vce versa. For nstance, let λ, as long as λ 2 d 2 b ρb, outage occurs. Thus, the outage regon has a strp along the λ axs for large enough λ, and lewse along λ 2. In fact, the set of strps defned as λ 2, λ d 2 and λ, λ 2 d 2 s contaned n A. Snce Sλ, λ 2 b s convex, t s possble to fnd d 2, whch s proportonal to ρ but d 2 > d 2, such that A contans the strps λ 2, λ d 2 and λ, λ 2 d 2. The probablty of the above sets can be characterzed usng the followng expresson: 2K 2,N d e λ λ N 2 λ N 2 2 λ λ 2 2 e λ2 dλ 2 dλ ρ N, 9 where d could be d 2 or d 2. Therefore 9 ndcates that the upper bound 7 has the dversty N L+, where L N. In the calculaton of 9, the ntersecton of the two orthogonal strps s calculated twce, but the ntersecton has a probablty that decays wth ρ 2N and does not affect the asymptotc behavor of 9. The outage bounds developed above show the surprsng fact that SE recevers can acheve the same dversty as the L recever for small values of R n jont spatal encodng. However, for large values of R the dversty performance of SE and s the same. Hence, for SE the dversty vares from the dversty of an unconstraned recever to that of, dependng of the target rate R. Comparng to the results from Secton III for separate spatal encoders, the SE recever has dfferent dversty n jont spatal encodng archtecture, except for large outage rate R. The prevous results of the case 2, N 2 can be extended to arbtrary values of and N. We state the general result n the followng theorem.

4 4 PrO 2 SE n the ntermedate values of R, t does predct dversty order varyng wth R. Fgure 3 presents smlar results for a flat fadng IO channel wth N 2 and correlated transmt antennas wth correlaton factor ρ t.5. Outage probabltes are slghtly hgher than the uncorrelated case, however, the behavor of outage probabltes are the same. Fgure 3 also shows the results for uncorrelated IO channel wth N SNR db Fg.. Outage probablty of lnear recevers, N 2. The pars of sold and dashed lnes, from left, correspond to SE and for rates R, 2, 4, bts/sec/hz. Theorem 2: Consder a flat IO channel wth transmt and N receve antennas, and jont spatal encodng. Under perfect channel state nformaton avalable to the recever, the upper bound 5 on the outage probablty of SE recevers decays wth order of N at low spectral effcency,.e. R < log, resultng n the dversty order of N for the outage probablty. At hgh spectral effcency R > log, 5 decays wth the order of N +. Proof: See the Appendx. V. SIULATION RESULTS We consder a IO system wth two antennas n transmt and receve sdes: N 2. The outage probablty of the lnear recevers n the separate archtecture s shown n Fgure. The target rate s R, 2, 4, bts/sec/hz. As expected, both lnear detectors show dversty order of one, regardless of the target rate. For hgher values of R the dfference of and SE performance s neglgble. But, for lower values of R, SE performs better than for all SNR. The dependency of the relatve performance of these recevers on the target rate R s n agreement wth 9. In hgh SNR, the rato of the outage probabltes remans fxed. Fgure 2 shows the outage probablty of the unconstraned recever and lnear recevers n a jont spatal encodng archtecture. The unconstraned recever has the full dversty of the channel. The recever has dversty one as expected from the analyss n Secton IV. The dversty order of remans unchanged regardless of the target rate R. Surprsngly, SE dversty depends on R: n lower values of R the dversty order s very close to that of the unconstraned recever, and n hgher values of R ts dversty becomes the same as dversty. These results are n agreement wth the analyss n Secton IV. Fgure 2 also shows the outage probablty of the SE recever and the upper bound 5. The bound s tght at ether low or hgh values of R. Though the bound s loose VI. CONCLUSION We present new results on the performance of lnear recevers for the removal of spatal nterference n IO Raylegh flat fadng channels, and calculate ther dversty order. Our analytcal and expermental results show that SE recevers have outage probablty wth varyng decayng slope: t may decay as fast as the outage probablty of unconstraned recever, wth the full order of N, or as slowly as that of recevers, wth the order of N +, dependng on the spectral effcency. The authors gratefully acnowledge comments from Dr. Naofal Al-Dhahr. APPENDIX Proof of Theorem : The SINR of the sub-channels under are ndependent ch-square random varables wth degrees 2N +. Let Y χ 2N +,,,. The outage probablty of s gven by the CDF of the random varable + Y + Y + + Y. 2 Among the components of the above random varable, the last term, whch s the product of Y s, determnes the dversty order snce t s a ch-square wth the lowest degree. In the followng, through recurson, we show that Y Y 2 Y has dversty order L +. Let us start by Z Y Y 2. The PDF of Z s 2 f Z z L! 2 zl K 2 z, 2 where K s the zeroth order modfed Bessel functon of the second nd [9], whch for small values of z s a constant. Therefore, for small values of z the frst order approxmaton of f Z z s z L. Ths shows that the CDF of Z, F Z z, has frst order approxmaton equal to z L+, whch ndcates the dversty order of L +. Now consder the CDF of W Y Y 2 Y 3 Z Y, where Y χ 2N + : F W w PrW w PrZ Y w α f Z zf Y w z dz z L K 2 z e w z L+2 For small values of x: K mx Γm 2 2/x m [9]. w z! dz

5 5 SE bound PrO 2 3 PrO L SE SNR db SNR db Fg. 2. Left: Comparson of recevers. Rght: SE outage and the upper bound 5. N 2 and the curves show rates R,2,4, bts/sec/hz. PrO 2 3 PrO L SE SNR db 5 6 L SE SNR db Fg. 3. Comparson of recevers. Left: N 2, correlated transmt antennas wth ρ t.5, R,2,4, bts/sec/hz. Rght: N 4, uncorrelated, R4,8,2,6 bts/sec/hz. where α s a constant. The frst order approxmaton of above around zero s w L+ α zl +! K 2 z dz. Thus, F W w behaves le the L+th power of w, ndcatng the dversty order L +. Ths procedure can be appled recursvely to fnd that the frst order approxmaton of the CDF of Y Y 2 Y behaves le w L+. As mentoned, the product term n 2 domnates the dversty. We just showed that the product term Y Y 2 Y has the dversty order L +. Therefore, the dversty order s L +. Proof of Theorem 2: Frst, we state and prove the followng lemma. Lemma : Let I λ x e λ λ dλ dλ. 22 I s polynomal n x wth the mnmum exponent of g +, where and are ntegers. Proof: Wth some algebra, one can obtan x x λ m e λ dλ m! λ m x λ n e λ dλ m+ x!, 23 n Cj, n j x n j m + j! j lm+j+ x l l!, 24 where m and n are ntegers and C, are the bnomal coeffcents. Usng 23 and 24, I 2 can be calculated as I 2 + n!! Cj, j x j 2 + j! j l 2+j+ where the mnmum exponent of x s g Now we use nducton. Assume that I x l l!,

6 6 g I x a x. Then λ e λ g a x a g j λ x λ e λ λ e λ x λ dλ λ Cj, j x j + j! l +j+ 25 where 25 s obtaned usng 24. Equaton 25 ndcates that I s polynomal n x wth the mnmum exponent of g + + g. To prove Theorem 2, we frst note that λ λ j 2 <j,..., S p,, λ, 26 where the set S s a subset of the,, ndexes that, and p,, s the correspondng nteger coeffcent. In low spectral effcency, R < log, we can wrte the rght-hand sde of 5 as K,N e λ λ λ j 2 dλ dλ A K,N,..., S A e λ λ N <j p,, λ N + dλ dλ. 27 We now bound the ntegraton regon A, from nsde and from outsde, by polyhedra. Then we use a sandwch argument by showng that the ntegraton over the nner and outer polyhedra gves the same asymptotc performance. Usng a drect extenson of the argument developed n the two-dmensonal case proceedng Equaton 8, t can be seen that the polyhedron defned by λ, λ c, where c ρ 2 R + 2 R, contans the ntegraton regon A. Therefore an ntegral over ths polyhedron upper bounds the outage probablty. Now consder another polyhedron defned by λ, λ c, where c s proportonal to ρ but small enough so that A contans ths polyhedron. The base of ths polyhedron can be calculated smlarly to Secton IV. c ρ 2 R/ Integraton over ths new polyhedron, whch s characterzed by c, lower bounds PrA. Fnally Lemma establshes that the asymptotc behavor of 27, whle ntegratng over ether of the two polyhedra, s the same. Each multple ntegral n 27 s n the form of I dλ dλ of Lemma,.e., polynomal n c wth smallest exponent + N + N. Therefore, the upper bound 5 decays wth ρ N n low spectral effcency, ndcatng dversty order s no less than N. At the same tme, N s actually the maxmum possble dversty order, so the outage probablty of SE recever has dversty of N. We now proceed to show the hgh-rate result, where the x l l!, developments parallel those for 2 n 9. For R > log the outage regon A can be upper and lower bounded wth orthogonal slabs along the coordnates. The frst set that s a subset of A has orthogonal slabs where the j-th slab s defned as λ j d and λ j, where d ρ 2 R. The outage regon A s a subset of the second set of slabs whose defnton s the same as the frst set wth d replaced wth d, whch s also proportonal to ρ and d > d. Therefore, the rght-hand sde of the bound 5 s the same as 27 wth the excepton that the ntegraton regon A could be ether of above sets. Consderng the possblty of some zero n 26 and the unbounded shape of A, there are domnatng terms such as e λ λ N j λ N + dλ dλ, λ j d,λ j whch s polynomal n d wth the mnmum exponent of N +. Ths ndcates that the bound 5 decays wth ρ N + n hgh spectral effcency. Ths completes the proof of Theorem 2. j REFERENCES [] G. Foschn, G. Golden, R. Valenzuela, and P. Wolnansy, Smplfed processng for hgh spectral effcency wreless communcaton employng mult-element arrays, Journal on Selected Areas n Communcatons, vol. 7, pp , Nov [2] N. Prasad and. K. Varanas, Outage analyss and optmzaton for multaccess and V-BLAST archtecture over IO Raylegh fadng channels, n Proc. of 4th Annual Allerton Conference on Communcaton, Control, and Computng, 23. [3] T. Guess, H. Zhang, and T. V. Kotchev, The outage capacty of BLAST for IO channels, n Proc. IEEE ICC, ay 23, pp [4] J. H. Wnters, J. Salz, and R. D. Gtln, The mpact of antenna dversty on the capacty of wreless communcaton systems, IEEE Transactons on Communcatons, vol. 43, pp , February/arch/Aprl 994. [5]. Rupp, C. eclenbrauer, and G. Grtsch, Hgh dversty wth smple space tme bloc-codes and lnear recevers, n Proc. IEEE GLOBECO, San Francsco, CA, November 23, pp [6] E. K. Onggosanus, A. G. Daba, T. Schmdl, and T. uharemovc, Capacty analyss of frequency-selectve IO channels wth suboptmal detectors, n Proc. IEEE ICASSP, 22, pp [7] H. Gao, P. J. Smth, and. V. Clar, Theoretcal relablty of SE lnear dversty combnng n Raylegh-fadng addtve nterference channels, IEEE Transactons on Communcatons, vol. 46, pp , ay 998. [8] L. Zheng and D. Tse, Dversty and multplexng: A fundamental tradeoff n multple-antenna channels, IEEE Transactons on Informaton Theory, vol. 49, no. 5, pp , ay 23. [9] I. S. Gradshteyn and I.. Ryzh, Table of Integrals, Seres, and Products, San Dego, CA: Academc Press, 5th edton, 994.

Error Probability for M Signals

Error Probability for M Signals Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

Multipath richness a measure of MIMO capacity in an environment

Multipath richness a measure of MIMO capacity in an environment EUROEA COOERATIO I THE FIELD OF SCIETIFIC AD TECHICAL RESEARCH EURO-COST SOURCE: Aalborg Unversty, Denmark COST 73 TD 04) 57 Dusburg, Germany 004/Sep/0- ultpath rchness a measure of IO capacty n an envronment

More information

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

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

More information

Linear Approximation with Regularization and Moving Least Squares

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

More information

ECE559VV Project Report

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

More information

An (almost) unbiased estimator for the S-Gini index

An (almost) unbiased estimator for the S-Gini index An (almost unbased estmator for the S-Gn ndex Thomas Demuynck February 25, 2009 Abstract Ths note provdes an unbased estmator for the absolute S-Gn and an almost unbased estmator for the relatve S-Gn for

More information

Inductance Calculation for Conductors of Arbitrary Shape

Inductance Calculation for Conductors of Arbitrary Shape CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors

More information

I + HH H N 0 M T H = UΣV H = [U 1 U 2 ] 0 0 E S. X if X 0 0 if X < 0 (X) + = = M T 1 + N 0. r p + 1

I + HH H N 0 M T H = UΣV H = [U 1 U 2 ] 0 0 E S. X if X 0 0 if X < 0 (X) + = = M T 1 + N 0. r p + 1 Homework 4 Problem Capacty wth CSI only at Recever: C = log det I + E )) s HH H N M T R SS = I) SVD of the Channel Matrx: H = UΣV H = [U 1 U ] [ Σr ] [V 1 V ] H Capacty wth CSI at both transmtter and

More information

Chapter 13: Multiple Regression

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

More information

JAB Chain. Long-tail claims development. ASTIN - September 2005 B.Verdier A. Klinger

JAB Chain. Long-tail claims development. ASTIN - September 2005 B.Verdier A. Klinger JAB Chan Long-tal clams development ASTIN - September 2005 B.Verder A. Klnger Outlne Chan Ladder : comments A frst soluton: Munch Chan Ladder JAB Chan Chan Ladder: Comments Black lne: average pad to ncurred

More information

Chapter 7 Channel Capacity and Coding

Chapter 7 Channel Capacity and Coding Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

An Application of Fuzzy Hypotheses Testing in Radar Detection

An Application of Fuzzy Hypotheses Testing in Radar Detection Proceedngs of the th WSES Internatonal Conference on FUZZY SYSEMS n pplcaton of Fuy Hypotheses estng n Radar Detecton.K.ELSHERIF, F.M.BBDY, G.M.BDELHMID Department of Mathematcs Mltary echncal Collage

More information

MIMO Systems and Channel Capacity

MIMO Systems and Channel Capacity MIMO Systems and Channel Capacty Consder a MIMO system wth m Tx and n Rx antennas. x y = Hx ξ Tx H Rx The power constrant: the total Tx power s x = P t. Component-wse representaton of the system model,

More information

Problem Set 9 Solutions

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

More information

Prof. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model

Prof. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model EXACT OE-DIMESIOAL ISIG MODEL The one-dmensonal Isng model conssts of a chan of spns, each spn nteractng only wth ts two nearest neghbors. The smple Isng problem n one dmenson can be solved drectly n several

More information

Low Complexity Soft-Input Soft-Output Hamming Decoder

Low Complexity Soft-Input Soft-Output Hamming Decoder Low Complexty Soft-Input Soft-Output Hammng Der Benjamn Müller, Martn Holters, Udo Zölzer Helmut Schmdt Unversty Unversty of the Federal Armed Forces Department of Sgnal Processng and Communcatons Holstenhofweg

More information

Lecture 3: Shannon s Theorem

Lecture 3: Shannon s Theorem CSE 533: Error-Correctng Codes (Autumn 006 Lecture 3: Shannon s Theorem October 9, 006 Lecturer: Venkatesan Guruswam Scrbe: Wdad Machmouch 1 Communcaton Model The communcaton model we are usng conssts

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

Pulse Coded Modulation

Pulse Coded Modulation Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal

More information

/ n ) are compared. The logic is: if the two

/ n ) are compared. The logic is: if the two STAT C141, Sprng 2005 Lecture 13 Two sample tests One sample tests: examples of goodness of ft tests, where we are testng whether our data supports predctons. Two sample tests: called as tests of ndependence

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

Convergence of random processes

Convergence of random processes DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0 Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of

More information

Chapter 7 Channel Capacity and Coding

Chapter 7 Channel Capacity and Coding Chapter 7 Channel Capacty and Codng Contents 7. Channel models and channel capacty 7.. Channel models Bnary symmetrc channel Dscrete memoryless channels Dscrete-nput, contnuous-output channel Waveform

More information

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

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

More information

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0 Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

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

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

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION. Christophe De Luigi and Eric Moreau

OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION. Christophe De Luigi and Eric Moreau OPTIMAL COMBINATION OF FOURTH ORDER STATISTICS FOR NON-CIRCULAR SOURCE SEPARATION Chrstophe De Lug and Erc Moreau Unversty of Toulon LSEET UMR CNRS 607 av. G. Pompdou BP56 F-8362 La Valette du Var Cedex

More information

EGR 544 Communication Theory

EGR 544 Communication Theory EGR 544 Communcaton Theory. Informaton Sources Z. Alyazcoglu Electrcal and Computer Engneerng Department Cal Poly Pomona Introducton Informaton Source x n Informaton sources Analog sources Dscrete sources

More information

NUMERICAL DIFFERENTIATION

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

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

Limited Dependent Variables

Limited Dependent Variables Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages

More information

Implicit Integration Henyey Method

Implicit Integration Henyey Method Implct Integraton Henyey Method In realstc stellar evoluton codes nstead of a drect ntegraton usng for example the Runge-Kutta method one employs an teratve mplct technque. Ths s because the structure

More information

First Year Examination Department of Statistics, University of Florida

First Year Examination Department of Statistics, University of Florida Frst Year Examnaton Department of Statstcs, Unversty of Florda May 7, 010, 8:00 am - 1:00 noon Instructons: 1. You have four hours to answer questons n ths examnaton.. You must show your work to receve

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

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

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

More information

A new Approach for Solving Linear Ordinary Differential Equations

A new Approach for Solving Linear Ordinary Differential Equations , ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of

More information

Negative Binomial Regression

Negative Binomial Regression STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...

More information

Min Cut, Fast Cut, Polynomial Identities

Min Cut, Fast Cut, Polynomial Identities Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.

More information

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /

P R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering / Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons

More information

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1 Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons

More information

A new construction of 3-separable matrices via an improved decoding of Macula s construction

A new construction of 3-separable matrices via an improved decoding of Macula s construction Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula

More information

Linear Regression Analysis: Terminology and Notation

Linear Regression Analysis: Terminology and Notation ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented

More information

Simulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests

Simulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

Secret Communication using Artificial Noise

Secret Communication using Artificial Noise Secret Communcaton usng Artfcal Nose Roht Neg, Satashu Goel C Department, Carnege Mellon Unversty, PA 151, USA {neg,satashug}@ece.cmu.edu Abstract The problem of secret communcaton between two nodes over

More information

Statistical Evaluation of WATFLOOD

Statistical Evaluation of WATFLOOD tatstcal Evaluaton of WATFLD By: Angela MacLean, Dept. of Cvl & Envronmental Engneerng, Unversty of Waterloo, n. ctober, 005 The statstcs program assocated wth WATFLD uses spl.csv fle that s produced wth

More information

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

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

More information

Application of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations

Application of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations Applcaton of Nonbnary LDPC Codes for Communcaton over Fadng Channels Usng Hgher Order Modulatons Rong-Hu Peng and Rong-Rong Chen Department of Electrcal and Computer Engneerng Unversty of Utah Ths work

More information

x = x 1 + :::+ x K and the nput covarance matrces are of the form ± = E[x x y ]. 3.2 Dualty Next, we ntroduce the concept of dualty wth the followng t

x = x 1 + :::+ x K and the nput covarance matrces are of the form ± = E[x x y ]. 3.2 Dualty Next, we ntroduce the concept of dualty wth the followng t Sum Power Iteratve Water-fllng for Mult-Antenna Gaussan Broadcast Channels N. Jndal, S. Jafar, S. Vshwanath and A. Goldsmth Dept. of Electrcal Engg. Stanford Unversty, CA, 94305 emal: njndal,syed,srram,andrea@wsl.stanford.edu

More information

UNIVERSITY OF TORONTO Faculty of Arts and Science. December 2005 Examinations STA437H1F/STA1005HF. Duration - 3 hours

UNIVERSITY OF TORONTO Faculty of Arts and Science. December 2005 Examinations STA437H1F/STA1005HF. Duration - 3 hours UNIVERSITY OF TORONTO Faculty of Arts and Scence December 005 Examnatons STA47HF/STA005HF Duraton - hours AIDS ALLOWED: (to be suppled by the student) Non-programmable calculator One handwrtten 8.5'' x

More information

Global Sensitivity. Tuesday 20 th February, 2018

Global Sensitivity. Tuesday 20 th February, 2018 Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values

More information

IT has been demonstrated recently [1], [2] that multipleinput

IT has been demonstrated recently [1], [2] that multipleinput 26 IEEE TRANSACTIONS ON WIRELESS COUNICATIONS, VOL. 6, NO. 6, JUNE 27 Space Tme Codes n Keyhole Channels: Analyss and Desgn Shahab Sanaye, ember, IEEE, Ahmadreza Hedayat, ember, IEEE, and Ara Nosratna,

More information

Rethinking MIMO for Wireless Networks: Linear Throughput Increases with Multiple Receive Antennas

Rethinking MIMO for Wireless Networks: Linear Throughput Increases with Multiple Receive Antennas Retnng MIMO for Wreless etwors: Lnear Trougput Increases wt Multple Receve Antennas ar Jndal Unversty of Mnnesota Unverstat Pompeu Fabra Jont wor wt Jeff Andrews & Steven Weber MIMO n Pont-to-Pont Cannels

More information

Comparison of Regression Lines

Comparison of Regression Lines STATGRAPHICS Rev. 9/13/2013 Comparson of Regresson Lnes Summary... 1 Data Input... 3 Analyss Summary... 4 Plot of Ftted Model... 6 Condtonal Sums of Squares... 6 Analyss Optons... 7 Forecasts... 8 Confdence

More information

CLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS

CLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS CLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS Yawgeng A. Cha and Karl Yng-Ta Hang Department of Commncaton Engneerng,

More information

Lecture Notes on Linear Regression

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

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

x = , so that calculated

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

More information

Appendix B: Resampling Algorithms

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

More information

Digital Modems. Lecture 2

Digital Modems. Lecture 2 Dgtal Modems Lecture Revew We have shown that both Bayes and eyman/pearson crtera are based on the Lkelhood Rato Test (LRT) Λ ( r ) < > η Λ r s called observaton transformaton or suffcent statstc The crtera

More information

Suppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl

Suppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com

More information

This model contains two bonds per unit cell (one along the x-direction and the other along y). So we can rewrite the Hamiltonian as:

This model contains two bonds per unit cell (one along the x-direction and the other along y). So we can rewrite the Hamiltonian as: 1 Problem set #1 1.1. A one-band model on a square lattce Fg. 1 Consder a square lattce wth only nearest-neghbor hoppngs (as shown n the fgure above): H t, j a a j (1.1) where,j stands for nearest neghbors

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models

More information

Math 217 Fall 2013 Homework 2 Solutions

Math 217 Fall 2013 Homework 2 Solutions Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has

More information

Max-Min Criterion Still Diversity-Optimal?

Max-Min Criterion Still Diversity-Optimal? Energy Harvestng Cooperatve Networks: Is the 1 Max-Mn Crteron Stll Dversty-Optmal? Zhguo Dng, Member, IEEE and H. Vncent Poor, Fellow, IEEE arxv:143.354v1 [cs.it] 3 Mar 214 Abstract Ths paper consders

More information

Durban Watson for Testing the Lack-of-Fit of Polynomial Regression Models without Replications

Durban Watson for Testing the Lack-of-Fit of Polynomial Regression Models without Replications Durban Watson for Testng the Lack-of-Ft of Polynomal Regresson Models wthout Replcatons Ruba A. Alyaf, Maha A. Omar, Abdullah A. Al-Shha ralyaf@ksu.edu.sa, maomar@ksu.edu.sa, aalshha@ksu.edu.sa Department

More information

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

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

More information

Antenna Combining for the MIMO Downlink Channel

Antenna Combining for the MIMO Downlink Channel Antenna Combnng for the IO Downlnk Channel arxv:0704.308v [cs.it] 0 Apr 2007 Nhar Jndal Department of Electrcal and Computer Engneerng Unversty of nnesota nneapols, N 55455, USA Emal: nhar@umn.edu Abstract

More information

Differentiating Gaussian Processes

Differentiating Gaussian Processes Dfferentatng Gaussan Processes Andrew McHutchon Aprl 17, 013 1 Frst Order Dervatve of the Posteror Mean The posteror mean of a GP s gven by, f = x, X KX, X 1 y x, X α 1 Only the x, X term depends on the

More information

A 2D Bounded Linear Program (H,c) 2D Linear Programming

A 2D Bounded Linear Program (H,c) 2D Linear Programming A 2D Bounded Lnear Program (H,c) h 3 v h 8 h 5 c h 4 h h 6 h 7 h 2 2D Lnear Programmng C s a polygonal regon, the ntersecton of n halfplanes. (H, c) s nfeasble, as C s empty. Feasble regon C s unbounded

More information

Exercise Solutions to Real Analysis

Exercise Solutions to Real Analysis xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there

More information

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

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

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011 Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected

More information

A be a probability space. A random vector

A be a probability space. A random vector Statstcs 1: Probablty Theory II 8 1 JOINT AND MARGINAL DISTRIBUTIONS In Probablty Theory I we formulate the concept of a (real) random varable and descrbe the probablstc behavor of ths random varable by

More information

The Expectation-Maximization Algorithm

The Expectation-Maximization Algorithm The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.

More information

Efficient Algorithm for Detecting Layered Space-Time Codes

Efficient Algorithm for Detecting Layered Space-Time Codes 4TH INTERNATIONAL ITG CONFERENCE ON SOURCE AND CHANNEL CODING, BERLIN, JANUARY 2002 1 Effcent Algorthm for Detectng Layered Space-Tme Codes D. Wübben, J. Rnas, R. Böhnke, V. Kühn and K.D. Kammeyer Department

More information

1. Inference on Regression Parameters a. Finding Mean, s.d and covariance amongst estimates. 2. Confidence Intervals and Working Hotelling Bands

1. Inference on Regression Parameters a. Finding Mean, s.d and covariance amongst estimates. 2. Confidence Intervals and Working Hotelling Bands Content. Inference on Regresson Parameters a. Fndng Mean, s.d and covarance amongst estmates.. Confdence Intervals and Workng Hotellng Bands 3. Cochran s Theorem 4. General Lnear Testng 5. Measures of

More information

Multi-dimensional Central Limit Argument

Multi-dimensional Central Limit Argument Mult-dmensonal Central Lmt Argument Outlne t as Consder d random proceses t, t,. Defne the sum process t t t t () t (); t () t are d to (), t () t 0 () t tme () t () t t t As, ( t) becomes a Gaussan random

More information

Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry

Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry Workshop: Approxmatng energes and wave functons Quantum aspects of physcal chemstry http://quantum.bu.edu/pltl/6/6.pdf Last updated Thursday, November 7, 25 7:9:5-5: Copyrght 25 Dan Dll (dan@bu.edu) Department

More information

Errors for Linear Systems

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

More information

Signal space Review on vector space Linear independence Metric space and norm Inner product

Signal space Review on vector space Linear independence Metric space and norm Inner product Sgnal space.... Revew on vector space.... Lnear ndependence... 3.3 Metrc space and norm... 4.4 Inner product... 5.5 Orthonormal bass... 7.6 Waveform communcaton system... 9.7 Some examples... 6 Sgnal space

More information

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

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

More information

Eigenvalues of Random Graphs

Eigenvalues of Random Graphs Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the

More information

Economics 130. Lecture 4 Simple Linear Regression Continued

Economics 130. Lecture 4 Simple Linear Regression Continued Economcs 130 Lecture 4 Contnued Readngs for Week 4 Text, Chapter and 3. We contnue wth addressng our second ssue + add n how we evaluate these relatonshps: Where do we get data to do ths analyss? How do

More information

Finding Dense Subgraphs in G(n, 1/2)

Finding Dense Subgraphs in G(n, 1/2) Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng

More information

Average Decision Threshold of CA CFAR and excision CFAR Detectors in the Presence of Strong Pulse Jamming 1

Average Decision Threshold of CA CFAR and excision CFAR Detectors in the Presence of Strong Pulse Jamming 1 Average Decson hreshold of CA CFAR and excson CFAR Detectors n the Presence of Strong Pulse Jammng Ivan G. Garvanov and Chrsto A. Kabachev Insttute of Informaton echnologes Bulgaran Academy of Scences

More information

ECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006)

ECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006) ECE 534: Elements of Informaton Theory Solutons to Mdterm Eam (Sprng 6) Problem [ pts.] A dscrete memoryless source has an alphabet of three letters,, =,, 3, wth probabltes.4,.4, and., respectvely. (a)

More information

Outage Probability of Macrodiversity Reception in the Presence of Fading and Weibull Co- Channel Interference

Outage Probability of Macrodiversity Reception in the Presence of Fading and Weibull Co- Channel Interference ISSN 33-365 (Prnt, ISSN 848-6339 (Onlne https://do.org/.7559/tv-67847 Orgnal scentfc paper Outage Probablty of Macrodversty Recepton n the Presence of Fadng and Webull Co- Channel Interference Mloš PERIĆ,

More information

On the Correlation between Boolean Functions of Sequences of Random Variables

On the Correlation between Boolean Functions of Sequences of Random Variables On the Correlaton between Boolean Functons of Sequences of Random Varables Farhad Shran Chaharsoogh Electrcal Engneerng and Computer Scence Unversty of Mchgan Ann Arbor, Mchgan, 48105 Emal: fshran@umch.edu

More information

Generalized Linear Methods

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

More information

Remarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence

Remarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,

More information

Chapter 5 Multilevel Models

Chapter 5 Multilevel Models Chapter 5 Multlevel Models 5.1 Cross-sectonal multlevel models 5.1.1 Two-level models 5.1.2 Multple level models 5.1.3 Multple level modelng n other felds 5.2 Longtudnal multlevel models 5.2.1 Two-level

More information