Transceiver Design for Cognitive Full-Duplex Two-Way MIMO Relaying System

Size: px
Start display at page:

Download "Transceiver Design for Cognitive Full-Duplex Two-Way MIMO Relaying System"

Transcription

1 Transcever Desgn for Cogntve Full-Duplex Two-Way MIMO Relayng System by Nachket Ayr, Ubadulla P n 07 IEEE 85th Vehcular Technology Conference: VTC07-Sprng Report No: IIIT/TR/07/- Centre for Communcatons Internatonal Insttute of Informaton Technology Hyderabad , INDIA June 07

2 Transcever Desgn for Cogntve Full-Duplex Two-Way MIMO Relayng System Nachket Ayr and P. Ubadulla Sgnal Processng and Communcaton Research Center (SPCRC), Internatonal Insttute of Informaton Technology (IIIT), Hyderabad, Inda. Abstract In ths paper, we present the desgn of optmal precoders and receve flters for a full-duplex (FD) two-way amplfyand-forward (AF) multple-nput multple-output (MIMO) relayng system n a cogntve rado network. The secondary user (SU) or cogntve nodes share the spectrum wth the lcensed prmary user (PU) nodes whle keepng the nterference to PU nodes below a threshold. The cogntve transcevers communcate wth each other wth the assstance of a cogntve AF relay. The precoders for the cogntve transcevers are desgned so as to maxmze the sgnal to nose rato (SNR) at the relay whle lmtng the nterference to the PU node below a specfed threshold. Due to FD mode of operaton, all the nodes suffer from self-nterference (SI). We assume the avalable channel state nformaton (CSI) of loopback self-nterference channels at relay and transcevers to be mperfect. We desgn the optmal relay precoder and transcever receve flter, for suppressng the resdual SI, by mnmzng the sum of mean square error (SMSE) at the cogntve transcevers wth constrant on transmt power at relay. The precoders and receve flters are updated at each tme slot, takng nto account the cumulatve nterference effect from all prevous tme slots, whch enhances the performance of the system over tme. The smulaton results llustrate the effectveness of the proposed desgn n terms of the achevable sum-rate. I. INTRODUCTION In-band full-duplex wreless communcaton has the potental to double spectral effcency by smultaneous transmsson and recepton on the same frequency and tme resource. Recent mprovements n self-nterference cancellaton (SIC) technques [],[] have made MIMO FD systems vable. Hence, FD s regarded as one of the promsng technologes for the next generaton wreless networks. Relayng technques have been nvestgated as a means to facltate better qualty of servce, mproved lnk capacty, and enhanced network coverage. Cooperatve relayng, where one or more relay nodes are used for communcaton between end users, s envsoned to be a key enablng technology for 5G. Two-way n-band full-duplex relayng [] ncorporates the merts of both these technologes. In a two-hop two-way FD AF relayng system, two transcevers transmt and receve smultaneously on the same frequency n each tme slot, wth the ad of a FD relay. The two-way FD AF MIMO relayng system consstng of a MIMO relay, but sngle antenna transcevers s studed n [4]. A smlar system n [5] comprses of two MIMO Ths work was supported n part by the Vsvesvaraya Young Faculty Research Fellowshp, Department of Electroncs and Informaton Technology (DetY), Government of Inda. transcevers and a MIMO relay, wheren the beamformers at relay and transcevers were jontly desgned for mnmzng the SMSE at the two transcevers. The effect of path loss on the system desgn s neglected n these and most of such prevous work on two-way FD AF MIMO relayng. Cogntve rado technology enhances the spectrum utlzaton n wreless communcatons. The secondary users n a cogntve rado network operate under a severe power constrant n order to lmt the nterference to the prmary user. In such a scenaro, FD two-way relayng, whch has better effcency than one-way relayng, wll be benefcal to enhance the range as well as rate of communcaton A robust MSEbased transcever desgn problem for a one-way FD MIMO cogntve cellular system was studed n [6], where the relay base staton was FD, but the transcevers were operatng n half-duplex (HD) mode. The problem of sum-rate maxmzaton for a HD two-way relayng cogntve rado network was studed n [7] for a MIMO relay and sngle antenna secondary transcevers and prmary user. In ths paper, we present the desgn of a cogntve two-way n-band FD AF relayng MIMO system wth two secondary transcevers, one secondary relay, and a prmary user. Frst we desgn the precoders at the secondary transcevers by maxmzng the SNR at the secondary relay, whle keepng the total nterference to the prmary user node, due to the operaton of cogntve nodes, under a threshold. Then, we jontly desgn the precoder at the relay and the receve flters at the secondary transcevers by mnmzng the SMSE at the secondary transcevers. Ths problem s non-convex n nature. Fnally, we analyze the performance of the proposed desgns n a LTE cellular cogntve network scenaro, n terms of the achevable transmt power effcency and sum-rate. The man contrbutons of ths paper are twofold: () prmary user nterference constraned precoder desgn and power optmzaton at the transcevers, and () recursve computaton of relay precoder, receve flters wth mnmal memory requrements. The rest of ths paper s organzed as follows. Secton II descrbes the system model. The desgn of optmal precoders and receve flters s dscussed n Secton III. Smulaton results are presented n Secton IV and the conclusons n Secton V. Notatons : We denote a scalar, vector, and matrx by talc lowercase, boldface lowercase, and boldface uppercase, respectvely. For a matrx Y, ts transpose, conjugate, conjugate transpose, nverse, determnant, vectorza /7/$ IEEE

