Linköping University Post Print. Cooperative Beamforming for the MISO Interference Channel

Size: px
Start display at page:

Download "Linköping University Post Print. Cooperative Beamforming for the MISO Interference Channel"

Transcription

1 Lnköpng Unversty Post Prnt Cooperatve Beamformng for the MISO Interference Channel Johannes Lndblom and Eleftheros Karpds N.B.: When ctng ths work, cte the orgnal artcle. 9 IEEE. Personal use of ths materal s permtted. However, permsson to reprnt/republsh ths materal for advertsng or promotonal purposes or for creatng new collectve works for resale or redstrbuton to servers or lsts, or to reuse any copyrghted component of ths work n other works must be obtaned from the IEEE: Johannes Lndblom and Eleftheros Karpds, Cooperatve Beamformng for the MISO Interference Channel,, Proceedngs of the 6th European Wreless Conference (EW'). Postprnt avalable at: Lnköpng Unversty Electronc Press

2 Cooperatve Beamformng for the MISO Interference Channel (Invted Paper) Johannes Lndblom and Eleftheros Karpds Communcaton Systems Dvson, Department of Electrcal Engneerng (ISY) Lnköpng Unversty, SE-8 8 Lnköpng, Sweden. {lndblom,karpds}@sy.lu.se Abstract A dstrbuted beamformng algorthm s proposed for the two-user multple-nput sngle-output (MISO) nterference channel (IFC). The algorthm s teratve and uses as barganng value the nterference that each transmtter generates towards the recever of the other user. It enables cooperaton among the transmtters n order to ncrease both users rates by lowerng the overall nterference. In every teraton, as long as both rates keep on ncreasng, the transmtters mutually decrease the generated nterference. They choose ther beamformng vectors dstrbutvely, solvng the constraned optmzaton problem of mzng the useful sgnal power for a gven level of generated nterference. The algorthm s equally applcable when the transmtters have ether nstantaneous or statstcal channel state nformaton (CSI). The dfference s that the core optmzaton problem s solved n closed-form for nstantaneous CSI, whereas for statstcal CSI an effcent soluton s found numercally va semdefnte programmng. The outcome of the proposed algorthm s approxmately Pareto-optmal. Extensve numercal llustratons are provded, comparng the proposed soluton to the Nash equlbrum, zero-forcng, Nash barganng, and mum sum-rate operatng ponts. I. INTRODUCTION The stuaton when two wreless lnks operate n the same spectrum, and create mutual nterference to one another, s well modeled by the nterference channel (IFC). Assocated wth any IFC there s an achevable rate regon, consstng of all pars of transmsson rates R (for lnk ) and R (for lnk ) that can be acheved, subject to constrants on the power used by the transmtters. The Pareto boundary of the rate regon s the part of the outer boundary consstng of rate ponts, where ncreasng R necessarly requres decreasng R and vce versa. It s generally desrable to operate at rate ponts that le on the Pareto boundary, such as the mum-sum-rate () pont and the Nash barganng soluton () []. In ths paper, we consder the two-user multple-nput sngle-output (MISO) IFC, where the transmtters (TX and TX ) have multple antennas and the recevers (RX and RX ) have a sngle antenna each. By usng beamformng the transmtters are able to steer power n arbtrary drectons. On one extreme, when the transmtters do not cooperate, t s natural to act selfshly and use the mum-rato (MR) Ths work has been supported n part by the Swedsh Foundaton of Strategc Research (SSF). Ths work has been performed n the framework of the European research project SAPHYRE, whch s partly funded by the European Unon under ts FP7 ICT Objectve. - The Network of the Future. beamformng vector, whch mzes the useful sgnal power wthout takng nto account the nterference generated towards the other recever. Then, the outcome s the so-called n gametheoretc studes Nash equlbrum (), at whch none of the users can ncrease ts rate by unlaterally changng ts transmt strategy []. On the other extreme, the transmtters can be enforced by regulaton to act altrustcally and use the zero-forcng () beamformng vector, whch mzes the useful sgnal power wthout generatng any nterference towards the other recever. When both transmtters use the altrustc strategy, we wll refer to the correspondng rate par as the pont. In general, both the and the ponts le far nsde the Pareto boundary. Pareto-optmal (PO) operatng ponts can only be acheved by combnatons of the two aforementoned extreme strateges [] [4]. Ths s because the mzaton of the useful sgnal power and the mnmzaton of the generated nterference are conflctng objectves. It s evdent that the transmtters need to cooperate and agree to mutually decrease the generated nterference, n order to acheve larger rates than the. Heren, we propose a smple and self-enforcng algorthm for the dstrbuted desgn of the beamformng vectors, wth mnmum requred channel knowledge. We assume that the transmtters are synchronzed and that there are feedback channels from all the recevers to all the transmtters. Each transmtter has CSI only of the drect lnk to ts ntended recever and the crosstalk lnk to the other recever. The feedback channels are ntally used to provde channel state nformaton (CSI) and n the sequel nformaton about the algorthm evoluton. The proposed algorthm s teratve and uses as barganng value the level of generated nterference. It s natural to ntalze the algorthm wth the MR transmt strategy. Then, n every teraton, each transmtter wll decrease the upper bound on the generated nterference and dstrbutvely compute a new beamformng vector solvng the optmzaton problem of mzng the useful power, gven the nterference bound and the power constrant. Inevtably, n every teraton the optmal value ( useful sgnal) of each system decreases, snce the feasblty set of the optmzaton s constrcted. But, n return, the experenced nterference decreases too. The teratons contnue as long as the sgnal-to-nterferenceplus-nose rato (SINR), hence the rate, of both users benefts from them. The algorthm can be nterpreted as a walk from

3 selfsh towards altrustc choces of beamformng vectors. The barganng outcome s approxmately PO. When the sgnal-to-nose rato (SNR) s hgh and the spatal correlaton among the drect and crosstalk channels s strong, the pont corresponds to larger rates, than the,.e. t s closer to the Pareto boundary. In such a case, the algorthm wll converge to a soluton faster f t s ntalzed wth the transmt strategy. Then, the nterference levels need to be ncreased n every teraton, to expand the feasblty set, and the walk s from altrustc towards selfsh transmt strateges. The proposed algorthm can be equally used when the transmtters have ether nstantaneous CSI (.e., perfect knowledge of the channel vectors) or statstcal CSI (.e., knowledge of the channel dstrbutons). In the former case, the achevable regon s comprsed by nstantaneous rates, whereas n the latter by ergodc rates. We propose a generc formulaton of the beamformng problem as constraned optmzaton, whch s common for both CSI cases. For nstantaneous CSI, we solve the optmzaton n closed-form, usng the parameterzaton n []. For statstcal CSI, we fnd an effcent numercal soluton va semdefnte programmng (SDP), as descrbed n [4]. In ths paragraph, we summarze some known barganng algorthms and cooperatve beamformng solutons. In [6], the authors presented a barganng algorthm, smlar n sprt to the one we propose heren. Ther algorthm requres nstantaneous CSI, starts wth the MR strategy, and explots the parametrzaton n []. In every teraton, a porton of the strategy s added to the prevously computed strategy untl a stoppng crteron s met. Ths algorthm converges to an operatng pont whch s better than the. Compared to [6], the man contrbutons of our paper are the use of the generated nterference level as barganng value and the fact that the proposed algorthm works for both nstantaneous and statstcal CSI. In [7], the authors presented a soluton to the cooperatve beamformng problem n the case of nstantaneous CSI, usng the noton of vrtual SINR. The aforementoned algorthms were also extended n the context of multcell MIMO channels n [8]. We compare the outcome of our algorthm to the,,, and ponts, for dfferent cases of CSI, SNR values and spatal correlaton levels. Also, we provde exemplary llustratons of the barganng trajectory and dscuss the complexty of the algorthm. Notaton: Tr{ }, rank{ }, R{ }, and N{ } denote the trace, rank, range, and nullspace, respectvely, of a matrx. Π Z Z(Z H Z) Z H s the orthogonal projecton onto the column space of Z, whle Π Z I Π Z s the orthogonal projecton onto the orthogonal complement of the column space of Z and I s the dentty matrx. E{ } s the expectaton operator. A. System Model II. PRELIMINARIES We assume that transmsson conssts of scalar codng followed by beamformng and that all propagaton channels are Ths s optmal n the case of nstantaneous CSI, but not necessarly for statstcal CSI, see []. frequency-flat. The matched-fltered symbol-sampled complex baseband data receved by RX s modeled as y = h H w s +h H j w js j +e, j =,,j {,}, () where s CN(,) and w C n are the transmtted symbol and the beamformng vector, respectvely, employed by TX. Also, e CN(,σ ) models the recever nose. The (conjugated) channel vector between TX and RX j s modeled as h j CN(,Q j ). We denote r j rank{q j }. In the case of nstantaneous CSI, TX accurately knows the channel realzatons h and h j, whereas for statstcal CSI t only knows the channel covarance matrces Q and Q j. The transmsson power s bounded due to regulatory and hardware constrants, such as battery and amplfers. Wthout loss of generalty, we set ths bound to. Hence, the set of feasble beamformng vectors s W {w C n w }. () Note that the set W s convex. In what follows, a specfc choce of w W s denoted as a transmt strategy of TX. B. Instantaneous CSI When the transmtters perfectly know the channel vectors and the recevers treat nterference as nose, the achevable nstantaneous rate (n bts/channel use) for lnk s [] R (w,w j ) = log ( + hh w h H j w j +σ ). () It s evdent that the rate on each lnk depends on the choce of both beamformng vectors. We defne the power that RX receves from TX j as p j (w j ) h H jw j = w H j h j h H jw j. (4) Then, we can wrte () as ) p (w ) R (w,w j ) = log (+ p j (w j )+σ, () whch s monotonously ncreasng wth the useful sgnal power p (w ) for fxed receved nterference power p j (w j ) and monotonously decreasng wth p j (w j ) for fxed p (w ). The man goal of the barganng algorthm we ntroduce n Secton III s to agree on a PO soluton. Hence, we restrct our attenton to the beamformng vectors whch are canddates to acheve PO ponts. From [], we know that the PO beamformng vectors use full power and that they are lnear combnatons of the MR and strateges (λ ) = λ w MR λ w MR w PO for λ [,], where w MR = h h and +( λ )w +( λ )w w (6) = Π h j h. (7) Π h j h The outcome when both transmtters use ther MR strateges s the. When both use ther we refer to the pont. Whenever an expresson s vald for both systems, t s denoted once wth respect to system and the ndex j = refers to the other system.

4 C. Statstcal CSI When the transmtters only have statstcal knowledge of the channels, t s natural to desgn the achevable the beamformng vectors wth respect to the ergodc rates, whch are obtaned by averagng over the channel realzatons. From [], we have where R (w,w j ) E {log ( = p (w ) ln f (x) e σ /x + hh w h H j w j +σ )} f (p (w )) f (p j (w j )), p (w ) p j (w j ) e t σ /x t (8) dt. (9) In (8), p j (w j ) denotes the average power that RX receves from TX j p j (w j ) = E { w H j h j h H jw j } = w H j Q j w j. () Note that the fnal terms n both (4) and () are convex homogeneous quadratcs. The dfference s that the parameter (channel) matrx n (4) s rank- by defnton, whereas n () t can have any rank. The ergodc rate (8) has the same behavor as the nstantaneous rate (),.e., t s monotonously ncreasng (decreasng) wth p (w ) (p j (w j )) for fxed p (w ) (p j (w j )) []. Also, for ponts on the Pareto boundary we know that w R{Q,Q j } []. The MR strategy w MR s the domnant egenvector of Q []. When R{Q } R{Q j }, the strategy w s the domnant egenvector of Π N{Qj}Q Π N{Qj} and when R{Q } R{Q j }, e.g., when Q j s full-rank, then w = []. D. Important Operatng Ponts In the followng, we ntroduce some operatng ponts, whch are mportant n the sense that they le on the outer boundary of the rate regon; see, e.g., [] and references theren. Sngle-user (SU): The ponts acheved when one transmtter employs ts MR strategy whle the other refrans from transmsson. Maxmum sum-rate (): The pont where the sum of the rates s mum. Graphcally, t s the pont where a lne of slope touches the Pareto boundary of the rate regon. Nash barganng soluton (): The outcome of a Nash barganng s a pont ( R, R ) such that ( R R )( R R ) s mzed for some threat pont (R,R ) and R R. It s natural to use the as the threat pont, snce t s the only reasonable outcome f the systems are not able to agree on a soluton. The s only defned on convex utlty regons, but we wll call the soluton to the correspondng optmzaton problem the. We delberately use the same symbols, as n the case of nstantaneous CSI, to denote the rate and the power (R and p, respectvely) n order to facltate n the sequel a unform treatment of both CSI scenaros. III. COOPERATIVE BEAMFORMING ALGORITHM In ths secton, we elaborate the proposed barganng algorthm that enables the transmtters to dstrbutvely desgn ther beamformng vectors. We assume that there exsts a feedback lnk from every recever to every transmtter. The recevers use these lnks to feedback CSI. Each transmtter has CSI only on the lnks t s affectng. The transmtters are assumed synchronzed, but no nformaton (CSI or user data) s exchanged between them. In the algorthm, we use as barganng value an upper bound on the nterference generated by system to system j. Ths bound, denoted c j, s adjusted n every teraton. Durng the barganng, the recevers feed back a one-bt message that tells the transmtters whether the teraton was successful or not,.e. whether the rates ncreased or not. We denote l the teraton counter, whch also acts as a quanttatve measure of the overhead (total number of bts per RX-TX feedback lnk) and the computatonal complexty (total number of optmzaton problems that need to be solved). A flowchart of the algorthm s llustrated n Fg.. The frst step of the algorthm s the decson whether the ntalzaton pont wll be the or the pont. For ths reason, the transmtters send two plots usng ther MR and beamformng vectors. The recevers measure the SINR for each transmsson and feed back one-bt of nformaton tellng the transmtters whch strategy yelds hgher SINR, hence rate. If R (w,wj ) R (w MR,wj MR ) for both systems, the algorthm s ntalzed wth the pont, snce t s closer than the to the Pareto boundary. Hence, the algorthm wll requre fewer teratons to converge to a soluton. If only one system acheves hgher rate wth the strateges, there s no ncentve for the other to accept the pont as ntal pont. The algorthm s then ntalzed wth the pont. Then, the algorthm sets the stepsze for updatng c j. As wth any teratve algorthm, the best output s obtaned for an nfntesmal stepsze. However, ths s not practcal, so we consder nstead a fxed stepsze 4. We assume that TX samples the nterval [,p j (w MR )] unformly n N + ponts, to allow up to N teratons. Ths gves the step δ j = ±p j (w MR )/N. The sgn of δ j depends on the ntal pont. If the algorthm s ntalzed wth the, δ j wll be negatve (decreasng nterference). Otherwse, δ j wll be postve (ncreasng nterference). At teraton l, TX updates the nterference level as c l j = cl j +δ j and solves the problem p (w ) () w W s.t. p j (w ) c l j. () The optmal soluton of problem () () s the beamformng vector whch mzes the useful power gven that the generated nterference s c l j. As long as cl j s chosen n the range [,p j (w MR )], there always exsts a feasble soluton to () () [4]. The lower and upper end on the nterference level correspond to the and MR strateges, respectvely. 4 Also, an adaptve stepsze can easly be ncorporated to the algorthm.

5 Transmt two plots usng w MR and w are canddates for achevng PO ponts. Any other beamformng vector wll be a waste of power. Usng (6) we get No l = w = wmr c j = pj(wmr ) δ j = p j(w MR )/N R (w,w ) R (w MR,w MR ) R (w,w ) R(wMR,wMR ) w l l l+ c l j = cl j +δ j soluton of () () Transmt plot usng w l Yes l = w = w c j = δ j = p j(w MR )/N s.t. λ [,] h H wpo (λ ) () h H jw PO (λ ) = c j. (6) Note that the optmzaton () (6) s now only wth respect to the real scalar λ. Furthermore, the power constrant s obsolete, snce the PO beamformng vectors use full power. That s, the nequalty constrant n () s met wth equalty. Instead, we have a constrant on the range of the weghtng factor λ. Fnally, t s straghtforward to see that the objectve functon () s monotonously ncreasng wth λ. Thus, we can equvalently rewrte () (6) as Yes R (w l,wl ) R(wl,w l ) R (w l,wl ) R(wl,w l ) s.t. λ [,] λ (7) h H jw PO (λ ) = c j. (8) No Use w l To smplfy notaton, we defne α ( h H jh / h j ) and β Π h j h / h. (9) Fg.. Flowchart descrbng the proposed algorthm The values (9) are only calculated once per channel realzaton. For c j > we wrte (8) as Furthermore, the bound wll be tght at the optmum; hence, the nequalty n () can be equvalently replaced wth equalty. We propose a soluton to the optmzaton problem () () n Sectons III-A and III-B for the case of nstantaneous and statstcal CSI, respectvely. TX uses w l to transmt a plot. RX measures R (w l,wl j ) and f t s no smaller than R (w l,wj l ), t feeds back a one-bt message tellng the transmtters to contnue updatng the nterference level. As soon as the rate decreases for at least one of the recevers, the algorthm termnates and the transmtters wll use the beamformng vectors from the prevous teraton. We clam that the algorthm s self-enforced. Suppose that, n one of the steps, TX chooses to cheat by not decreasng the nterference level. Then, the rate of system j wll decrease and RX j wll feedback a negatve bt. Accordng to the last step of the algorthm, the transmtters are expected to choose the beamformng vectors from the prevous teraton. If TX does not, RX j wll notce and report t to TX j. Then, TX j wll leave the barganng and employ ts MR beamformng vector nstead. That s, f one system tres to cheat, then the cooperaton s canceled and the operaton falls back to the (the so-called threat pont, n the context of Nash barganng). A. Instantaneous CSI By nsertng the expresson (4) n () (), wth nequalty changed to equalty, we get the problem w hh w () W s.t. h H j w = c j. (4) Snce the objectve of the algorthm s to fnd a PO pont, the transmtters are only wllng to use beamformng vectors that λ α λ +( λ ) +λ ( λ )β = c j λ (α /c j +β )+λ ( β ) =. When c j =, the strategy s the optmal soluton (.e, λ = ). Now, we wrte (7) (8) as λ () s.t. λ (α /c j +β )+λ ( β ) =, () λ. () The soluton to () () s the largest of the two solutons to () that satsfes (). B. Statstcal CSI By nsertng () n () () we get w wh C n Q w () s.t. w H Q j w c j, (4) w H w. () Problem () () s a quadratcally constraned quadratc program (QCQP). The feasblty set determned by (4) () s convex. However, the optmzaton s non-convex owng to the form of the objectve functon. However, t can stll be solved optmally and effcently usng semdefnte relaxaton. Ths s because semdefnte relaxaton s tght for QCQP problems of the form n () (4), as shown n [9]. We brefly elaborate the procedure, smlar to the way we dd n [4]. We change the optmzaton varables to W w w H. Note that W = w w H W ર and rank{w } =. (6)

6 Usng (6) and the property that Tr{YZ} = Tr{ZY} for matrces Y, Z of compatble dmensons, the average power term n (4) can be wrtten as w H Q j w = Tr { w H } { Q j w = Tr Qj w w H } = Tr{Q j W }. (7) Due to (6) and (7), we equvalently recast () (4) as W C n n Tr{Q W } (8) s.t. Tr{Q j W } c j, (9) Tr{W }, () W ર, () rank{w } =. () The objectve functon (8), the constrants (9) and () are lnear. The cone of postve semdefnte matrces () s convex. But the rank constrant () s non-convex. Droppng t, the remanng problem (8) () s a semdefnte programmng (SDP) problem, whch can be solved effcently. Due to the absence of (), the SDP problem wll not necessarly return rank- optmal matrces. We experenced through extensve smulatons that t actually does yeld rank- matrces. IV. NUMERICAL ILLUSTRATIONS In ths secton, we present extensve smulaton results to evaluate the performance of the algorthm we propose. We focus on the case of statstcal CSI, but also provde some results for nstantaneous CSI. In Secton IV-A, we explan how we generate CSI (.e., channel covarance matrces or channel vectors) for smulaton purposes. In Sectons IV-B and IV-C, we compare the outcome of the algorthm to the,,, and. Furthermore, n Secton IV-D, we show exemplary barganng trajectores. Fnally, n Secton IV-E, we dscuss the overhead and the complexty assocated wth our algorthm. Throughout the smulatons, we assume that the transmtters use n = antennas. We allow our algorthm run up to N = teratons. The results reported n Fgs. 7 and, are averages over Monte-Carlo (MC) runs. Fgs. 7 llustrate the sum of the transmsson rates,.e., R + R. Fgs. 8, 9,, and show examples of achevable rate regons,.e., for a sngle CSI realzaton. Fgs. and depct the average number of teratons needed tll the algorthm termnates, dependng on whether the algorthm s ntalzed wth the or ether of the and, respectvely. A. Generatng the Channels We generate the drect and the crosstalk channels n two dfferent ways, to model the scenaros of weak or strong spatal correlaton. Specfcally, n the case of nstantaneous CSI and weak correlaton, we generate the channel vectors h and h j drawng ndependent samples from CN(, I). For the scenaro of strong correlaton, we use the formula h j = μ h + μ h j, () whereh and h j are drawn fromcn(,i), andμ [,]. A value of μ close to refers to the case of strong nterference. In the case of statstcal CSI, we construct the covarance matrces, of rank r, randomly as r Q = q k q H k, (4) k= where q k CN(,I). For the scenaro of weak correlaton, we generate the covarance matrces Q and Q j ndependently accordng to (4). For the scenaro of strong correlaton, we construct the matrces such that the angle between the egenvectors of the drect matrx and the egenvectors of the crosstalk matrx s small. Assumng that r r j, we frst generate Q as n (4). Then, we construct the vectors {q j,k } k that defne Q j as { qj,k = μ q,k + μ q j,k, k r q j,k = q j,k, k > r () where q j,k CN(,I) and μ [,]. If r > r j, the matrces are constructed the other way around. B. Statstcal CSI In ths secton, we provde results for statstcal CSI, both for weak and strong spatal correlaton. Also, we dstngush among the cases of havng full-rank and low-rank covarance matrces. In the low-rank scenaro, the covarance matrces of the drect-channels have rank r = r =, and covarance matrces of the cross-talk channels have rank r = r = 4. For strong correlaton, we use μ =.8. In Fgs. and, we study the full-rank scenaro. Frst, we note that the sum rate s equal to snce full-rank crosstalk matrces correspond to w =. Second, we see that the sum rates for the proposed algorthm, the, and the saturate for hgh SNR. The reason s that when the SNR s hgh, nterference s the man lmtng factor. Snce the nterference cannot become zero, except for the SU-ponts, there should be a lmtaton. Thrd, snce there s no nterference at the SU ponts, the correspondng rates wll grow unbounded wth SNR and the wll be found at a SU pont for hgh SNR. In Fgs. and 6, we llustrate the low-rank scenaro. Here, all ponts but the converge to the same sum rate at hgh SNR. The dfference s that, for strong correlaton they converge at hgher SNR value than for weak correlaton. Also, we see that the rates grow almost lnearly wth the SNR. In general, there exsts a non-trval zero-forcng pont for the case of low-rank matrces. Usng ths, the nose s the only lmtaton. When the nose decreases, the rates ncrease. At low SNR, the starts growng later for strong correlaton than for weak correlaton. Furthermore, we evdence that weak correlaton (Fgs. and ) gves hgher rates for the proposed algorthm, the, and the, than strong correlaton (Fgs. and 6). As a general remark, low SNR means operaton n the nose-lmted regme and all the rates but the are almost the same. Concludng, we see that the performance of the proposed algorthm s slghtly below the and close to the,

7 except for full-rank matrces and hgh SNR. Most mportant, the algorthm performs consstently much better than the, whch would be the outcome f there was no cooperaton. C. Instantaneous CSI In Fgs. 4 and 7 we report the results for weak and strong correlaton (μ =.9), respectvely. We note that the curves behave smlarly to the ones n Fgs. and 6. The reason for ths s that the case of nstantaneous CSI can be regarded as a specfc nstance of the low-rank statstcal CSI when all covarance matrces are rank-. D. Barganng Trajectory In ths secton, we gve examples of the barganng trajectory,.e., the rate ponts (marked wth stars) reached at every teraton of the proposed algorthm. Here, the mum number of teratons used s N =. Fgs. 8 and llustrate the trajectores for statstcal CSI wth full-rank covarance matrces and SNR equal to and db, respectvely. The Pareto boundary s calculated usng the technque proposed n [4]. Fgs. 9 and llustrate the trajectores for nstantaneous CSI and SNR equal to and db, respectvely. The Pareto boundary s calculated usng the technque proposed n []. For statstcal CSI and full-rank matrces, the algorthm s always ntalzed wth the, snce a non-trval pont does not exst. For nstantaneous CSI and low SNR t s ntalzed wth the pont, whle for hgh SNR wth the pont. We note that the fnal outcome of the barganng algorthm s close to the Pareto boundary, but does not necessarly le on t. On one hand, the fnal outcome depends on the stepsze of the algorthm. On the other hand, the algorthm termnates when ether of the rates stops ncreasng,.e., when the tangent of the trajectory stops beng postve. More on, the outcome s close to, but generally far from. We note that the does not mply that both systems have ncreased ther rates compared to, whle the proposed algorthm and guarantee that both systems get at least ther rates. Fnally, n all fgures we show what the barganng trajectory would look lke f the algorthm went the entre way from one extreme pont ( or ) to the other wth small steps. Note that for statstcal CSI and full-rank matrces the pont corresponds to the orgn of the rate regon. E. Overhead and Complexty In ths secton, we study the number of teratons requred for the algorthm to termnate. Specfcally, we study the dependence on the SNR and the startng pont. In Fg., the algorthm s ntalzed wth the and we llustrate the three CSI scenaros (statstcal CSI, full- and low-rank, and nstantaneous CSI). For each CSI scenaro, the sold lne corresponds to weak spatal correlaton and the dashed lne corresponds to strong spatal correlaton. At low SNR, we see that the algorthm needs fewer teratons for strong correlaton than for weak correlaton. As the SNR ncreases, the number of teratons approaches the threshold N. Ths s because at hgh SNR the pont s closer to the Pareto boundary and the transmtters use all avalable teratons to reach t. When the systems are nterested n mnmzng the amount of overhead and complexty, they start at the pont that requres the smallest number of teratons. That s, the algorthm starts at the fr (w,wj ) R (w MR,wj MR ) for both systems. We llustrate ths n Fg.. Compared to Fg., we see that the methods perform equally for low SNR, snce ths s the nose-lmted regme. When the SNR s medum, the number of teratons s ncreased because both extreme ponts ( or ) are away from the Pareto boundary. For hgh SNR, the number of teratons for nstantaneous CSI and statstcal CSI wth low-rank matrces goes to one. Ths s because ths s the nterference-lmted regme and s optmal. For statstcal CSI wth full-rank matrces, a non-trval strategy does not exst. Therefore, the algorthm wll always start at, as a comparson of Fgs. and reveals. V. CONCLUSIONS We consdered the dstrbuted desgn of beamformng vectors for the MISO IFC. We proposed a cooperatve algorthm that acheves an operatng pont whch s almost Pareto optmal. The fnal soluton s n all cases better than the, whch would be the outcome f there was no cooperaton. The novel element of the proposed algorthm s the use of the generated nterference level as barganng value. The algorthm s equally applcable to the case of nstantaneous and statstcal CSI. We valdated the mert of our algorthm va extensve numercal llustratons. REFERENCES [] E. G. Larsson, E. Jorsweck, J. Lndblom, and R. Mochaourab, Game theory and the flat fadng Gaussan nterference channel, IEEE Sgnal Processng Magazne, vol. 6, no., pp. 8 7, Sep. 9. [] E. A. Jorsweck, E. G. Larsson, and D. Danev, Complete characterzaton of the Pareto boundary for the MISO nterference channel, IEEE Trans. Sgnal Process., vol. 6, no., pp. 9 96, Oct. 8. [] J. Lndblom, E. Karpds, and E. G. Larsson, Selfshness and altrusm on the MISO nterference channel: The case of partal transmtter CSI, IEEE Commun. Lett., vol., no. 9, pp , Sep. 9. [4] E. Karpds, A. Gründnger, J. Lndblom, and E. G. Larsson, Paretooptmal beamformng for the MISO nterference channel wth partal CSI, n Proc. rd IEEE Internatonal Workshop on Computatonal Advances n Mult-Sensor Adaptve Processng (CAMSAP), Aruba, Dec. 6, 9. [] J. Lndblom, E. G. Larsson, and E. A. Jorsweck, Parametrzaton of the MISO IFC rate regon: The case of partal channel state nformaton, IEEE Trans. Wreless Commun., vol. 9, no., pp. 4, Feb.. [6] Z. Ho and D. Gesbert, Spectrum sharng n multple antenna channels: A dstrbuted cooperatve game theoretc approach, n Proc. 9th IEEE Internatonal Symposum on Personal, Indoor, Moble Rado Communcatons (PIMRC), Sep. 8, 8, pp.. [7] R. Zakhour and D. Gesbert, Coordnaton on the MISO nterference channel usng the vrtual SINR framework, n Proc. ITG Workshop on Smart Antennas (WSA 9), Berln, Germany, Feb. 6 8, 9. [8] R. Zakhour, Z. Ho, D. Gesbert, Dstrbuted beamformng coordnaton n multcell MIMO channels, n Proc. 69th IEEE Vehcular Technology Conference (VTC), Barcelona, Span, Apr. 6 9, 9, pp.. [9] Y. Huang and D. P. Palomar, Rank-constraned separable semdefnte programmng wth applcatons to optmal beamformng, IEEE Trans. Sgnal Process., vol. 8, no. pp , Feb..

8 R + R [bts/channel use] Stat. CSI (full-rank), μ =, n =, N =, MC R + R [bts/channel use] Stat. CSI (full-rank), μ =.8, n =, N =, MC R + R [bts/channel use] Fg.. Sum rate; stat. CSI (full-rank), μ = Stat. CSI (low-rank), μ =, n =, N =, MC R + R [bts/channel use] Fg.. Sum rate; stat. CSI (full-rank), μ =.8 Stat. CSI (low-rank), μ =.8, n =, N =, MC Fg.. Sum rate; stat. CSI (low-rank), μ = Fg. 6. Sum rate; stat. CSI (low-rank), μ =.8 R + R [bts/channel use] Inst. CSI, μ =, n =, N =, MC R + R [bts/channel use] Inst. CSI, μ =.9, n =, N =, MC Fg. 4. Sum rate; nst. CSI, μ = Fg. 7. Sum rate; nst. CSI, μ =.9

9 R [bts/channel use] 4 Statstcal CSI; SNR = db, n =, μ =. Pareto boundary Barganng trajectory Barganng steps R [bts/channel use] Statstcal CSI; SNR = db, n =, μ =. Pareto boundary Barganng trajectory Barganng steps R [bts/channel use] 4 4 R [bts/channel use] 6 7 Fg. 8. Barganng trajectory; stat. CSI, SNR = db Fg.. Barganng trajectory; stat. CSI, SNR = db Instantaneous CSI; SNR = db, n =, μ =.8 Instantaneous CSI; SNR = db, n =, μ =.8 R [bts/channel use] Pareto boundary Barganng trajectory Barganng steps R [bts/channel use] 6 4 Pareto boundary Barganng trajectory Barganng steps R [bts/channel use] 4 R [bts/channel use] 6 Fg. 9. Barganng trajectory; nst. CSI, SNR = db Fg.. Barganng trajectory; nst. CSI, SNR = db Average number of teratons Stat. CSI (full-rank), μ = Stat. CSI (full-rank), μ =.8 Stat. CSI (low-rank), μ = Stat. CSI (low-rank), μ =.8 Inst. CSI, μ = Inst. CSI, μ =.9 Average number of teratons Stat. CSI (full-rank), μ = Stat. CSI (full-rank), μ =.8 Stat. CSI (low-rank), μ = Stat. CSI (low-rank), μ =.8 Inst. CSI, μ = Inst. CSI, μ = Fg.. Average number of teratons; algorthm ntalzaton: Fg.. Average number of teratons; algorthm ntalzaton: or

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

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

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

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

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

More information

Problem Set 9 Solutions

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

More information

Power Allocation/Beamforming for DF MIMO Two-Way Relaying: Relay and Network Optimization

Power 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 information

EEE 241: Linear Systems

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

More information

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

The Order Relation and Trace Inequalities for. Hermitian Operators

The 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 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

Assortment Optimization under MNL

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

More information

The Geometry of Logit and Probit

The 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 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

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

Chapter Newton s Method

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

More information

MMA and GCMMA two methods for nonlinear optimization

MMA 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 information

Perfect Competition and the Nash Bargaining Solution

Perfect 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 information

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem. prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove

More information

Lecture 10 Support Vector Machines II

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

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton 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 information

The Second Anti-Mathima on Game Theory

The 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 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

Time-Varying Systems and Computations Lecture 6

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

More information

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

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

Module 9. Lecture 6. Duality in Assignment Problems

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

More information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

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

VQ widely used in coding speech, image, and video

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

More information

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

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

More information

On the Multicriteria Integer Network Flow Problem

On the Multicriteria Integer Network Flow Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of

More information

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions 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 information

Markov Chain Monte Carlo Lecture 6

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

More information

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

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

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

More information

n α 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

n α 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 information

An 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 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 information

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Solutions 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 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

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

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Yong 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 information

Welfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium?

Welfare 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 information

Chapter - 2. Distribution System Power Flow Analysis

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

More information

Markov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement

Markov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs

More information

Singular Value Decomposition: Theory and Applications

Singular Value Decomposition: Theory and Applications Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real

More information

An Interactive Optimisation Tool for Allocation Problems

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

More information

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

The Concept of Beamforming

The 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 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

Lossy Compression. Compromise accuracy of reconstruction for increased compression.

Lossy 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 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

CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION

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

More information

Kernel Methods and SVMs Extension

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

More information

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

Lecture 12: Discrete Laplacian

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

More information

Power Allocation for Distributed BLUE Estimation with Full and Limited Feedback of CSI

Power Allocation for Distributed BLUE Estimation with Full and Limited Feedback of CSI Power Allocaton for Dstrbuted BLUE Estmaton wth Full and Lmted Feedback of CSI Mohammad Fanae, Matthew C. Valent, and Natala A. Schmd Lane Department of Computer Scence and Electrcal Engneerng West Vrgna

More information

Affine transformations and convexity

Affine 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 information

Multigradient for Neural Networks for Equalizers 1

Multigradient 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 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

e - c o m p a n i o n

e - c o m p a n i o n OPERATIONS RESEARCH http://dxdoorg/0287/opre007ec e - c o m p a n o n ONLY AVAILABLE IN ELECTRONIC FORM 202 INFORMS Electronc Companon Generalzed Quantty Competton for Multple Products and Loss of Effcency

More information

CS : Algorithms and Uncertainty Lecture 17 Date: October 26, 2016

CS : Algorithms and Uncertainty Lecture 17 Date: October 26, 2016 CS 29-128: Algorthms and Uncertanty Lecture 17 Date: October 26, 2016 Instructor: Nkhl Bansal Scrbe: Mchael Denns 1 Introducton In ths lecture we wll be lookng nto the secretary problem, and an nterestng

More information

Lecture 20: November 7

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

More information

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

CHALMERS, GÖTEBORGS UNIVERSITET. SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS. COURSE CODES: FFR 135, FIM 720 GU, PhD

CHALMERS, GÖTEBORGS UNIVERSITET. SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS. COURSE CODES: FFR 135, FIM 720 GU, PhD CHALMERS, GÖTEBORGS UNIVERSITET SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS COURSE CODES: FFR 35, FIM 72 GU, PhD Tme: Place: Teachers: Allowed materal: Not allowed: January 2, 28, at 8 3 2 3 SB

More information

Grover s Algorithm + Quantum Zeno Effect + Vaidman

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

More information

Lecture 14: Bandits with Budget Constraints

Lecture 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 information

CHAPTER 7 STOCHASTIC ECONOMIC EMISSION DISPATCH-MODELED USING WEIGHTING METHOD

CHAPTER 7 STOCHASTIC ECONOMIC EMISSION DISPATCH-MODELED USING WEIGHTING METHOD 90 CHAPTER 7 STOCHASTIC ECOOMIC EMISSIO DISPATCH-MODELED USIG WEIGHTIG METHOD 7.1 ITRODUCTIO early 70% of electrc power produced n the world s by means of thermal plants. Thermal power statons are the

More information

A Hybrid Variational Iteration Method for Blasius Equation

A Hybrid Variational Iteration Method for Blasius Equation Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method

More information

Numerical Heat and Mass Transfer

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

More information

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

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

More information

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

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

Supplement: 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 information

Two-Way and Multiple-Access Energy Harvesting Systems with Energy Cooperation

Two-Way and Multiple-Access Energy Harvesting Systems with Energy Cooperation Two-Way and Multple-Access Energy Harvestng Systems wth Energy Cooperaton Berk Gurakan, Omur Ozel, Jng Yang 2, and Sennur Ulukus Department of Electrcal and Computer Engneerng, Unversty of Maryland, College

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpenCourseWare http://ocw.mt.edu 6.854J / 18.415J Advanced Algorthms Fall 2008 For nformaton about ctng these materals or our Terms of Use, vst: http://ocw.mt.edu/terms. 18.415/6.854 Advanced Algorthms

More information

Estimation: Part 2. Chapter GREG estimation

Estimation: Part 2. Chapter GREG estimation Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the

More information

Amiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business

Amiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of

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

Some modelling aspects for the Matlab implementation of MMA

Some 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 information

The Minimum Universal Cost Flow in an Infeasible Flow Network

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

More information

Chapter 8 Indicator Variables

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

More information

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

Physics 5153 Classical Mechanics. Principle of Virtual Work-1

Physics 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 information

1 Matrix representations of canonical matrices

1 Matrix representations of canonical matrices 1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:

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

System in Weibull Distribution

System in Weibull Distribution Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co

More information

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM

FUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL

More information

Online Appendix. t=1 (p t w)q t. Then the first order condition shows that

Online Appendix. t=1 (p t w)q t. Then the first order condition shows that Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate

More information

The Study of Teaching-learning-based Optimization Algorithm

The Study of Teaching-learning-based Optimization Algorithm Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute

More information

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,

More information

Lecture Space-Bounded Derandomization

Lecture Space-Bounded Derandomization Notes on Complexty Theory Last updated: October, 2008 Jonathan Katz Lecture Space-Bounded Derandomzaton 1 Space-Bounded Derandomzaton We now dscuss derandomzaton of space-bounded algorthms. Here non-trval

More information

Maximizing the number of nonnegative subsets

Maximizing 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 information

Calculation of time complexity (3%)

Calculation of time complexity (3%) Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add

More information

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

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

More information

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

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

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

More information

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1 C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned

More information

IV. Performance Optimization

IV. Performance Optimization IV. Performance Optmzaton A. Steepest descent algorthm defnton how to set up bounds on learnng rate mnmzaton n a lne (varyng learnng rate) momentum learnng examples B. Newton s method defnton Gauss-Newton

More information

Which Separator? Spring 1

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

More information

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