OPTIMUM BEAMFORMING USING TRANSMIT ANTENNA ARRAYS. feasible points with monotonically decreasing costs).
|
|
- Mariah Bryant
- 6 years ago
- Views:
Transcription
1 OPTIMUM BEAMFORMING USING TRANSMIT ANTENNA ARRAYS Eugene Vsotsky Upamanyu Madhow Abstract - Transmt beamformng s a powerful means of ncreasng capacty n systems n whch the transmtter s eupped wth an antenna array, especally n systems n whch receve beamformng s not avalable, as s typcal n the base-to-moble \downlnk" n a cellular communcaton system. In ths paper, the problem of transmt beamformng s formulated as one of mnmzng the power radated by the base staton, subject to satsfyng ualty of servce reurements at the mobles. For a sngle cell system, a global mnmum s shown to exst, and an teratve algorthm that converges to t s provded. The soluton extends to accomodate receve beamformng at the mobles. It also extends to provde a mechansm for space-tme transmt lterng, whch explots the derences between the temporal as well as the spatal channels between the base staton and derent mobles. Fnally, a system wth multple source-destnaton pars (e.g., n an ad hoc network) s consdered. An teratve algorthm that outputs a convergent seuence of feasble ponts wth monontoncally decreasng costs s provded for ths case. 1 Introducton A fundamental lmtaton on the capacty of cellular and personal communcaton systems s the mutual nterference among smultaneous users. Transmt and receve beamformng usng antenna arrays can potentally crcumvent ths bottleneck by provdng solaton among users at derent locatons. In typcal cellular systems, t s reasonable to assume that the base staton s eupped wth an antenna array. However, the moble unts typcally have only one antenna element. In such a settng, transmt beamformng from the base staton to the mobles provdes a powerful method for ncreasng downlnk (base-to-moble) capacty. An mplct assumpton s that the base staton has feedback regardng the channel seen by each moble, whch n turn mples that these channels vary slowly. Thus, transmt beamformng s most eectve n applcatons nvolvng slowly movng moble unts. Ths paper provdes a method for computng the optmum weghts for transmt beamformng for the downlnk n a sngle cell. The soluton s then extended to several other stuatons: (a) optmum transmt and receve beamformng n a sngle cell; (b) opt- The authors are wth the Coordnated Scence Laboratory, Unversty of Illnos, 1308 W. Man, Urbana, IL 61801, USA. Ths work was supported by Motorola under the Unversty Partnershps n Research Programs. mum space-tme transmt lterng n a sngle cell, (c) transmt beamformng for multple source-destnaton pars (for whch the algorthm outputs a seuence of feasble ponts wth monotoncally decreasng costs). The basc problem posed s as follows: choose the beamformng weghts so as to mnmze the net power transmtted by the base staton, subject to each moble attanng a desred sgnal-to-nterference rato (SIR). The dea s to provde desred levels of solatons among mobles n a cell, whle mnmzng the nterference generated for other cells. Ths optmzaton problem was rst consdered, and solved n part, n [3]. The partal soluton n [3] conssts of an teratve algorthm that, assumng that there s a feasble soluton, converges to a feasble (but not necessarly optmal) pont. That s, t nds a set of beamformng weghts that guarantee that the SIR constrant at each moble s satsed. In ths paper, we provde a complete soluton to the problem addressed n [3]. In partcular, t s shown that, for a transformed verson of the orgnal optmzaton problem, the algorthm n [3] converges to the globally optmum beamformng weghts. Dependng on the system parameters, the net transmtted power reured wth the optmum weghts can be substantally smaller than that reured wth the feasble soluton obtaned n [3]. System Model Consder a sngle cell. The base staton has an M- element antenna array. Each moble has a sngle antenna element. Let h, 1, denote the M 1 channel from the base staton to the moble, where s the number of mobles. The base staton performs transmt beamformng and communcates smultaneously wth all mobles. The nstantaneous transmtted sgnal can then be expressed as x = =1 b w (1) where w s an M-dmensonal beamformng vector for the -th user and b s the transmtted data symbol for the -th user. At the -th moble, the nstantaneous receved sgnal can then be expressed as an nner product between the transmtted sgnal and the -th channel plus nose: r = j=1 b j w H j h + n 1 () 1
2 where n s an addtve whte Gaussan nose of varance, whch models other-cell nterference and background nose present n the system. The term b w H h represents the desred sgnal at the -th moble, whle P j6= b jwj H h represents the multple access nterference. Assumng that the data symbols b are uncorrelated, the SIR at the -th moble,, can be expressed as follows = jw H h j P j6= jwh j h j + 1 (3) 3 Optmum Transmt Beamformng The objectve s to mnmze the total transmtted power by the base staton, subject to ualty of servce reurements at the mobles, expressed as a mnmum SIR constrant at each moble,.e., SIR. Snce the total transmtted P power at the base staton can be expressed as jjw =1 jj, ths yelds the followng constraned optmzaton problem subject to X j6= mn w 1:::w =1 1 jjw jj (4) jwj H h j + A? jw H h j 0 8 (5) the constrants have been rewrtten n terms of uadratc functons of the weght vectors. The followng mportant observatons can now be made. 1. Exstence of Global Mnmum: The cost functon n (4) s contnuous and coercve (.e., ts value converges to plus nnty along any seuence of ts arguments such that the norm of the arguments also converges to plus nnty; see [1], page 540, for a formal denton). Furthermore, the constrant set s closed. Thus, f the constrant set s nonempty (.e., a feasble soluton exsts), then, by the Weerstrass' Theorem (page 540 of [1]), a global mnmum exsts.. Actve Constrants: At the global mnmum the constrants (5) are actve (.e., they are satsed wth eualty). Ths can be shown by contradcton: f there s a global mnmum wth constrant n (5) nactve, then jjw jj can be reduced wthout volatng the constrants. Thus, we can obtan a feasble pont wth the cost functon smaller than the global mnmum, whch s a contradcton. 3. Normalzed Problem: The optmzaton problem depends only on the pars of parameters (h ; ), 1. Furthermore, an euvalent optmzaton problem s obtaned, f we rewrte (4) n terms of the normalzed parameter pars ( ~ h ; 1), 1, where ~ h = h =. We wll refer to ths euvalent optmzaton problem as the normalzed downlnk optmzaton problem. The Lagrangan for the normalzed downlnk optmzaton problem s gven by 0 1 X jjw jj jwj H h ~ j + 1A? jw H h ~ j =1 =1 j6= (6) where, 1, are the correspondng Lagrange multplers, whch can be shown to be nonnegatve (p. 83 of [1]). Derentatng wth respect to the w, we obtan the followng euatons as the necessary condtons for optmalty. w? ~h ~h H w + X j6= j j ~h j ~h H j w = 0 8 (7) In addton, as noted earler, the optmal soluton must satsfy the feasblty constrants n (5) wth eualty, so that 0 1 jwj H h ~ j + 1A = jw H ~h j 8 (8) j6= The key step n the development s to show that the optmum beamformng weghts for the normalzed downlnk problem are the same, up to scalng, as those correspondng to optmum jont power control and receve beamformng for a vrtual normalzed uplnk problem. The latter can be solved by an teratve algorthm n [], and ths algorthm can be moded to solve for the weghts and scalng factors for the downlnk problem of nterest. The precedng approach was already consdered n [3], where t was shown that the use of a vrtual uplnk as above yelds a feasble soluton to the downlnk problem, and provded an teratve algorthm for computng such a soluton. The somewhat surprsng result obtaned n ths paper s that, when the algorthm n [3] s appled to the normalzed downlnk problem, t actually yelds the optmum soluton. Dependng on the system parameters, ths may be much better than the feasble soluton obtaned n [3]. 3.1 Vrtual Uplnk Problem For the uplnk problem, the mobles seek to mnmze ther transmtted powers to attan SIR constrants at the base staton, takng nto account the fact that the base staton s eupped wth a receve antenna array that can suppress nterference, whle mantanng unty gan n the desred drecton. Thus, for 1, moble must determne ts transmtted power P, and the base staton must determne the beamformng vector ^w used to receve the sgnal from moble. The problem can therefore be formulated as follows mn ^w 1::: ^w ;P 1:::P =1 P (9)
3 subject to P P j6= P jj ^w H ~ h j j + jj ^w jj and ^w H ~ h = 1 8 (10) where the channels ~ h, the unty nose varance, and the desred SIR values,, are all chosen to be dentcal to those for the \normalzed" downlnk problem. As n the downlnk problem, t s easy to see that the optmum soluton must satsfy the constrants (10) wth eualty. By consderng the rst order necessary condtons for optmalty, t s easy to show that the global mnmzer of (9) satses the followng euatons ^w? P ~h ~h H ^w + X j6= P j ~h j ~h H j ^w = 0 8 (11) ^w H ~ h = 1 8 (1) In [], an teratve algorthm s proposed and s shown to converge, startng from any ntal condtons, to the unue xed pont whch s the global mnmzer of (9). It s straghtforward to show that (11) - (1) specfy the unue xed pont of the algorthm, P and, hence, for P, 1, satsfyng (11), we have P =1 = P uplnk, where P uplnk s the global mnmum of (9). In [3], the algorthm of [] s extended to obtan a feasble soluton for the downlnk problem by an approprate scalng of the optmum vrtual uplnk beamformng vectors. 3. Optmzaton Algorthm The algorthm for optmum transmt beamformng can be stated as follows. 1. Compute the normalzed channels ~ h = h = 8.. Apply the algorthm n [3] to the \normalzed" problem as follows Step 1: For 1 ^w n = arg mn w j6= subject to w H ~h = 1. Step : For 1 P n+1 = j6= Step 3: For 1 ~P n+1 = P n j jw H ~ h j j + jjw jj (13) P n j j( ^w n ) H ~h j j + jj ^w n jj (14) j6= ~P n j j( ^w n j ) H ~h j + (15) Proposton 1: The precedng algorthm converges to the global mnmum of the downlnk problem f there s a feasble soluton. The proposton mples that the followng uanttes converge: P n! P 1, P ~ n! P ~ 1, ^w n! ^w 1 8. The optmum transmt beamformng vectors are gven by w = ~P 1 ^w 1, Proof of Optmalty We rst state and prove the followng key lemma before provng Proposton 1. Lemma: Any beamformng vectors satsfyng the euatons (7) - (8) acheve the global mnmum of the optmzaton problem n (4) - (5). Proof of the Lemma: Let ( ; w ), 1, be any beamformng vector and egenvalue pars satsfyng (7) - (8). Some smple manpulatons yeld the followng relatonshp between the cost and the correspondng Lagrange multplers =1 = =1 jjw jj (16) From (8), observe that w H h ~ > 0 8. Thus, a set of complex scalars f ; 1 g can be found such that, settng ^w = w gves ^w? ~h ~h H ^w + X j6= j j ~h j ~h H j ^w = 0 8 (17) ^w H ~ h = 1 8 (18) Identfyng P = and comparng (17) - (18) wth (11) - (1), t becomes clear that play the role of the uplnk powers P satsfyng the xed pont euaton for the vrtual uplnk problem. Ths gves P =1 P = P uplnk, whch, together wth (16), mples that jjw =1 jj = P uplnk. Ths enables us to conclude that, for any feasble pont for the downlnk problem satsfyng (7) - (8), the downlnk cost functon euals the mnmum P uplnk of the uplnk cost functon. Snce the global mnmzer of the downlnk problem necessarly satses (7) - (8), we conclude that 1. P uplnk = P downlnk, where P downlnk s the global mnmum of the transmt beamformng optmzaton problem.. Any feasble pont satsfyng (7) - (8) s a global mnmzer of the transmt beamformng optmzaton problem. Ths establshes the Lemma. Proof of Proposton 1: Let (P 1 ; ^w 1 ; P ~ 1 ), 1 denote the lmts of the teratve algorthm, whch, by the results n [3], s guaranteed to converge f there s a feasble soluton to the downlnk problem We wll establsh that ~P 1 ^w 1, 1, satses (7) - (8), 3
4 and hence, by the Lemma, s the global mnmzer of the transmt beamformng problem. The transmt beamformng set ~P 1 ^w 1, 1, satses (8) by the result n [3], where t s shown that ~P 1 ^w 1, 1, s a feasble pont of (4) satsfyng the constrants wth eualty. We now establsh that (7) s satsed. As shown n [], (P 1 ; ^w 1 ), 1, s the global mnmzer of (9) and (P 1 ; ^w 1 ), 1, satses (11). Agan comparng (7) and (11), we observe that, by makng the substtuton P 1 = =, (7) can be recovered from (11). Thus, we conclude that, wth P 1 = playng the role of the Lagrange multpler n (7), for an arbtrary power scalng A, w = A ^w 1, 1, satses (7). In partcular, ~P 1 ^w 1, 1, satses (7). 4 Jont Transmt and Receve Beamformng It s shown that the soluton for sngle-cell transmt beamformng gven n the precedng secton extends mmedately to a stuaton where the mobles may also be eupped wth antenna arrays. However, several local mnma may exst for beamformng performed by multple source-destnaton pars, as mght be encountered n ad hoc topologes. In ths case, convergence of the algorthm to the global mnmum cannot be guaranteed. 4.1 A Sngle Cell Assume that the base staton s eupped wth an M- element antenna array, whle each moble s eupped wth an N-element antenna array. Whle the proposed soluton apples eually well to the downlnk and to the uplnk communcaton, consder downlnk communcaton for concreteness. The channel from the base staton to the -th moble s descrbed by an N M matrx denoted as H. Assume that the array response at a receve antenna from each transmt element at the base staton s the same (except for complex scalng). Ths assumpton s true f the scatterng envronment surroundng the receve antenna s not excessvely rch. In ths case, the channel matrx H can be assumed to be rank one, and can be decomposed nto an outer product as follows: H = h ~h T 1 (19) where h s an N 1 vector denotng the array response at the - th moble to the base staton and ~ h s an M 1 vector denotng the array response at the base staton to the - th moble. Let fw ; 1 g denote the transmt beamformng weghts used at the base staton and fv ; 1 g denote the receve beamformng weghts used at the mobles. Upon performng receve beamformng, the -th moble observes the followng sgnal r = j=1 b j v H h ~h T w j + v H n 8 (0) where n s an N 1 vector contanng uncorrelated samples of addtve whte Gaussan nose of varance present at each antenna element. Assumng that the data symbols b are uncorrelated, the SIR at the -th moble,, can be expressed as follows = jv H h ~h T w P j j6= jvh h ~h T w j j + jjv 8 (1) jj The jont transmt and receve optmzaton problem s formulated as mnmzng the total transmtted power by the base staton subject to SIR constrants at each of the mobles. To avod nullng out the desred user, the receve beamformer s reured to have unty gan n the desred drecton,.e., v H h = 1 8. Snce the sgnal destned for any moble orgnates from a sngle source, the base staton, t s easy to see that the optmum receve beamformers are smply spatal matched lters, gven by v = h =jjh jj 8. Wth ths choce of receve beamformng vectors, the eectve channels from the base staton to the mobles and the nose varances at the mobles become respectvely v H h ~h = ~ h 8, jjv jj = =jj~ h jj 8. The optmal transmt beamformng vectors can now be obtaned by applyng (13) - (15) to the transmt beamformng wth parameters ( ~ h ; =jj ~ h jj ), Multple Source-Destnaton Pars Assume that the system conssts of source-destnaton pars whch nterfere wth each other. Ths scenaro may apply ether to an ad hoc network, or to a multple cell system n a cellular network. Denote by H j the N M channel from the source of the j-th par to the destnaton of the -th par, where, as above, H j can be decomposed as an outer product of two column vectors. Unlke n the case of a sngle source (or base staton), the spatal sgnatures of nterference and of the desred transmsson do not le n the same complex subspace. Hence, the matched lterng soluton for the receve beamformng vectors s suboptmum. The problem has a large number of xed ponts, each correspondng to a derent way of suppressng nterference. Roughly speakng, each recever has the choce of nullng out one or more of the sgnals from nterferng transmtters, whle each transmtter has the choce of nullng out one or more of the recevers. The followng algorthm, whch terates between (locally) optmal transmt and receve beamformng, can be shown to converge to one such xed pont wth the convergent seuence havng monotoncally decreasng costs. Step 1: Perform receve beamformng for 1 v n+1 = arg mn v j6= jv H h j ~h T j(w n j ) j + jjv jj () 4
5 subject to v H h = 1. Step : Perform transmt beamformng for 1 fw n+1 ; 1 g = arg mn w 1:::w subject to =1 jjw jj (3) P j6= j(vn+1 ) H h j ~h T jw j j + jjvn+1 jj? j ~ h T w j 0 8 (4) Note that the precedng algorthm, f appled to the problem of jont transmt and receve beamformng n a sngle cell, converges to the global mnmum n one teraton. In general, t can be shown that the algorthm produces a convergent seuence of transmt beamformng weghts whch are feasble and have non-ncreasng costs. Convergence to the global mnmum s guaranteed f, and only f, there exsts a unue xed pont of the algorthm. However, multple xed ponts were observed even for the case of two transmt-receve pars n our experments. 4.3 Optmum Space-Tme Transmt Flterng For temporally dspersve channels, temporal lterng n addton to beamformng may be used to obtan nterference suppresson. For a sngle cell, the optmum transmt beamformng soluton provded n Secton 3 can be generalzed to allow transmt lterng n both space and tme. Due to space lmtatons, attenton s restrcted to a smple example to llustrate the deas nvolved. Consder a sngle base staton eupped wth an M-dmensonal antenna array, and two mobles, each eupped wth a sngle antenna element. Assume that the channel to each moble conssts of two multpath rays wth a delay spread of one tme unt. Each space-tme channel can be descrbed n the z-transform doman as follows H (z) = a a 1 1z?1, = 1;, where a j s the M-dmensonal spatal channel to the -th moble along the j-th multpath. The transmtter performs spacetme lterng of the outgong bt seuence. For smplcty of llustraton, restrctng the temporal span of the beamformng lters to two, the transmt beamformng lters can be expressed as follows: W (z) = v 0 +v1 z?1, = 1;, where v j s the j-th M-dmensonal temporal component of the -th lter. The z-transform of the receved vector at the -th moble s as follows R (z) = H (z)? B 1 (z)w H 1 (z) + B (z)w H (z) + N (z), where B (z) s the z-transform of -th user's bt stream. The followng expresson can now be obtaned for the receved sample at the rst moble at t = 1: r 1 [1] = [a 1 1; a 0 1] H? b 1 [0][v 1 1; 0] + b 1 [1][v 0 1; v 1 1]+ b 1 [][0; v 0 1] + b [0][v 1 ; 0] + b [1][v 0 ; v1 ] + b [][0; v 0 ] + n 1 [1] (5) where [a 1 1; a 0 1] denotes a column vector wth a 1 1 stacked on top of a 0 1. Ths expresson can be rewrtten as a correlaton between [v1; 0 v1] 1 and [v; 0 v], 1 whch play the role of eectve transmt beamformng vectors, and the acyclc shfts of [a 1 1; a 0 1], whch play the role of eectve channels. Assumng, wthout loss of generalty, that the sample r 1 [1] s used as a decson statstc for the bt b 1 [1], we obtan SIR expressons dentcal n form to (3). The optmzaton problem of mnmzng the sum of suared Eucledean norms of [v 0; v1 ], = 1;, subject to the SIR constrants can now be solved by applyng (13) - (15). 5 Numercal Results In ths secton, we present numercal results obtaned for a system wth a ve-element lnear antenna array and sx moble users, dstrbuted at dstnct angles and dstances throughout the cell. In a cellular system, the nose varance at a gven moble s manly due to nterference from adjacent base statons (not explctly modeled), and can therefore depend on the locaton of the moble wthn ts cell. To llustrate such locaton eects, we employ the followng model. Let moble be at an angle and dstance d ;1 from the desred base staton and, dstance d ; from an nterferng base staton. Assume that the strength of the channel and nose varance at the mobles are determned by the path loss from the desred and nterferng base statons, respectvely. Assumng 1=d 4 law for dependence of path loss on dstance and =4 antenna spacng, we have: h (k) = p 1 5d exp(j (k? 1) sn ), ;1 = 1=d 4 ;, 1 k 5; 1 6, where h (k) s the k-th component of the -th channel vector and s the wavelength. To generate Fgure 1, t was assumed that d ;1 +d ; = 1 8 and the followng numercal values were used d 1;1 = 0:, d ;1 = 0:4, d 3;1 = 0:3, d 4;1 = 0:5, d 5;1 = 0:45, d 6;1 = 0:45. We now apply the algorthm n (13)-(15) to the transmt beamformng problem wth these parameters. db Beamformer angular response theta_1 theta_ theta_3 theta_4 theta_5 theta_ degrees Fgure 1: Plot of W 3 () vs. Fgure 1 dsplays, as a functon of, the magntude suared of the normalzed correlaton between the 3- rd beamformng vector and the lnear array response, 5
6 7 Comparson of the algorthms References Gan (db) nose_{ 1}/nose_ Fgure : Plot of P feas =P mn vs?1 =. whch we term the beamformer angular response and denote by W () for the -th moble. Then W () = j( ^w1 )H h()j jj ^w 1 jj jjh()jj (6) where h()(k) = p 1 5 exp(j (k?1) sn ), 1 k 5. The angles of arrval for the sx users are shown usng dashed vertcal lnes. From Fgure 1, note that the beamformer places a lobe n the angular drecton correspondng to the desred moble and suppresses other users. Note that the lobe placed n the drecton of the desred moble s wde and s robust, to a certan degree, aganst channel estmaton errors. Fgure dsplays a comparson between the global mnmum of the transmt optmzaton problem, P mn, and a feasble pont, P feas, obtaned by applyng the orgnal teratve algorthm n [3] (wthout normalzaton). The parameters are slghtly derent from those n Fgure 1. In partcular, the nose varances are assumed to form a decreasng seuence, wth?1 xed at some number larger than one, for = ; :::; 6, and = 1 1=d 1;. All other parameters are unchanged. Fgure dsplays P feas =P mn as a functon of?1 =, 6. Note that, f?1= = 1, 6,.e. the nose varances are the same at all mobles, no normalzaton s necessary, and the performance of the two algorthms s dentcal. As the nose varances at the mobles become more dsparate (as would be typcal for mobles dstrbuted unformly wthn a cell), observe that P feas =P mn ncreases sgncantly, whch mples that sgncant savngs for total transmtted power are obtaned by the smple modcaton of the algorthm n [3] proposed here. Numercal results for the extensons n Sectons 4 and 5 wll be presented at the conference. [1] D.P. Bertsekas, Nonlnear Programmng. Belmont, Massachusetts: Athena Scentc, [] F. Rashd-Farrokh, L. Tassulas, and.j.r. Lu, \Jont Optmal Power Control and Beamformng n Wreless Networks Usng Antenna Arrays," IEEE Transactons on Communcatons, vol. 46, no. 10, pp , October [3] F. Rashd-Farrokh,.J.R. Lu, and L. Tassulas, \Transmt Beamformng for Cellular Communcaton Systems," Proc. 31st Conf. Info. Scences and Systems, Johns Hopkns, Baltmore, pp. 9-97, March [4] D. Gerlach, A. Paulraj, \Adaptve Transmttng Antenna Arrays wth Feedback," IEEE Sgnal Processng Letters, vol. 1, pp , October [5] D. Gerlach, A. Paulraj, \Adaptve Transmttng Antenna Methods for Multpath Envronments," Proc GlobeCom Conference, pp [6] J.-H. Chang, L. Tassulas, and F. Rashd-Farrokh, \Jont Transmtter and Recever Beamformng for Maxmum Capacty n Spatal Dvson Multaccess," Proc. 35-th Annual Allerton Conf. on Communcaton, Control and Computng, pp , September
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 informationThe Concept of Beamforming
ELG513 Smart Antennas S.Loyka he Concept of Beamformng Generc representaton of the array output sgnal, 1 where w y N 1 * = 1 = w x = w x (4.1) complex weghts, control the array pattern; y and x - narrowband
More informationModule 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 informationStructure 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 informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationCollege 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 informationarxiv:cs.cv/ Jun 2000
Correlaton over Decomposed Sgnals: A Non-Lnear Approach to Fast and Effectve Sequences Comparson Lucano da Fontoura Costa arxv:cs.cv/0006040 28 Jun 2000 Cybernetc Vson Research Group IFSC Unversty of São
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationAn Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
An Upper Bound on SINR Threshold for Call Admsson Control n Multple-Class CDMA Systems wth Imperfect ower-control Mahmoud El-Sayes MacDonald, Dettwler and Assocates td. (MDA) Toronto, Canada melsayes@hotmal.com
More information3.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 informationMore 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 informationADAPTIVE IMAGE FILTERING
Why adaptve? ADAPTIVE IMAGE FILTERING average detals and contours are aected Averagng should not be appled n contour / detals regons. Adaptaton Adaptaton = modyng the parameters o a prrocessng block accordng
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationLecture 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 informationComposite 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 informationPhysics 5153 Classical Mechanics. Principle of Virtual Work-1
P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationSCALARS AND VECTORS All physical quantities in engineering mechanics are measured using either scalars or vectors.
SCALARS AND ECTORS All phscal uanttes n engneerng mechancs are measured usng ether scalars or vectors. Scalar. A scalar s an postve or negatve phscal uantt that can be completel specfed b ts magntude.
More informationError 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 informationMaximal Margin Classifier
CS81B/Stat41B: Advanced Topcs n Learnng & Decson Makng Mamal Margn Classfer Lecturer: Mchael Jordan Scrbes: Jana van Greunen Corrected verson - /1/004 1 References/Recommended Readng 1.1 Webstes www.kernel-machnes.org
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationLecture 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 informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationDifference 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 informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationDistributed Non-Autonomous Power Control through Distributed Convex Optimization
Dstrbuted Non-Autonomous Power Control through Dstrbuted Convex Optmzaton S. Sundhar Ram and V. V. Veeravall ECE Department and Coordnated Scence Lab Unversty of Illnos at Urbana-Champagn Emal: {ssrnv5,vvv}@llnos.edu
More informationAnnexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances
ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationMultigradient for Neural Networks for Equalizers 1
Multgradent for Neural Netorks for Equalzers 1 Chulhee ee, Jnook Go and Heeyoung Km Department of Electrcal and Electronc Engneerng Yonse Unversty 134 Shnchon-Dong, Seodaemun-Ku, Seoul 1-749, Korea ABSTRACT
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationProblem 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 informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationLecture 10 Support Vector Machines. Oct
Lecture 10 Support Vector Machnes Oct - 20-2008 Lnear Separators Whch of the lnear separators s optmal? Concept of Margn Recall that n Perceptron, we learned that the convergence rate of the Perceptron
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationA Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
A ower Bound on SIR Threshold for Call Admsson Control n Multple-Class CDMA Systems w Imperfect ower-control Mohamed H. Ahmed Faculty of Engneerng and Appled Scence Memoral Unversty of ewfoundland St.
More informationReal-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling
Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for
More informationJoint Scheduling and Power-Allocation for Interference Management in Wireless Networks
Jont Schedulng and Power-Allocaton for Interference Management n Wreless Networks Xn Lu *, Edwn K. P. Chong, and Ness B. Shroff * * School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette,
More informationLecture 14: Bandits with Budget Constraints
IEOR 8100-001: Learnng and Optmzaton for Sequental Decson Makng 03/07/16 Lecture 14: andts wth udget Constrants Instructor: Shpra Agrawal Scrbed by: Zhpeng Lu 1 Problem defnton In the regular Mult-armed
More information2E 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 informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationExplicit and Implicit Temperature Constraints in Energy Harvesting Communications
Explct and Implct Temperature Constrants n Energy Harvestng Communcatons Abdulrahman Baknna, Omur Ozel 2, and Sennur Ulukus Department of Electrcal and Computer Engneerng, Unversty of Maryland, College
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationA New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems
Appled Mathematcal Scences, Vol. 4, 200, no. 2, 79-90 A New Algorthm for Fndng a Fuzzy Optmal Soluton for Fuzzy Transportaton Problems P. Pandan and G. Nataraan Department of Mathematcs, School of Scence
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationEndogenous timing in a mixed oligopoly consisting of a single public firm and foreign competitors. Abstract
Endogenous tmng n a mxed olgopoly consstng o a sngle publc rm and oregn compettors Yuanzhu Lu Chna Economcs and Management Academy, Central Unversty o Fnance and Economcs Abstract We nvestgate endogenous
More informationOn the convergence of the block nonlinear Gauss Seidel method under convex constraints
Operatons Research Letters 26 (2000) 127 136 www.elsever.com/locate/orms On the convergence of the bloc nonlnear Gauss Sedel method under convex constrants L. Grppo a, M. Scandrone b; a Dpartmento d Informatca
More informationPower Allocation/Beamforming for DF MIMO Two-Way Relaying: Relay and Network Optimization
Power Allocaton/Beamformng for DF MIMO Two-Way Relayng: Relay and Network Optmzaton Je Gao, Janshu Zhang, Sergy A. Vorobyov, Ha Jang, and Martn Haardt Dept. of Electrcal & Computer Engneerng, Unversty
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationStanford 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 informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationThe Gaussian classifier. Nuno Vasconcelos ECE Department, UCSD
he Gaussan classfer Nuno Vasconcelos ECE Department, UCSD Bayesan decson theory recall that we have state of the world X observatons g decson functon L[g,y] loss of predctng y wth g Bayes decson rule s
More informationAppendix 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 informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationCOMPARISON 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 informationform, and they present results of tests comparng the new algorthms wth other methods. Recently, Olschowka & Neumaer [7] ntroduced another dea for choo
Scalng and structural condton numbers Arnold Neumaer Insttut fur Mathematk, Unverstat Wen Strudlhofgasse 4, A-1090 Wen, Austra emal: neum@cma.unve.ac.at revsed, August 1996 Abstract. We ntroduce structural
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased
More informationARRAY CALIBRATION WITH MODIFIED ITERATIVE HOS-SOS (MIHOSS) ALGORITHM
19th European Sgnal Processng Conference EUSIPCO 2011 Barcelona, Span, August 29 - September 2, 2011 ARRAY CALIBRATION WITH MODIFIED ITERATIVE HOS-SOS ALGORITHM Metn Aktaş, and T. Engn Tuncer Electrcal
More informationAPPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14
APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce
More informationLECTURE 9 CANONICAL CORRELATION ANALYSIS
LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of
More informationChapter 11: Simple Linear Regression and Correlation
Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests
More informationThe Prncpal Component Transform The Prncpal Component Transform s also called Karhunen-Loeve Transform (KLT, Hotellng Transform, oregenvector Transfor
Prncpal Component Transform Multvarate Random Sgnals A real tme sgnal x(t can be consdered as a random process and ts samples x m (m =0; ;N, 1 a random vector: The mean vector of X s X =[x0; ;x N,1] T
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationRethinking 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ρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to
THE INVERSE POWER METHOD (or INVERSE ITERATION) -- applcaton of the Power method to A some fxed constant ρ (whch s called a shft), x λ ρ If the egenpars of A are { ( λ, x ) } ( ), or (more usually) to,
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationChapter 8 SCALAR QUANTIZATION
Outlne Chapter 8 SCALAR QUANTIZATION Yeuan-Kuen Lee [ CU, CSIE ] 8.1 Overvew 8. Introducton 8.4 Unform Quantzer 8.5 Adaptve Quantzaton 8.6 Nonunform Quantzaton 8.7 Entropy-Coded Quantzaton Ch 8 Scalar
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationMIMO 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 informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationChapter 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 informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationSolutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.
Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,
More informationIntroduction to Antennas & Arrays
Introducton to Antennas & Arrays Antenna transton regon (structure) between guded eaves (.e. coaxal cable) and free space waves. On transmsson, antenna accepts energy from TL and radates t nto space. J.D.
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationx = 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 informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More informationDownlink Throughput Maximization: TDMA versus CDMA
00 Conference on Informaton Scences and Systems, The Johns Hopkns Unversty, March, 00 Downlnk Throughput Maxmzaton: TDMA versus CDMA Changyoon Oh and Ayln Yener Department of Electrcal Engneerng The Pennsylvana
More informationCognitive Access Algorithms For Multiple Access Channels
203 IEEE 4th Workshop on Sgnal Processng Advances n Wreless Communcatons SPAWC) Cogntve Access Algorthms For Multple Access Channels Ychuan Hu and Alejandro Rbero, Department of Electrcal and Systems Engneerng,
More informationExternalities in wireless communication: A public goods solution approach to power allocation. by Shrutivandana Sharma
Externaltes n wreless communcaton: A publc goods soluton approach to power allocaton by Shrutvandana Sharma SI 786 Tuesday, Feb 2, 2006 Outlne Externaltes: Introducton Plannng wth externaltes Power allocaton:
More informationWelfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium?
APPLIED WELFARE ECONOMICS AND POLICY ANALYSIS Welfare Propertes of General Equlbrum What can be sad about optmalty propertes of resource allocaton mpled by general equlbrum? Any crteron used to compare
More informationAnalysis of Queuing Delay in Multimedia Gateway Call Routing
Analyss of Queung Delay n Multmeda ateway Call Routng Qwe Huang UTtarcom Inc, 33 Wood Ave. outh Iseln, NJ 08830, U..A Errol Lloyd Computer Informaton cences Department, Unv. of Delaware, Newark, DE 976,
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More information