3 ton operaton, trace, and Frobenus norm are denoted by Y T, Y C, Y H, Y, Y, vec(y), tr(y), Y F, respectvely. X Y represents the kronecker product of matrces X and Y. E{ } s the expectaton operator, y represents -norm of y, mat( ) performs the nverse operaton of vec( ). If a varable m =, then m = and vce versa. Tme-slot dependent varables b, b, B denote a scalar, vector, matrx, respectvely, n the current tme slot t, whle b (j), b (j), B (j) denote a scalar, vector, matrx,respectvely, n any tme slot j. II. SYSTEM MODEL We consder a cogntve two-way FD relayng system as shown n Fg.. The system comprses of a prmary user P, two secondary transcevers S, S ; and a secondary AF relay R. Nodes P, S and S are each equpped wth N s antennas. Relay R has N r antennas, of whch N s antennas are used for sgnal recepton whle all N r antennas are used for sgnal transmsson, such that N r N s. All the nodes operate n FD mode, on the same frequency whch was ntended for use by P only. We assume that there s no drect communcaton lnk between the secondary nodes S and S, and so all ther communcaton happens va the relay R. All the channel lnks are modeled as ndependent and frequency-flat Raylegh fadng channels and are assumed to be statc for the duraton of each tme slot. The matrx G j represents the MIMO channel matrx between transmtter and recever j. Thus, the matrces G mr C Ns Ns, G rm C Ns Nr, G np C Ns Ns and G pn C Ns Ns, m {,, p}, n {, }, represent the MIMO channels as shown n Fg.. These channel matrces are assumed to be perfectly known. The matrces G rr C Ns Nr and G mm C Ns Ns, m {,, p}, represent the loopback self-nterference MIMO channels. We assume that the avalable CSI of the loopback channels s mperfect, such that G jj = Ĝjj + Φ j, j =,, p, r, () where Ĝjj s the avalable channel estmate and Φ j s the CSI error wth zero mean and covarance E{Φ j Φ H j } = N sσej I N s [8]. The symbol α j represents the path loss between nodes and j;, j {,, p, r}, such that α j = α j. We assume α =and t wll be not be explctly mentoned henceforth. Durng each tme slot t the followng events occur : () The prmary user P transmts sgnal x p C Ns whch acts as nterference for all the secondary nodes. () Each secondary transcever precodes data vector d m C Ns havng covarance E{d m d H m} = I Ns wth precodng matrx T m C Ns Ns to generate x m, m {, }, and transmts t to R, where the sgnal receved s gven by y r = α r G r x + α r G r x +G rr x r + α pr G pr x p +n r, () where the nose n r s a crcularly symmetrc complex Gaussan random vector wth zero mean and covarance E{n r n H r } = σnri Ns. The sgnal at the relay after SIC s gven by ỹ r = α r G r T d + α r G r T d + Φ r x r + αpr G pr x p + n r. () The thrd term n () refers to the resdual SI due to error n the avalable loopback CSI as modeled n (). Fg. : System dagram of a FD two-way cogntve rado network. () The secondary AF relay precodes the sgnal receved n the prevous tme slot, y r (t ), usng the precodng matrx F C Nr Ns and transmts the resultng sgnal x r = Fỹ r (t ), t. (4) (v) Each secondary transcever receves the relay sgnal as y m = α rm G rm x r +G mm x m + α pm G pm x p +n m,m=,, (5) where nose n m s a crcularly symmetrc complex Gaussan random vector wth zero mean and covarance E{n m n H m} = σnmi Ns. Snce, each secondary transcever has knowledge of ts own transmtted sgnals, d m (t ) and x m,aswellasofcsi αrm G rm, Ĝmm, and F, t cancels out the SI resultng n ỹ m = α rm G rm F{ α mr G mr (t ) T m (t ) d m (t ) + Φ (t ) r x (t ) r + n r (t ) } + Φ m T m d m + α pm G pm x p + n m. (6) Here agan, the resdual SI s represented by the term contanng Φ m. Each secondary transcever then apples a receve flter V m C Ns Ns to ỹ m to obtan an estmate of the data, ˆd m, transmtted by the other secondary transcever. (v) The sgnals transmtted from the secondary nodes cause nterference at the prmary transcever. The total power of nterferng sgnals at P s I p = I + I + I r, (7) where, I m = α mp tr(g mp x m x H mg H mp), m =,, r. (8) III. DESIGN OF OPTIMAL PRECODERS AND RECEIVE FILTERS In ths secton, we present the proposed desgn of the relay precoder F, the transcever precoders T and T, and the transcever receve flters V and V. A. Transcever Precoder Desgn We start wth the QR-decomposton of the hermtan of the MIMO channel matrx G mr as: G H mr = Q m R m. Then, the precoder matrces are gven by T m = β m Q m W m, m =,. (9) and the resultant transmt power s gven by P m = E{ T m d m } = β mtr(w m W H m), m =,, (0) where, the scalng factor β m wll be derved n the sequel and W m s derved from R m such that: G mr T m = β m I Ns. ()

4 We desgn T, T by maxmzng the receved SNR at R under a constrant on total nterference power, I p, at P and bounds on transmt power of S, S. The constrant on I p s I p θ, () where, θ s the maxmum permssble nterference to P from all the secondary nodes n a cogntve scenaro. From (7), (8), (9), (0) and (), () can be wrtten as θ α p G p x + α p G p x + α rp G rp x r = α p β b + α p β b + α rp p r G rp F, () where, b m = tr(g mp Q m W m WmQ H H mg H mp),m {, } and E{x r x H r } = p r I Ns, where, p r s the per-antenna power of R. As wll be seen n the next secton, R always transmts full power, such that p r = Pr max /N r = p max r. (4) As a result, () can be wrtten as α p βb + α p βb θ α rp p max r G rp F = θ. (5) Equaton (4) s also the reason for choosng SNR R as the functon to be maxmzed. Snce R s always transmttng at full power, we optmze P, P to lmt the nterference at P. From () and (), the SNR at R at tme t s gven by: SNR R = α rβn s + α r βn s σnrn. (6) s We observe that maxmzng the SNR at the relay s same as maxmzng the sgnal power n (6), for fxed nose power. So, the optmzaton problem can nstead be formulated as: α r βn s + α r βn s max β,β subject to α p β b + α p β b θ P mn m P m P max m,m=,. (7) The problem n (7) s a lnear optmzaton problem n β and β and can be easly solved by a optmzaton tool such as lnprog n MATLAB. The optmal values thus obtaned are β and β. The correspondng optmal precoder matrces and optmal transmt power are gven by (9) and (0), respectvely. B. Relay Precoder and Transcever Receve Flter Desgn We desgn F, V, V by mnmzng the SMSE of the transcevers S, S, wth a constrant on the transmt power of relay R. MatrxF s decomposed as F = γ F, where γ s a postve scalng factor and F F =. Ths decomposton smplfes the dervaton of the relay precoder n closed form. For the same reason, the term γ s ntroduced n (9). Thus, the SMSE = f(γ, F, V, V ). The optmal desgn s obtaned by solvng the followng optmzaton problem: mn f(γ, F, V, V ) γ, F,V,V (8) subject to E{ x r } Pr max. Due to space constrants, throughout ths paper we ll denote (α r β (j) + α r β (j) + σnr)i Ns + α pr p (j) p G (j) pr G (j)h pr by Ψ (j). The SMSE of the two transcevers s gven by f(γ, F, V, V ) = = E{ d (t ) γ ˆd } = = E{ d (t ) } + γ E{ V H ỹ } γ [tr(e{v H (t )H ỹd })+tr(e{d (t ) ỹ H V })]. (9) To proceed further, we express each term of SMSE equaton n terms of the relevant optmzaton varables. Thus, E{ d (t ) } = N s, E{d (t ) ỹ H V } = β (t ) αr α r tr(f H G H r V ). (0) Further, usng (6) and (), we have E{ V H ỹ } = α r tr[v H G r F(E{J 0 } + α r β (t ) I Ns + σnri Ns + α pr p p (t ) G pr (t ) G (t )H pr )F H G H r V ]+σntr(v V H ) + E{tr(V H Φ T d d H T H Φ H V )}+ α p p p tr(v H G p G H pv ), () where, t J 0 = k=0 t k l= t k Φ r (t l) F (t l) Ψ (k) l= F (k+l)h Φ (k+l)h r. () for t and 0 Ns for t =,. In ths paper, t s assumed that b =a ( ) =,fb<a. Usng Lemma from [9] and proceedng as n Theorem from [5], we obtan E{J 0 } as: t J q = E{J 0 } = (σer) k tr(f (t k) Ψ (t k ) F (t k)h )I Ns k= k tr(f (t l) F (t l)h ), () l= The term J q represents the contrbuton of all prevous F (k), t =onwards, whch s requred to suppress the SI caused by FD operaton. Snce, the frst F s computed at t =,thevalue of J q s 0 Ns for the frst two tme slots. After a few algebrac manpulatons on (), J q can be recursvely computed as J q =σer[tr(f (t ) Ψ (t ) F (t )H )I Ns + J q (t ) tr(f (t ) F (t )H )]. (4) The recursve structure of J q plays a sgnfcant role n the desgn of F, V. As a consequence, the nodes need not store all the prevous relay precoders and transcever receve flters. Ths not only greatly reduces the memory requrement at the relay but also results n reduced computaton tme for J q. Moreover, the precoder desgned usng (4) wll lead to better performance than that of the system proposed n [5] where only the n latest tme slots are used for computng J q. Usng Lemma from [9] and (0), we can rewrte the second to last term of () as E{tr(V H Φ T d d H T H Φ H V )} = σep tr(v V H ). (5) Usng (), (4), (), we express the relay transmt power as E{ x r } = tr[f(j q + Ψ (t ) )F H ]=tr(fj r F H ). (6) Havng expressed the terms of SMSE and relay transmt power n terms of the optmzaton varables, we now turn to

5 .8 α p / dstance -9dBm/700m -05dBm/500m Transmt power P (W) SMSE θ = -94dBm INR=0 INR=0. INR= INR= θ (dbm) Fg. : Varaton of transmt power versus θ, for dfferent values of path loss. the soluton of the problem n (8). The Lagrangan correspondng to ths problem s gven by L(γ, F, V, V,λ) = f(γ, F, V, V )+λ(e{ x r } Pr max + z ), (7) where λ s the lagrangan varable and z s the slack varable. On substtutng the results of (9), (0), (), (6), (),(5) n (7) and puttng F = γ F, we get L = {N s β (t ) αr α r tr(v H G r F + FH G H r V )+ = γ (σn + σep )tr(v V H )+α p p p tr(v H G p G H pv ) + α r tr(v H G r FJ FH G H r V } + λ[γ tr( FJ FH r ) Pr max + z ], (8) where J = J q +(α r β (t ) + σ nr)i Ns + α pr p (t ) p G (t ) pr G (t )H pr. The optmzaton problem n (8) can be solved usng the Karush-Kuhn-Tucker (KKT) condtons [0]. Snce the SMSE functon s not jontly convex n the optmzaton varables, we use the coordnate descent method. Thus, the optmal values of F, V, {, }, are obtaned teratvely. Frst, keepng V fxed, we apply the KKT condtons to get: γ =0 λγtr( FJ FH r )=γ (v + v ), (9) where v =(σn + σep )tr(v V H ) F = 0 c N r N s α r α r (β (t ) G H rv + β (t ) G H rv ) = λγ FJr + α r G H rv V H G r FJ + α r G H rv V H G r FJ. (0) λ =0 tr( FJ FH r )=γ (Pr max z ). () z =0 λ[γ tr( FJ FH r ) Pr max ]=0. () Now, from (9) and (), we observe that at optmal pont, λ = 0 and so the constrant n (8) becomes equalty constrant,.e., the relay R transmts at full power Pr max. So, () becomes: tr( FJ FH r )=γ (Pr max ). () Now, from (9) and (), we get: λγ = (v+v) P. Substtutng r max ths value n (0) and followng Theorem of [5], we get Number of teratons Fg. : Number of teratons requred to obtan optmal F,V, for dfferent values of INR, for θ = -94dBm and SNR = 5dB. F =mat(m α r α r vec[β (t ) G H rv +β (t ) G H rv ]), (4) where M =(J T α r G H rv V H G r )+(J T α r G H rv V H G r ) γ = +(J T r (v + v )I Nr Pr max ), P max r tr( FJ r FH ). Therefore, optmal relay precoder s gven by F = γ F. Now, usng the optmal F, we compute optmal receve flters by applyng the KKT condton: V =0 c Ns, {, }, whch gves the optmal receve flter at the transcever as: V =[(σn + σep )I Ns + α r G r F J F H G H r ] γ α r α r β (t ) G r F. (5) It must be noted that the optmal matrces F, V are obtaned by teratvely computng each other s flter untl a stable value of SMSE s reached. The ntal value of V for computng F can be any random N s N s complex matrx. IV. SIMULATION RESULTS For smulatons, we consder the followng parameters: N s =, N r =4, p max r =,Pj mn =0.6,Pj max =,j {, }. σem = INRσ nm P,m {,, r}. σnr = αrβ +αrβ SNR, σn = αrpr Gr F N s SNR, {, }. We consder the path loss as defned by the GPP LTE for outdoor macro cells [], vz., α = log 0 (d)db, where d s the dstance between nodes, n metres, at an operatng frequency of GHz. We consder α r = α r,α p = α p = α rp. We assume the MIMO channel matrces G mr, G rm,m {,, p}, G np, G pn, n {, } and channel estmaton error matrces φ j,j {,,r,p} to follow Raylegh fadng and ther elements to be ndependent and dentcally dstrbuted complex Gaussan random varables, each wth zero mean and unt varance. Unless specfed otherwse, we consder α r = -9dBm and α p = -0dBm. Around 000 Monte Carlo smulatons were averaged to arrve at each of the results. Fg. shows the varaton n transmt power of the transcever versus prmary user nterference threshold θ for

6 SMSE θ = -9dBm INR=0 INR= INR=5 INR= tme slots Fg. 4: Varaton of SMSE over tme, for dfferent values of INR, at θ = -9dBm and SNR = 0dB. SMSE INR / θ 0.5/-9dBm 5.0/-9dBm 0.5/-94dBm 5.0/-94dBm SNR (db) Fg. 5: SMSE, n the 7 th tme slot, versus SNR, for dfferent values of INR and θ. dfferent values of path loss α p. As expected, the transmt power ncreases wth ncrease n tolerance lmt of P. Fg. llustrates the number of teratons requred, n the 7 th tme slot, to obtan the optmal value of F and V m,m {, }, at SNR = 5dB, at dfferent INR values and θ = - 94dBm. We observe that begnnng wth any random complex x matrx V m, the SMSE converges after 6 teratons for all the INR values.ths makes the desgn of optmal flters vable. Fg. 4 descrbes the performance of the system over tme. It shows the varaton of SMSE, for dfferent INR values, wth θ = -9dBm. The SMSE stablzes from th tme slot due to the effect of feedback term J q, whch starts from t =. We evaluated the SMSE and sum-rate performance of the system versus SNR for dfferent values of INR and θ and the results are as shown n Fg. 5 and Fg. 6, respectvely. The equaton for sum-rate s smlar to that n [5], but wth path loss ncluded and effcent computaton. The proposed desgns exhbt good SMSE and sum-rate performance at low INR values. Ths hghlghts the need for precodng wth multple antennas to suppress the resdual SI. As seen n Fg. 6, the sum-rate tends to saturate above SNR = 5dB. Also, as expected, the system performs better at hgher values of θ. V. CONCLUSION We consdered a full-duplex two-way MIMO relayng system n a cogntve rado network, operatng under transmt power constrants. We desgned the optmal precoder matrces SUM-RATE (bts/sec/hz) INR / θ 0.5/-9dBm 5.0/-9dBm 0.5/-94dBm 5.0/-94dBm SNR (db) Fg. 6: Sum-rate, n the 7 th tme slot, versus SNR, for dfferent values of INR and θ. for the cogntve transcevers, based on SNR maxmzaton at the cogntve relay, to restrct prmary user nterference. We also proposed the optmal desgn of cogntve relay precoder and receve flters for the cogntve transcevers, based on SMSE mnmzaton, to curb resdual SI. To compensate for the contnuously varyng SI at the nodes, the relay precoder and receve flter matrces need to be updated n each tme slot wth the feedback from all the prevous tme slots. We presented an teratve technque for ths update, havng low memory requrement and hgh computatonal effcency. The performance of the proposed desgns was llustrated n the smulaton results for dfferent operatng condtons. The proposed desgns provde power effcency wth hgh sum-rate. REFERENCES [] D. Bharada and S. Katt, Full duplex MIMO rados, n th USENIX Symposum on Networked Systems Desgn and Implementaton (NSDI 4), 04, pp [] T. Rhonen, S. Werner, and R. Wchman, Mtgaton of loopback selfnterference n full-duplex MIMO relays, IEEE Transactons on Sgnal Processng, vol. 59, no., pp , 0. [] G. Lu, F. R. Yu, H. J, V. C. Leung, and X. L, In-band full-duplex relayng: A survey, research ssues and challenges, IEEE Communcatons Surveys & Tutorals, vol. 7, no., pp , 05. [4] G. Zheng, Jont beamformng optmzaton and power control for fullduplex MIMO two-way relay channel, IEEE Transactons on Sgnal Processng, vol. 6, no., pp , 05. [5] Y. Shm, W. Cho, and H. Park, Beamformng desgn for full-duplex two-way amplfy-and-forward MIMO relay, IEEE Transactons on Wreless Communcatons, vol. 5, no. 0, pp , Oct 06. [6] A. C. Crk, S. Bswas, O. Taghzadeh, A. Lu, and T. Ratnarajah, Robust transcever desgn n full-duplex MIMO cogntve rados, n Proc. IEEE Internatonal Conference on Communcatons (ICC). IEEE, 06, pp. 7. [7] D. Jang, H. Zhang, D. Yuan, and Z. Ba, Two-way relayng wth lnear processng and power control for cogntve rado systems, n Proc. IEEE Internatonal Conference on Communcaton Systems (ICCS). IEEE, 00, pp [8] P. Ubadulla and A. Chockalngam, Robust THP transcever desgns for multuser MIMO downlnk, n 009 IEEE Wreless Communcatons and Networkng Conference, Aprl 009, pp. 6. [9], Relay precoder optmzaton n MIMO-relay networks wth mperfect cs, IEEE Transactons on Sgnal Processng, vol. 59, no., pp , 0. [0] S. Boyd and L. Vandenberghe, Convex Optmzaton. Cambrdge, U.K.: Cambrdge unversty press, 004. [] European Telecommuncatons Standards Insttute (ETSI). LTE; Evolved Unversal Terrestral Rado Access (E-UTRA); Rado Frequency (RF) requrements for LTE Pco Node B (GPP TR 6.9 verson.0.0 Release ). [Onlne]. Avalable:

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

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

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

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

More information

FUll-duplex (FD) is a promising technique to increase

FUll-duplex (FD) is a promising technique to increase 1 Jont Relay-User Beamformng Desgn n Full-Duplex Two-Way Relay Channel Zhgang Wen, Shua Wang, Xaoqng Lu, and Junwe Zou arxv:1610.04974v1 cs.it] 17 Oct 2016 Abstract A full-duplex two-way relay channel

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

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

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

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

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

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

Hidden Markov Models

Hidden Markov Models Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,

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

COGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK

COGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK COGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK Ayman MASSAOUDI, Noura SELLAMI 2, Mohamed SIALA MEDIATRON Lab., Sup Com Unversty of Carthage 283 El Ghazala Arana, Tunsa

More information

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

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

More information

Optimal Resource Allocation in Full-Duplex Wireless-Powered Communication Network

Optimal Resource Allocation in Full-Duplex Wireless-Powered Communication Network 1 Optmal Resource Allocaton n Full-Duplex Wreless-owered Communcaton Network Hyungsk Ju and Ru Zhang, Member, IEEE arxv:143.58v3 [cs.it] 15 Sep 14 Abstract Ths paper studes optmal resource allocaton n

More information

EURASIP Journal on Wireless Communications and Networking

EURASIP Journal on Wireless Communications and Networking EURASIP Journal on Wreless Communcatons and Networkng Ths Provsonal PDF corresponds to the artcle as t appeared upon acceptance. Fully formatted PDF and full text (TM) versons wll be made avalable soon.

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

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

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

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

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

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

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

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

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

University of Alberta. Library Release Form. Title of Thesis: Joint Bandwidth and Power Allocation in Wireless Communication Networks

University of Alberta. Library Release Form. Title of Thesis: Joint Bandwidth and Power Allocation in Wireless Communication Networks Unversty of Alberta Lbrary Release Form Name of Author: Xaowen Gong Ttle of Thess: Jont Bandwdth and Power Allocaton n Wreless Communcaton Networks Degree: Master of Scence Year ths Degree Granted: 2010

More information

Robust transceiver design for AF MIMO relay systems with column correlations

Robust transceiver design for AF MIMO relay systems with column correlations Ttle Robust transcever desgn for AF MIMO relay systems wth column correlatons Author(s) Xng, C; Fe, Z; Wu, YC; Ma, S; Kuang, J Ctaton The 0 IEEE Internatonal Conference on Sgnal rocessng, Communcatons

More information

Arizona State University

Arizona State University SCHEDULING AND POWER ALLOCATION TO OPTIMIZE SERVICE AND QUEUE-WAITING TIMES IN COGNITIVE RADIO UPLINKS By arxv:1601.00608v1 [cs.it] 4 Jan 2016 Ahmed Emad Ewasha Commttee: Dr. Chan Tepedelenloğlu, Char

More information

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS) Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998

More information

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

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

More information

Distributed Non-Autonomous Power Control through Distributed Convex Optimization

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

Errors for Linear Systems

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

More information

Distributed Power Control for Interference-Limited Cooperative Relay Networks

Distributed Power Control for Interference-Limited Cooperative Relay Networks Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE ICC 2009 proceedngs Dstrbuted Power Control for Interference-Lmted Cooperatve

More information

Joint source and relay design for MIMO multi-relay systems using projected gradient approach

Joint source and relay design for MIMO multi-relay systems using projected gradient approach Todng et al EURASIP Journal on Wreless Communcatons and Networkng 04, 04:5 http://jwcneuraspjournalscom/content/04//5 RESEARC Open Access Jont source and relay desgn for MIMO mult-relay systems usng projected

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

Sum Throughput Maximization for Heterogeneous Multicell Networks with RF-Powered Relays

Sum Throughput Maximization for Heterogeneous Multicell Networks with RF-Powered Relays Sum Throughput Maxmzaton for Heterogeneous Multcell etworks wth RF-Powered Relays Al A. asr, Duy T. go, Xangyun Zhou, Rodney A. Kennedy, and Salman Durran Research School of Engneerng, Australan atonal

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

Pop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing

Pop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,

More information

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

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

More information

A Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control

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

University of Alberta. Jie Gao

University of Alberta. Jie Gao Unversty of Alberta EFFICIENCY AND SECURITY ANALYSIS IN MULTI-USER WIRELESS COMMUNICATION SYSTEMS: COOPERATION, COMPETITION AND MALICIOUS BEHAVIOR by Je Gao A thess submtted to the Faculty of Graduate

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

Iterative Multiuser Receiver Utilizing Soft Decoding Information

Iterative Multiuser Receiver Utilizing Soft Decoding Information teratve Multuser Recever Utlzng Soft Decodng nformaton Kmmo Kettunen and Tmo Laaso Helsn Unversty of Technology Laboratory of Telecommuncatons Technology emal: Kmmo.Kettunen@hut.f, Tmo.Laaso@hut.f Abstract

More information

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k) ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of

More information

Feature Selection: Part 1

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

The Prncpal Component Transform The Prncpal Component Transform s also called Karhunen-Loeve Transform (KLT, Hotellng Transform, oregenvector Transfor

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

Explicit and Implicit Temperature Constraints in Energy Harvesting Communications

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

The lower and upper bounds on Perron root of nonnegative irreducible matrices

The lower and upper bounds on Perron root of nonnegative irreducible matrices Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College

More information

PHYS 705: Classical Mechanics. Calculus of Variations II

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

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

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

More information

Uncertainty in measurements of power and energy on power networks

Uncertainty in measurements of power and energy on power networks Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:

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

SIO 224. m(r) =(ρ(r),k s (r),µ(r))

SIO 224. m(r) =(ρ(r),k s (r),µ(r)) SIO 224 1. A bref look at resoluton analyss Here s some background for the Masters and Gubbns resoluton paper. Global Earth models are usually found teratvely by assumng a startng model and fndng small

More information

APPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14

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

DC Programming for Power Minimization in a Multicell Network with RF-Powered Relays

DC Programming for Power Minimization in a Multicell Network with RF-Powered Relays nd Internatonal Conference on Telecommuncatons ICT 015 DC Programmng for Power Mnmzaton n a Multcell etwork wth RF-Powered Relays Al A. asr, Duy T. go and Salman Durran Research School of Engneerng, The

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

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

An Analytical Model for Interference Alignment in Multi-hop MIMO Networks

An Analytical Model for Interference Alignment in Multi-hop MIMO Networks 1 An Analytcal Model for Interference Algnment n Mult-hop MIMO Networks Huacheng Zeng, Student Member, IEEE, Y Sh, Senor Member, IEEE, Y. Thomas Hou, Fellow, IEEE, Wenng Lou, Fellow, IEEE, Sastry Kompella,

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

LINK ADAPTATION FOR INTERFERENCE ALIGNMENT WITH IMPERFECT CSIT

LINK ADAPTATION FOR INTERFERENCE ALIGNMENT WITH IMPERFECT CSIT 2014 IEEE Internatonal Conference on Acoustc, Speech and Sgnal Processng (ICASSP) LINK ADAPTATION FOR INTERFERENCE ALIGNMENT WITH IMPERFECT CSIT Mohsen Rezaee, Mehrdad Tak, Maxme Gullaud Insttute of Telecommuncatons,

More information

1 Convex Optimization

1 Convex Optimization Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,

More information

Equal-Optimal Power Allocation and Relay Selection Algorithm Based on Symbol Error Probability in Cooperative Communication

Equal-Optimal Power Allocation and Relay Selection Algorithm Based on Symbol Error Probability in Cooperative Communication INTERNATIONAL JOURNAL OF COUNICATIONS Volume 1, 18 Equal-Optmal Power Allocaton and Relay Selecton Algorthm Based on Symbol Error Probablty n Cooperatve Communcaton Xn Song, Syang Xu and ngle Zhang Abstract

More information

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

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

More information

Linear dispersion code with an orthogonal row structure for simplifying sphere decoding

Linear dispersion code with an orthogonal row structure for simplifying sphere decoding tle Lnear dsperson code wth an orthogonal row structure for smplfyng sphere decodng Author(s) Da XG; Cheung SW; Yuk I Ctaton he 0th IEEE Internatonal Symposum On Personal Indoor and Moble Rado Communcatons

More information

Appendix B: Resampling Algorithms

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

More information

Gaussian Conditional Random Field Network for Semantic Segmentation - Supplementary Material

Gaussian Conditional Random Field Network for Semantic Segmentation - Supplementary Material Gaussan Condtonal Random Feld Networ for Semantc Segmentaton - Supplementary Materal Ravtea Vemulapall, Oncel Tuzel *, Mng-Yu Lu *, and Rama Chellappa Center for Automaton Research, UMIACS, Unversty of

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

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

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 66, NO. 10, OCTOBER

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 66, NO. 10, OCTOBER IEEE TRANSACTIONS ON VEICULAR TECNOLOGY, VOL. 66, NO. 10, OCTOBER 2017 8979 Robust MMSE Transcever Desgn for Nonregeneratve Multcastng MIMO Relay Systems Lenn Gopal, Member, IEEE, Yue Rong, Senor Member,

More information

Cognitive Access Algorithms For Multiple Access Channels

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

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

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

EXTENSION OF SEDJOCO AND ITS USE IN A COMBINATION OF MULTICAST AND COORDINATED MULTI-POINT SYSTEMS

EXTENSION OF SEDJOCO AND ITS USE IN A COMBINATION OF MULTICAST AND COORDINATED MULTI-POINT SYSTEMS EXTENSION OF SEDJOCO AND ITS USE IN A COMBINATION OF MULTICAST AND COORDINATED MULTI-POINT SYSTEMS Yao Cheng 1, Are Yeredor 2, and Martn Haardt 1 1 Communcatons Research Laboratory 2 School of Electrcal

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

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.

More information

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

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

More information

Inexact Newton Methods for Inverse Eigenvalue Problems

Inexact Newton Methods for Inverse Eigenvalue Problems Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.

More information

An Algorithm to Solve the Inverse Kinematics Problem of a Robotic Manipulator Based on Rotation Vectors

An Algorithm to Solve the Inverse Kinematics Problem of a Robotic Manipulator Based on Rotation Vectors An Algorthm to Solve the Inverse Knematcs Problem of a Robotc Manpulator Based on Rotaton Vectors Mohamad Z. Al-az*, Mazn Z. Othman**, and Baker B. Al-Bahr* *AL-Nahran Unversty, Computer Eng. Dep., Baghdad,

More information

An Admission Control Algorithm in Cloud Computing Systems

An Admission Control Algorithm in Cloud Computing Systems An Admsson Control Algorthm n Cloud Computng Systems Authors: Frank Yeong-Sung Ln Department of Informaton Management Natonal Tawan Unversty Tape, Tawan, R.O.C. ysln@m.ntu.edu.tw Yngje Lan Management Scence

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

Lecture 3: Shannon s Theorem

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

More information

Hierarchical State Estimation Using Phasor Measurement Units

Hierarchical State Estimation Using Phasor Measurement Units Herarchcal State Estmaton Usng Phasor Measurement Unts Al Abur Northeastern Unversty Benny Zhao (CA-ISO) and Yeo-Jun Yoon (KPX) IEEE PES GM, Calgary, Canada State Estmaton Workng Group Meetng July 28,

More information

On balancing multiple video streams with distributed QoS control in mobile communications

On balancing multiple video streams with distributed QoS control in mobile communications On balancng multple vdeo streams wth dstrbuted QoS control n moble communcatons Arjen van der Schaaf, José Angel Lso Arellano, and R. (Inald) L. Lagendjk TU Delft, Mekelweg 4, 68 CD Delft, The Netherlands

More information

Clock Synchronization in WSN: from Traditional Estimation Theory to Distributed Signal Processing

Clock Synchronization in WSN: from Traditional Estimation Theory to Distributed Signal Processing Clock Synchronzaton n WS: from Tradtonal Estmaton Theory to Dstrbuted Sgnal Processng Yk-Chung WU The Unversty of Hong Kong Emal: ycwu@eee.hku.hk, Webpage: www.eee.hku.hk/~ycwu Applcatons requre clock

More information

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1 P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the

More information

How Strong Are Weak Patents? Joseph Farrell and Carl Shapiro. Supplementary Material Licensing Probabilistic Patents to Cournot Oligopolists *

How Strong Are Weak Patents? Joseph Farrell and Carl Shapiro. Supplementary Material Licensing Probabilistic Patents to Cournot Oligopolists * How Strong Are Weak Patents? Joseph Farrell and Carl Shapro Supplementary Materal Lcensng Probablstc Patents to Cournot Olgopolsts * September 007 We study here the specal case n whch downstream competton

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

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2 Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to

More information

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

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

More information

A Feedback Reduction Technique for MIMO Broadcast Channels

A Feedback Reduction Technique for MIMO Broadcast Channels A Feedback Reducton Technque for MIMO Broadcast Channels Nhar Jndal Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455, USA Emal: nhar@umn.edu Abstract A multple antenna

More information

Time Delay Estimation in Cognitive Radio Systems

Time Delay Estimation in Cognitive Radio Systems Tme Delay Estmaton n Cogntve Rado Systems Invted Paper Fath Kocak, Hasar Celeb, Snan Gezc, Khald A. Qaraqe, Huseyn Arslan, and H. Vncent Poor Department of Electrcal and Electroncs Engneerng, Blkent Unversty,

More information

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities Supplementary materal: Margn based PU Learnng We gve the complete proofs of Theorem and n Secton We frst ntroduce the well-known concentraton nequalty, so the covarance estmator can be bounded Then we

More information

Solution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method

Solution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method Soluton of Lnear System of Equatons and Matr Inverson Gauss Sedel Iteraton Method It s another well-known teratve method for solvng a system of lnear equatons of the form a + a22 + + ann = b a2 + a222

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information