Optimal Bandwidth and Power Allocation for
|
|
- Byron Hancock
- 6 years ago
- Views:
Transcription
1 Optmal Bandwdth and Power Allocaton for 1 Sum Ergodc Capacty under Fadng Channels n Cogntve Rado Networks arxv: v1 [cs.it] 25 Jun 2010 Xaowen Gong, Student Member, IEEE, Sergy A. Vorobyov, Senor Member, IEEE, and Chntha Tellambura, Senor Member, IEEE Abstract Ths paper studes optmal bandwdth and power allocaton n a cogntve rado network where multple secondary users (SUs) share the lcensed spectrum of a prmary user (PU) under fadng channels usng the frequency dvson multple access scheme. The sum ergodc capacty of all the SUs s taken as the performance metrc of the network. Besdes all combnatons of the peak/average transmt power constrants at the SUs and the peak/average nterference power constrant mposed by the PU, total bandwdth constrant of the lcensed spectrum s also taken nto account. Optmal bandwdth allocaton s derved n closed-form for any gven power allocaton. The structures of optmal power allocatons are also derved under all possble combnatons of the aforementoned power constrants. These structures ndcate the possble numbers of users that transmt at nonzero power but below ther correspondng peak powers, and show that other users do not transmt or transmt at ther correspondng peak power. Based on these structures, effcent algorthms are developed for fndng the optmal power allocatons. Index Terms Bandwdth and power allocaton, cogntve rado, fadng channels, frequency dvson multple access, sum ergodc capacty Ths work was supported n parts by research grants from the Natural Scence and Engneerng Research Councl (NSERC) of Canada and Alberta Ingenuty New Faculty Award. The authors are wth the Department of Electrcal and Computer Engneerng, Unversty of Alberta, St., Edmonton, Alberta, T6G 2V4 Canada. The contactng emals are {xgong2, vorobyov, chntha}@ece.ualberta.ca. Correspondng author: Sergy A. Vorobyov, Dept. of Electrcal and Computer Engneerng, Unversty of Alberta, St., Edmonton, Alberta, T6G 2V4, Canada; Phone: +1 (780) , Fax: +1 (780)
2 2 I. INTRODUCTION Cogntve rado s a promsng technology for mprovng spectrum utlzaton n wreless communcatons systems [1]. A secondary user (SU) n a cogntve rado network s allowed to access the lcensed spectrum allocated to a prmary user (PU) f the spectrum s not utlzed by the PU. Such a spectrum sharng strategy, whch s referred to as spectrum overlay or opportunstc spectrum access (OSA) [2], requres correct detecton of spectrum opportuntes by the SU. Exstng works on spectrum overlay have manly studed spectrum sensng and access polces at the medum access control (MAC) layer [3]- [6]. An alternatve strategy, whch s known as spectrum underlay [7] [12], enables the PU and the SU to transmt smultaneously, provded that the receved nterference power by the PU s below a prescrbed threshold level. A number of works have recently studed nformaton theoretc lmts for resource allocaton n the context of spectrum underlay. In [13], the optmal power allocaton whch ams at maxmzng the ergodc capacty acheved by an SU s derved for varous channel fadng models subject to the peak nterference power (PIP) constrant or average nterference power (AIP) constrant mposed by a PU. In [14], the authors derve the optmal power allocaton for the ergodc capacty, outage capacty, and mnmum-rate capacty of an SU under both the PIP and AIP constrants from a PU. The ergodc capacty, delay-lmted capacty, and outage capacty of an SU s studed n [15] under dfferent combnatons of the peak transmt power (PTP) constrant or average transmt power (ATP) constrant at the SU and the PIP constrant or AIP constrant from a PU. However, all the papers mentoned above consder the setup of a sngle SU. The most recent work [16] studes a cogntve rado network of multple SUs under multple access channel and broadcast channel models, where the optmal power allocaton s derved to acheve the maxmum sum ergodc capacty of the SUs subject to varous mxed transmt and nterference power constrants. The optmalty condtons for the dynamc tme dvson multple access scheme are also derved. In ths paper, we focus on a cogntve rado network where multple SUs share the lcensed spectrum of a PU usng the frequency dvson multple access (FDMA) scheme. The sum ergodc capacty of the SUs, whch s a relevant network performance metrc for delay-tolerant traffcs, s studed. Besdes the transmt power constrants at the SUs and the nterference power constrant mposed by the PU, whch are also consdered n [13]- [16], we also take nto account the total
3 3 bandwdth constrant of the shared spectrum. Such study s motvated by the fact observed for a number of dfferent applcatons that jont bandwdth and power allocaton can sgnfcantly mprove the performance of systems wth lmted both ndvdual (power) and publc (bandwdth) resources [17] [23]. Thus, n ths paper, nstead of conventonal fxed and equal bandwdth allocaton used n FDMA, we nvestgate dynamc and unequal bandwdth allocaton, where the bandwdth allocaton vares for dfferent SUs at dfferent channel fadng states. Moreover, dfferent from the exstng works [13]- [16], all combnatons of the transmt power constrants and the nterference power constrants are consdered, ncludng both PTP and ATP constrants combned wth both PIP and AIP constrants. We frst derve the optmal bandwdth allocaton for any gven power allocaton n any channel fadng state, whch results n equvalent problems that only nvolve power allocaton. Usng the convexty of the resultant power allocaton problems, we apply dual decomposton whch transforms these problems nto equvalent dual problems, where each dual functon nvolves a power allocaton subproblem assocated wth a specfc channel fadng state. The dual problems can be solved usng standard subgradent algorthms. For the power allocaton subproblem under all combnatons of the power constrants, we derve the structures of the optmal power allocatons. These structures ndcate the possble numbers of users that transmt at nonzero power but below ther correspondng peak powers, and show that other users do not transmt or transmt at ther correspondng peak power. Based on these structures, we develop algorthms for fndng the optmal power allocatons n each channel fadng state. The rest of the paper s organzed as follows. Secton II summarzes the system model and formulates correspondng sum ergodc capacty maxmzaton problems. Secton III derves the optmal bandwdth allocaton for the problems formulated n Secton II subject to the bandwdth constrant. Secton IV obtans the optmal power allocatons from the resultant problems n Secton III under all combnatons of the transmt power constrants and nterference power constrants. Numercal results for the maxmum sum ergodc capacty under dfferent combnatons of the power constrants and the bandwdth constrant are shown n Secton V. Secton VI concludes the paper.
4 4 II. SYSTEM MODEL Consder a cogntve rado network of N SUs and one PU. The PU occupes a spectrum of bandwdth W for ts transmsson, whle the same spectrum s shared by the SUs. The spectrum s assumed to be dvded nto dstnct and nonoverlappng flat fadng channels wth dfferent bandwdth, so that the SUs share the spectrum through FDMA to avod nterferences wth each other. The channel power gans between the th SU transmtter (SU-Tx) and the th SU recever (SU-Rx) and between the th SU-Tx and the PU recever (PU-Rx) are denoted by h and g, respectvely. The channel power gans,.e., g [g 1 g 2 g N ] and h [h 1 h 2 h N ], are assumed to be drawn from an ergodc and statonary vector random process. We further assume that full channel state nformaton (CSI),.e., the jont probablty densty functon (PDF) of the channel power gans and the nstantaneous channel power gans, are known at the SUs. 1 The nose at each SU-Rx plus the nterference from the PU transmtter (PU-Tx) s assumed to be addtve whte Gaussan nose (AWGN) wth unt power spectral densty (PSD). We denote the transmt power of the th SU-Tx and the channel bandwdth allocated to the th SU-Tx as p (g,h) and w (h,g), respectvely, for the nstantaneous channel power gans g and h. Then the total bandwdth constrant can be expressed as The PTP constrants are gven by w (h,g) W, h,g. (1) p (h,g) P pk,,h,g (2) where P pk gven by denotes the maxmum peak transmt power of the th SU-Tx. The PIP constrant s g p (h,g) Q pk, h,g (3) where Q pk denotes the maxmum peak nterference power allowed at the PU-Rx. The ATP constrants are gven by E{p (h,g)} P av, (4) 1 Note that the full CSI assumpton s typcal n the context of cogntve rado and s also made n other works such as [13]- [16]. Indeed, under ths assumpton we am at nvestgatng the nformaton-theoretc lmts on the sum ergodc capacty.
5 5 where the expectaton s taken over h and g, and P av denotes the maxmum average transmt power of the th SU-Tx. The AIP constrant s gven by { N } E g p (h,g) Q av (5) where Q av denotes the maxmum average nterference power allowed at the PU-Rx. The objectve s to maxmze the sum ergodc capacty of the SUs, whch can be wrtten as { N ( max E w (h,g)log 1+ h ) } p (h,g) (6) {w (h,g),p (h,g)} F w (h,g) where F s a feasble set specfed by the bandwdth constrants (1) and a partcular combnaton of the transmt power constrants{(2), (4)} and the nterference power constrants{(3), (5)}. Note that the constrants on nonnegatvty of the bandwdth and power allocatons,.e., w (h,g) 0 and p (h,g) 0,,h,g, are natural and, thus, omtted through out the paper for brevty. It can be shown that the objectve functon of the problem (6) s concave wth respect to {w (h,g),p (h,g)},,h,g. It can also be seen that the bandwdth and power constrants (1) (5) are lnear and, thus, convex. Therefore, the sum ergodc capacty maxmzaton problem (6) under dfferent combnatons of the constrants (1) (5) s a convex optmzaton problem. III. OPTIMAL BANDWIDTH ALLOCATION Gven that the power allocaton p (h,g),,h,g, s fxed, the maxmum sum ergodc capacty can be expressed as E{f 0 (h,g)}, where f 0 (h,g) s gven by f 0 (h,g) max {w (h,g)} s.t. G (w (h,g)) w (h,g) W where G (w (h,g)) w (h,g)log(1+h p (h,g)/w (h,g)) s an ncreasng and concave functon of w (h,g). The problem (7a) (7b) s smlar to the classcal water-fllng power allocaton problem. Thus, the optmal soluton of the problem (7a) (7b), denoted by {w (h,g)}, must satsfy G (w (h,g)) w (h,g) (7a) (7b) (7c) = G j(w j (h,g)) w (h,g)=w (h,g) w j (h,g), j. (8) wj (h,g)=w j (h,g)
6 6 Snce we have G (w (h,g)) w (h,g) = log w (h,g)=w (h,g) ( 1+ h ) p (h,g) w (h,g) h p (h,g) w (h,g)+h p (h,g) =Y ( ) h p (h,g) w (h,g) where Y(x) log(1 + x) x/(1 + x) s a monotoncally ncreasng functon, we can obtan from (8) that h p (h,g) w (h,g) = h jp j (h,g), j (10) (h,g) w j It follows from (7b) that at optmalty we have N w (h,g) = W. Furthermore, usng (10), we can obtan that w (h,g) = W h p (h,g) N h p (h,g). (11) Substtutng the optmal w (h,g) gven by (11) nto (6), we can equvalently rewrte (6) as { ( )} N max E W log 1+ h p (h,g) (12) {p (h,g)} F W where F s a feasble set specfed only by a partcular combnaton of the power constrants {(2), (3), (4), (5)}. Therefore, the optmal power allocaton obtaned from the problem (6) and denoted by {p (h,g)}, can also be obtaned by solvng the equvalent problem (12). Then the optmal bandwdth allocaton obtaned from the problem (6) and denoted by {w (h,g)}, can be found as w(h,g) = W h p (h,g) N h (13) p (h,g). IV. OPTIMAL POWER ALLOCATION In ths secton, we study the optmal power allocaton obtaned from the problem (12) wth F specfed by dfferent combnatons of the power constrants. A. Peak transmt power wth peak nterference power constrants Consder F = {the constrants (2) and (3)}. Then the optmal value of the problem (12) can be expressed as E{f 1 (h,g)}, where f 1 (h,g) s gven by ( ) N f 1 (h,g) max W log 1+ h p (h,g) {p (h,g)} W s.t. p (h,g) P pk, g p (h,g) Q pk. (9) (14a) (14b) (14c)
7 7 For brevty, we drop the dependence on h and g that specfes nstantaneous channel power gans. Also let {p } denote the optmal soluton of the problem (14a) (14c). Introducng q g p, the problem (14a) (14c) can be equvalently rewrtten as max {q } h g q s.t. q g P pk, q Q pk. (15a) (15b) (15c) Let {q } denote the optmal soluton of the problem (15a) (15c) and (s 1,s 2,,s N ) denote a permutaton of the SU ndexes such that h s1 /g s1 > h s2 /g s2 > > h sn /g sn. It s assumed that h /g h j /g j, j, snce h, g, h j, and g j are drawn from a contnuous-valued random process. Then the followng lemma s n order. Lemma 1: There exsts k, 1 k N, such that q s = g s P pk s,, 1 k 1, 0 < q s k g sk P pk s k, and q s = 0,, k +1 N. Proof: Let q s j > 0 for some j and let l < j for some l. Frst we prove that q s l = g sl P pk s l by contradcton. If q s l < g sl P pk s l, then we can always fnd q > 0 and defne a feasble soluton {q s } of the problem (15a) (15c) q s j q s j q,q s l q s l + q,q s q s,, j, l such that the objectve functon n (15a) acheves larger value for {q s } than for the optmal soluton {q }, snce we have N h s g s q s ( h s q hsl s g = h ) s j q > 0. (16) s g sl g sj Therefore, t contradcts the fact that {q s } s the optmal soluton of the problem (15a) (15c). Let q s j < g sj P pk s j for some j and let l > j for some l. Usng the result obtaned above, t can be proved also by contradcton that q s l = 0. Ths completes the proof. Lemma 1 shows that for the optmal power allocaton under the constrants (2) and (3), there exsts at most one user that transmts at nonzero power and below ts peak power, whle any other user ether does not transmt or transmts at ts peak power. Note that ether the constrants (15b) or the constrant (15c) must be actve at optmalty. Usng the structure of {q } gven n Lemma 1, k can be found by Algorthm 1.
8 8 Algorthm 1 Algorthm for fndng k n Lemma 1 Intalze: k = 1 whle k g s P pk s < Q pk and k N 1 do k = k +1 end whle Output: k Snce p s = qs /g s, we obtan Ps pk, 1 k 1 p s = mn{ps pk,(q pk k 1 g s Ps pk )/g s }, = k 0, k +1 N. (17) Note that for brevty, we say n ths paper that n x = 0 f n = 0 wth a lttle abuse of notaton. B. Average transmt power wth average nterference power constrants Consder F = {the constrants (4) and (5)}. Then the dual functon of the problem (12) can be wrtten as f 2 ({λ },µ) E{f 2(h,g)}+ λ P av +µq av (18) where {λ 1 N} and µ are the nonnegatve dual varables assocated wth the correspondng constrants n (4) and (5) and f 2 (h,g) s gven by ( ) N f 2 (h,g) max W log 1+ h p (h,g) {p (h,g)} W γ p (h,g) (19) wth γ λ +µg. Let {p } denote the optmal soluton of the problem (19), where we drop the dependence on h and g for brevty. Also let F({p }) denote the objectve functon n (19). If p > 0 for some, the followng must hold F({p }) h p = {p }={p } 1+ N h p /W γ = 0. (20) Then the followng lemma s of nterest. Lemma 2: If h γ for some, then p = 0.
9 9 Proof: If p j = 0, j, then p = 0. If p j 0 for some j, t can be seen that (20) can not be satsfed snce h γ. Thus, p = 0. If p = 0 for some, the followng must hold F({p }) h p = {p }={p } 1+ N h p /W γ 0. (21) Then the next lemma s n order. Lemma 3: p = 0,, f and only f h γ,. Proof: It can be seen from Lemma 2 that f h γ,, then p = 0,. Moreover, t can be seen from (21) that f p = 0,, then h γ,. Let (s 1,s 2,,s N ) denote a permutaton of the SU ndexes such that h s1 /γ s1 > h s2 /γ s2 > > h sn /γ sn. Then we can also prove the followng lemma. Lemma 4: There exsts at most one k such that p k > 0. Moreover, k = s 1. Proof: We prove t by contradcton. It can be seen from (20) that f p > 0 and p j > 0 for some j, the followng must hold h γ = h j γ j. (22) Snce h, γ, h j, and γ j are ndependent constants gven n the problem (19), (22) can not be satsfed. Let p k > 0 and p must hold Therefore, we must have k = s 1. = 0,, k. Then t follows from (20) and (21) that the followng h k γ k h γ, k. (23) Lemma 4 shows that for the optmal power allocaton under the constrants (4) and (5), there exsts at most one user that transmts at nonzero power, whle any other user does not transmt. Case 1: Consder the case when h γ,. It follows from Lemma 3 that p Case 2: = 0,. Consder the case when h γ does not hold for some. Usng Lemma 4, let p k > 0 and p = 0,, k. Substtutng {p } nto (20), we have p s 1 = W(1/γ s1 1/h s1 ). Therefore, we obtan W (1/(λ p s1 +µg s1 ) 1/h s1 ), = 1 s = 0, 2 N. (24)
10 10 C. Peak transmt power wth average nterference power constrants Consder F = {the constrants (2) and (5)}. Then the dual functon of the problem (12) can be wrtten as f 3 (µ) E{f 3 (h,g)}+µqav (25) where µ s the nonnegatve dual varable assocated wth the constrant (5), and f 3 (h,g) s gven by f 3 (h,g) max W log {p (h,g)} s.t. p (h,g) P pk,. ( ) N 1+ h p (h,g) µ W g p (h,g) (26a) (26b) Let {p } denote the optmal soluton of the problem (26a) (26b) after droppng the dependence on h and g for brevty. The followng cases are of nterest. Case 1: Consder the case when h µg,. Snce the problem (26a) (26b) wthout the constrants (26b) has the same form as the problem (19), and p = 0,, satsfes the constrant (26b), t can be seen from Lemma 3 that p = 0,. Case 2: Consder the case when h µg does not hold for some. The problem (26a) (26b) s equvalent to maxw log {q } ( ) N 1+ h q /µg W s.t. q µg P pk, where q µg p. Let {q } denote the optmal soluton of the problem (27a) (27b) and q (27a) (27b) (s 1,s 2,,s N ) denote a permutaton of the SU ndexes such that h s1 /µg s1 > h s2 /µg s2 > > h sn /µg sn. Then the followng lemma s n order. Lemma 5: There exsts k, 1 k N, such that q s = g s P pk s,, 1 k 1, 0 < q s k g sk P pk s k, and q s = 0,, k +1 N. Proof: Consder the followng ntermedate problem h max q (28a) {q } µg s.t. q µg P pk, q = Q (28b) (28c)
11 11 where Q N q and t s unknown snce {q } s unknown. Let {q } denote the optmal soluton of the problem (28a) (28c). If {q } {q }, we have N h q /µg N h q /µg snce {q } s a feasble soluton of the problem (28a) (28c). Then we have ( ) ( N F ({q }) F ({q}) = W log 1+ h ) q /µg N W log 1+ h q/µg 0 (29) W W where F({q }) denotes the objectve functon n the problem (27a) (27b). Snce {q } s a feasble soluton of the problem (27a) (27b), t contradcts the fact that {q } s the optmal soluton of the problem (27a) (27b). Therefore, t must be true that {q } = {q }. It can be seen from the constrants (27b) that N q = N q = Q N µg P pk. Then the problem (28a) (28c) s equvalent to the followng problem max {q } h µg q (30a) s.t. q µg P pk, q Q (30b) (30c) snce the constrant (30c) s actve at optmalty. Therefore, the problem (27a) (27b) s equvalent to the problem (30a) (30c). Snce the problem (30a) (30c) s smlar to the problem (15a) (15c) n Secton IV-A, we conclude that {q } has the same structure as that gven n Lemma 1. The result of Lemma 5 s smlar to that of Lemma 1. Specfcally, t shows that for the optmal power allocaton under the constrants (2) and (5), there exsts at most one user that transmts at nonzero power and below ts peak power, whle any other user ether does not transmt or transmts at ts peak power. Usng Lemma 5, let q s = µg s P pk s,, 1 k 1, 0 < q s k µg s P pk s, and q s = 0,, k +1 N. Then we only need to fnd k and q s k to determne {q }. Consder the case when 0 < qs k < µg sk Ps pk k, 1 k N. Then the followng must be true H(q sk ) h sk /µg q sk = ( sk N 1 = 0 (31) qsk =qs k 1+, k h s qs /µg s +h sk qs k /µg sk )/W where H(q sk ) W log ( 1+ N, k h s q s /µg s +h sk q sk /µg sk W ), k q s q sk. (32)
12 12 Substtutng {q s } nto (31), we obtan q s k = W(1 µg sk /h sk ) µg sk k 1 h s P pk s /h sk. Snce qs k must satsfy 0 < qs k < µg s Ps pk, t must be true that k 1 ( ) h s Ps pk hsk < W 1 < µg sk k h s P pk s. (33) Consder the case when qs k = µg sk Ps pk k, 1 k N 1. Then the followng must hold H(q sk ) h sk /µg q sk = ( sk N 1 0 (34) qsk =qs k 1+, k h s qs /µg s +h sk qs k /µg sk )/W and H(q sk+1 ) q sk+1 = qsk+1 =qs k+1 1+ ( N Substtutng {q } nto (34) and (35), we obtan ( ) hsk+1 k W 1 µg sk+1 h sk+1 /µg sk+1, k+1 h s q s /µg s +h sk+1 q s k+1 /µg sk+1 )/W h s P pk s W 1 0. (35) ( ) hsk 1, 1 k N 1. (36) µg sk If qs k = µg sk Ps pk k, k = N, then only (34) must be true and t follows that k ( ) h s Ps pk hsk W 1, k = N. (37) µg sk Lemma 6: There exsts only one set of values for {q } that satsfes only one of the necessary condtons (31), (34) or (35). Proof: It s equvalent to prove that there exsts only one k that satsfes only one of (33), (36) or (37). Let L j j h s P pk s and M j W(h sj /µg sj 1) for brevty. Then t must be true that L 0 < L 1 < < L N, M 1 > M 2 > > M N and L 0 < M 1. It can be seen that f (37) holds,.e., f L < M,, 1 N, then (33) and (36) do not hold. If (37) does not hold, then these exsts such l that L < M,, 1 l 1 and L > M,, 1 N. The followng two cases should be consdered. () If L l 1 < M l < L l, (33) holds for k = l. Snce L < M,, 1 l 1, (33) does not hold for k < l as well. Snce M < M l < L l L 1,, l +1, (33) does not hold for k > l. Snce L < L +1 < M +1,, 1 l 2, (36) does not hold for k < l 1. Snce L l 1 < M l, (36) does not hold also for k = l 1. Moreover, snce M < L,, l, (36) does not hold for k > l 1. Therefore, only (33) holds for only k = l. () If M l < L l 1 < M l 1, (36) holds for k = l 1. Smlar to the case (), t can be proved that only (36) holds for only k = l 1.
13 13 Algorthm 2 Algorthm for fndng k n Lemma 5 Intalze: k = 0, c = 0 whle c = 0 do k = k +1 f k 1 h s P pk s < W(h sk /µg sk 1) < k h s P pk s then c = 1 end f f {W(h sk+1 /µg sk+1 1) k h s P pk s W(h sk /µg sk 1) and k N 1} or { k h s P pk s W(h sk /µg sk 1) and k = N} then c = 2 end f end whle Output: k, c Usng Lemma 6, Algorthm 2 s developed to fnd the unque k n Lemma 5. Note that k satsfes (33) and (36) or (37) f the output of Algorthm 2 s c = 1 and c = 2, respectvely. Snce p s = qs /µg s, when c = 1, we obtan Ps pk, 1 k 1 p s = W(1/µg sk 1/h sk ) k 1 h s Ps pk /h sk, = k 0, k +1 N, 1 N (38) and when c = 2, we obtan P p s pk s =, 1 k 0, k +1 N, 1 N. (39) D. Average transmt power wth peak nterference power constrants Consder F = {the constrants (3) and (4)}. Then the dual functon of the problem (12) can be wrtten as f 4 ({λ }) E{f 4 (h,g)}+ N λ P av (40)
14 14 where {λ 1 N} are the nonnegatve dual varables assocated wth the correspondng constrants (4) and f 4 (h,g) s gven by f 4 (h,g) max W log {p (h,g)} s.t. ( ) N 1+ h p (h,g) W g p (h,g) Q pk. λ p (h,g) (41a) (41b) Let {p } denote the optmal soluton of the problem (41a) (41b) where the dependence on h and g s dropped for brevty. The followng three cases are of nterest. Case 1: Consder the case when h λ,. Smlar to Case 1 n Secton IV-C, t can be seen from Lemma 3 that p = 0,. Case 2: Consder the case when h λ does not hold for some and the constrant (41b) s nactve at optmalty. Let (s 1,s 2,,s N ) denote a permutaton of the SU ndexes such that h s1 /λ s1 > h s2 /λ s2 > > h sn /λ sn. Snce the problem (41a) (41b) wthout the constrant (41b) has the same form as the problem (19), t can be seen from (24) that p s 1 = W(1/λ s1 1/h s1 ) and p s = 0,, 2 N, f t satsfes the constrant (41b),.e., N g s p s = g s1 W(1/λ s1 1/h s1 ) < Q pk. Case 3: Consder the case when h λ does not hold for some and the constrant (41b) s actve at optmalty,.e., g s1 W(1/λ s1 1/h s1 ) Q pk. The dual functon of the problem (41a) (41b) can be wrtten as f 4 (µ) f 4 +µqpk, where µ s the nonnegatve dual varable assocated wth the constrant (41b), and f 4 s gven by ( ) N f 4 max W log 1+ h p {p } W λ p µ g p. (42) Let µ denote the optmal dual varable. Also let F({p }) denote the objectve functon n the problem (42). If p > 0 for some, the followng must hold F({p }) h p = {p }={p } 1+ N h p /W λ µ g = 0. (43) If p = 0 for some, the followng must hold F({p }) h p = {p }={p } 1+ N h p /W λ µ g 0. (44) Note that snce the problem (41a) (41b) s convex, the necessary condtons (43) and (44) for the optmal soluton {p } are also suffcent condtons.
15 15 p k Lemma 7: There exsts at most two j k such that p j > 0 and p k > 0. Proof: We prove t by contradcton. It can be seen from (43) that f p > 0, p j > 0 for some j, j k, k, the followng must hold > 0, and h λ +µ g = h j λ j +µ g j = h k λ k +µ g k. (45) Snce h, λ, g, h j, λ j, g j, h k, λ k, and g k are ndependent constants gven n the problem (41a) (41b), and only µ s a varable, (45) can not be satsfed. Lemma 7 shows that for the optmal power allocaton under the constrants (3) and (4), there exsts at most two users that transmt at nonzero power, whle any other user does not transmt. Then Case 3 can be further dvded nto the followng two subcases. Case 3.1: Consder the subcase when p k > 0 and p = 0, k. Snce the constrant (41b) s actve at optmalty,.e., N g p = g k p k = Qpk, we obtan that p k = Qpk /g k. Then substtutng {p } nto (43) we have µ = 1 g k /h k +Q pk /W λ k g k. (46) Note that µ gven n (46) must satsfy µ 0. Substtutng {p } nto (44), we can see that µ gven n (46) also must satsfy µ h /g 1+h k Q pk /g k W λ g,, k. (47) Then Algorthm 3 can be used to fnd k. Note that {p } does not exst n Case 3.1 f the output Algorthm 3 Algorthm for fndng k n Case 3.1 ( ) k = argmax {} W log 1+ h Q pk g W µ = 1 g k /h k +Q pk /W λ k f µ < max { k} k = 0 end f Output: k g k λ Q pk g h /g 1+h k Q pk /g k W λ g or µ < 0 then of Algorthm 3 s k = 0. Case 3.2: Consder the subcase when p j > 0, p k > 0, j k and p follows from (43) that h j λ j +µ g j = = 0,, j, k. It h k λ k +µ g k. (48)
16 16 Therefore, we obtan that µ = λ j/h j λ k /h k g k /h k g j /h j. (49) Note that µ gven n (49) must satsfy µ 0. Usng (43) and the fact that the constrant (41b) s actve at optmalty, we have h j p j +h kp k = Wh j/(λ j +µ g j ) W g j p j +g kp k = Qpk. Solvng the system of equaton (50), we obtan (50) p j = Qpk /g k a/h k g j /g k h j /h k, p k = a/h j Q pk /g j h k /h j g k /g j (51) where a Wh j /(λ j +µ g j ) W. Note that p j and p k gven n (51) must satsfy p j > 0 and p k > 0. Substtutng {p } and µ nto (44), we can see that j and k must satsfy λ j /h j λ k /h k g k /h k g j /h j λ j/h j λ /h g /h g j /h j,, j, k. (52) Then Algorthm 4 can be used to fnd j and k. Note that {p } does not exst f the output of Algorthm 4 s j = 0 and k = 0. E. Combnatons of more than two power constrants ConsderF = {the constrants (2), (4), and (5)} orf = {the constrants (3), (4), and (5)}. It can be shown that the correspondng dual functons of the problem (12) under these two combnatons of the power constrants have the same form as those n Subsectons IV-C and IV-D, respectvely. Therefore, optmal solutons can be found smlarly theren and, thus, are omtted here. ConsderF = {the constrants (2), (3), and (4)} or F = {the constrants (2), (3), and (5)} or F = {the constrants (2), (3), (4), and (5)}. It can be shown that the correspondng dual functons of the problem (12) under the frst two combnatons of the power constrants have the same form as that under the thrd combnaton. Therefore, we only focus on the case F = {the constrants(2), (3), (4), and (5)}. Then the dual functon of the problem (12) can be wrtten as f 5 ({λ },µ) E{f 5(h,g)}+ λ P av +µq av (53)
17 17 Algorthm 4 Algorthm for fndng j and k n Case 3.2 Intalze: I = for j = 1,,N 1 do for k = j +1,,N do µ = λ j/h j λ k /h k g k /h k g j /h j f µ 0 then a = Wh j /(λ j +µ g j ) W p j = Qpk /g k a/h k g j /g k h j /h k, p k = a/h j Q pk /g j h k /h j g k /g j f p j > 0 and p k > 0 then I = I {(j,k)} ( ) v j,k = W log 1+ h jp j +h kp k λ W j p j λ kp k end f end f end for end for (j,k) = argmax {(,l) I} v,l f λ j/h j λ k /h k g k /h k g j /h j < max { j,k} λ j /h j λ /h g /h g j /h j then j = 0, k = 0 end f Output: j, k where {λ 1 N} and µ are the nonnegatve dual varables assocated wth the correspondng constrants n (4) and (5) and f 5 (h,g) s gven by ( ) N f 5 (h,g) max W log 1+ h p (h,g) λ p (h,g) µ {p (h,g)} W s.t. g p (h,g) Q pk p (h,g) P pk,. g p (h,g) (54a) (54b) (54c) Let {p } denote the optmal soluton of the problem (54a) (54c) where the dependence on h and g s dropped for brevty. The followng cases are of nterest.
18 18 Case 1: Consder the case when h λ +µg,. Smlar to Case 1 n Subsectons IV-C and IV-D, t can be seen from Lemma 3 that p = 0,. Case 2: Consder the case when h λ +µg does not hold for some and the constrant (54b) s nactve at optmalty. Snce the problem (54a) (54c) wthout the constrant (54b) has the same form as the problem (26a) (26b), {p } can be found usng Algorthm 2 and (38) or (39) f t satsfes the constrant (54b). Case 3: Consder the case when h λ +µg does not hold for some and the constrant (54b) s actve at optmalty. The dual functon of the problem (54a) (54c) can be wrtten as f 5 (β) f 5 + βqpk, where β s the nonnegatve dual varable assocated wth the constrant (54b) and f 5 s gven by f 5 maxw log {p } s.t. p P pk,. ( ) N 1+ h p W γ p β g p (55a) (55b) where γ λ +µg. Let β denote the optmal dual varable and F({p }) stands for the objectve functon n the problem (55a). If P pk > p > 0 for some, the followng must hold F({p }) h p = {p }={p } 1+ N h p /W γ β g = 0. (56) If p = Ppk Moreover, f p for some, the followng must hold F({p }) h p = {p }={p } 1+ N h p /W γ β g 0. (57) = 0 for some, the followng must hold F({p }) h p = {p }={p } 1+ N h p /W γ β g 0. (58) Note that snce the problem (54a) (54c) s convex, the necessary condtons (56), (57) and (58) for the optmal soluton {p } are also suffcent condtons. p j Lemma 8: There exsts at most two j and k, j k such that P pk j > p j > 0 and Ppk k > p k > 0. Proof: We prove t by contradcton. It can be seen from (56) that f P pk > p > 0, P pk j > > 0, and Ppk k > p k > 0 for some j, j k, k, the followng must be true h γ +β g = h j γ j +β g j = h k γ k +β g k. (59)
19 19 Snce h, γ, g, h j, γ j, g j, h k, γ k, and g k are ndependent constants gven n the problem (54a) (54c), and only β s a varable, (59) can not be satsfed. Lemma 8 shows that for the optmal power allocaton under the constrants (2), (3), (4) and (5), there exsts at most two user that transmt at nonzero power and below ther peak power, whle any other user ether does not transmt or transmts at ts peak power. Then Case 3 can be further dvded nto the followng two subcases. Case 3.1: Consder the subcase when P pk k > p k > 0 and p {P pk,0}, k. Let N 1 and N 0 denote the sets of SU ndexes such that p = P pk, N 1 and p = 0, N 0. Snce the constrant (54b) s actve at optmalty,.e., N g p = g k p k + N 1 g P pk obtan p k = (Qpk N 1 g P pk )/g k. Note that p k substtutng {p } nto (56) we obtan = Q pk, we gven here must satsfy Ppk k > p k > 0. Then β = 1+ h k /g ( k h k (Q pk N 1 g P pk )/g k + ) N 1 h P pk /W γ k g k. (60) Note that β gven by (60) must satsfy β 0. Substtutng {p } nto (57) we can see that β gven by (60) must satsfy β 1+ h /g ( h k (Q pk N 1 g P pk )/g k + ) N 1 h P pk /W Substtutng {p } nto (58), we can see that β gven n (60) also must satsfy γ g, N 1. (61) β 1+ h /g ( h k (Q pk N 1 g P pk )/g k + ) N 1 h P pk /W γ g, N 0. (62) Let S (1),S (2),,S (2N 1 ) denote all the subsets of the set N\{} where \ denotes the set dfference operator. Then Algorthm 5 can be used to fnd k, N 1, and N 0. Note that {p } does not exst f the output of Algorthm 5 s k = 0. Case 3.2: Consder the subcase when P pk j > p j > 0, Ppk k > p k > 0 and p {P pk,0}, j,k. Let N 1 and N 0 denote the sets of SU ndexes such that p = P pk, N 1 and p = 0, N 0, respectvely. It follows from (56) that Therefore, we obtan that h j γ j +β g j = h k γ k +β g k. (63) β = γ j/h j γ k /h k g k /h k g j /h j. (64)
20 20 Algorthm 5 Algorthm for fndng k, N 1, N 0 n Case 3.1 Intalze: I = for k = 1,2,,N do for l = 1,2,,2 N 1 do N 1 = S (l) k p k = (Qpk N 1 g P pk )/g k f P pk k > p k > 0 then I = I {l} ( ) r l = W log 1+ h kp k + N h P pk 1 W end f end for v k = max { I} r, t = argmax { I} r S k = S(t) k I = end for k = argmax {} v N 1 = S k N 0 = N\N 1 \{k} β = f β < 0 or β > or β < γ k p k N 1 γ P pk h k /g k 1+(h k (Q pk N g P pk 1 )/g k + γ N h P pk k 1 )/W g k h /g 1+(h k (Q pk N g P pk 1 )/g k + γ N h P pk 1 )/W g, N 1 h /g 1+(h k (Q pk N 1 g P pk )/g k + N 1 h P pk )/W γ g, N 0 then k = 0 end f Output: k, N 1, N 0 Note that β gven n (64) must satsfy β 0. Followng (56) and the fact that the constrant (54b) s actve at optmalty, we have h j p j +h kp k = Wh j/(γ j +β g j ) W N 1 h P pk g j p j +g k p k = Qpk N 1 g P pk. (65)
21 21 Solvng the system of equaton (65), we obtan p j = a/g k b/h k g j /g k h j /h k, p k = b/h j a/g j h k /h j g k /g j (66) where a Q pk N 1 g P pk and b Wh j /(γ j +β g j ) W N 1 h P pk. Note that p j and p k gven n (66) must satsfy Ppk j > p j by (64) nto (57), we obtan > 0 and Ppk k > p k > 0. Substtutng {p } and β gven γ j /h j γ k /h k g k /h k g j /h j γ j/h j γ /h g /h g j /h j, N 1. (67) Moreover, substtutng {p } and β gven by (64) nto (58), we also obtan Let S (1),j,S(2),j,,S(2N 2 ),j γ j /h j γ k /h k g k /h k g j /h j γ j/h j γ /h g /h g j /h j, N 0. (68) denote all the subsets of the set N\{,j}. Then Algorthm 6 can be used to fnd j, k, N 1, and N 0. Note that {p } does not exst f the output of Algorthm 6 s j = 0 and k = 0. V. SIMULATION RESULTS Consder a cogntve rado network whch conssts of one PU and four SUs. For smplcty, we assume that only Raylegh fadng s present n all lnks. The varance of the channel power gan s set to σ 2 = 1. We also set W = 1, P pk = 10,, P av = 10,, Q pk = 1, and Q av = 1 as default values f no other values are specfed otherwse. The AWGN wth unt PSD s assumed. We use 1000 randomly generated channel power gans for h and g n our smulatons. The results are compared under the followng fve combnatons of the power constrants: the PTP wth PIP constrants (PTP+PIP), the PTP wth AIP constrants (PTP+AIP), the ATP wth PIP constrants (ATP+PIP), the ATP wth AIP constrants (ATP+AIP), the PTP and ATP wth PIP and AIP constrants (PTP+ATP+PIP+AIP). Frst, we am at showng by Fg. 1 that the nformaton-theoretc lmt for the sum ergodc capacty s ndeed sgnfcantly hgher when bandwdth s allocated optmally as compared to the case when t s allocated equally among SUs. In ths fgure, OBPA stands for optmal bandwdth and power allocaton, whle EBPA stands for equal bandwdth and power allocaton. The case of PTP+PIP s only depcted n Fg. 1, but the concluson about the superorty of optmal bandwdth and power allocaton holds true for other combnatons of power constrants. Then
22 22 Algorthm 6 Algorthm for fndng j, k, N 1, N 0 n Case 3.2 Intalze: I = for j = 1,2,,N 1 do for k = j +1,,N do for l = 1,2,,2 N 2 do N 1 = S (l) j,k β = γ j/h j γ k /h k g k /h k g j /h j f β 0 then a Q pk N 1 g P pk, b Wh j /(γ j +β g j ) W N 1 h P pk p j = a/g k b/h k g j /g k h j /h k, p k = b/h j a/g j h k /h j g k /g j f P pk j > p j > 0 and Ppk k > p k > 0 then I = I {l} ( ) r l = W log 1+ h jp j +h kp k + N h P pk 1 W end f end f end for v j,k = max { I} r, t = argmax { I} r S j,k = S(t) j,k I = end for end for (j,k) = argmax {(,l)} v,l N 1 = S j,k N 0 = N\N 1 \{j,k} γ j p j γ k p k N 1 γ P pk f γ j/h j γ k /h k g k /h k g j /h j > γ j/h j γ /h g /h g j /h j, N 1 or γ j/h j γ k /h k g k /h k g j /h j < γ j/h j γ /h g /h g j /h j, N 0 then j = 0, k = 0 end f Output: j, k, N 1, N 0
23 23 Fg. 2 shows and compares the maxmum sum ergodc capacty under PTP+PIP, PTP+AIP and PTP+ATP+PIP+AIP constrants versus P pk where P pk = P pk, s assumed. It can be seen from the fgure that the maxmum sum ergodc capacty acheved under PTP+AIP s larger than that acheved under PTP+PIP for any gven P pk. Ths s due to the fact that the AIP constrant s more favorable than the PIP constrant from SUs perspectve, snce the former allows for more flexblty for SUs to allocate transmt power over dfferent channel fadng states. It s also observed that the performance under PTP+ATP+PIP+AIP s very close to that under PTP+PIP that s because the PTP constrant domnates over the ATP, PIP, and AIP constrants for all values of P pk. Fg. 3 shows the maxmum sum ergodc capacty under ATP+PIP, ATP+AIP and PTP+ATP+ PIP+AIP constrants versus P av where P av = P av, s assumed. The maxmum achevable sum ergodc capacty acheved under ATP+AIP s larger than that acheved under ATP+PIP for all values of P av snce the PIP constrant s strcter than the AIP constrant. The sum ergodc capacty under PTP+ATP+PIP+AIP s much smaller than that under ATP+PIP and ATP+AIP due to the fact that the PTP constrant s domnant over other constrants for all values of P av. Fg. 4 shows the maxmum sum ergodc capacty under PTP+PIP, ATP+PIP and PTP+ATP+ PIP+AIP constrants versus Q pk. It can be seen from the fgure that the maxmum sum ergodc capacty acheved under ATP+PIP s larger than that acheved under PTP+PIP for any gven Q pk. Ths s because the power allocaton s more flexble for SUs under the ATP constrant than under the PTP constrant. The sum ergodc capacty under PTP+ATP+PIP+AIP saturates earler than that under PTP+PIP and ATP+PIP, because t s restrcted by the AIP constrant. Fg. 5 shows the maxmum sum ergodc capacty under PTP+AIP, ATP+AIP and PTP+ATP+ PIP+AIP constrants versus Q av. Due to the same reasons as for the results n Fg. 4, the sum ergodc capacty acheved under ATP+AIP s larger than that acheved under PTP+AIP. The sum ergodc capacty under PTP+ATP+PIP+AIP saturates earler than that for PTP+AIP and ATP+AIP because of the presence of the PIP constrant. Fnally, Fg. 6 shows the maxmum sum ergodc capacty under PTP+PIP, PTP+AIP, ATP+PIP, ATP+AIP and PTP+ATP+PIP+AIP versus W. Smlar performance comparson results as n the prevous fgures can be observed. One dfference s that the sum ergodc capactes do not saturate wth the ncrease of W.
24 24 VI. CONCLUSION A cogntve rado network where multple SUs share the lcensed spectrum of a PU usng the FDMA scheme has been consdered. The maxmum achevable sum ergodc capacty of all the SUs has been studed subject to the total bandwdth constrant of the lcensed spectrum and all possble combnatons of the peak/average transmt power constrants at the SUs and nterference power constrant mposed by the PU. Optmal bandwdth allocaton has been derved n each channel fadng state for any gven power allocaton. Usng the structures of the optmal power allocatons under each combnaton of the power constrants, algorthms for fndng the optmal power allocatons have been developed too. REFERENCES [1] J. Mtola, Cogntve rado: An ntegrated agent archtecture for software defned rado,, Ph.D. dssertaton, KTH, Stockholm, Sweden, Dec [2] S. Haykn, Cogntve rado: Bran-empowered wreless communcatons, IEEE J. Sel. Areas Commun., vol. 23, pp , Feb [3] Q. Zhao, L. Tong and S. Ananthram, Decentralzed cogntve MAC for opportunstc spectrum access n ad hoc networks: A POMDP framework, IEEE J. Sel. Areas Commun., vol. 25, pp , Apr [4] Y. Chen, Q. Zhao, and S. Ananthram, Jont desgn and separaton prncple for opportunstc spectrum access n the presence of sensng errors, IEEE Trans. Inform. Theory, vol. 54, pp , May [5] S. Ahmad, M. Lu, T. Javd, Q. Zhao, and B. Krshnamachar, Optmalty of myopc sensng n multchannel opportunstc access, IEEE Trans. Inform. Theory, vol. 55, pp , Sep [6] N. B. Chang and M. Lu, Optmal channel probng and transmsson schedulng for opportunstc spectrum access, IEEE Trans. Networkng, vol. 55, pp , Sep [7] Q. Zhao and B. M. Sadler, A survey of dynamc spectrum access, IEEE Sgnal Process. Mag., vol. 24, pp , May [8] K. T. Phan, S. A. Vorobyov, N. D. Sdropoulos, and C. Tellambura, Spectrum sharng n wreless networks va QoS-aware secondary multcast beamformng, IEEE Trans. Sgnal Process., vol. 57, pp , June [9] R. Zhang and Y.-C. Lang, Exploatng mult-antennas for oportunstc spectrum sharng n cogntve rado networks, IEEE J. Sel. Topcs Sgnal Process., vol. 2, no. 1, pp , Feb [10] R. Zhang, On peak versus average nterference power constrants for protectng prmary users n cogntve rado networks, IEEE Trans. Wreless Commun., vol. 8, pp , Apr [11] R. Zhang and Y.-C. Lang, Investgaton on multuser dversty n spectrum sharng based cogntve rado networks, IEEE Commun. Letters, vol. 14, pp , Feb [12] G. Zheng, K.-K. Wong, and B. Ottersten, Robust cogntve beamformng wth bounded channel uncertantes, IEEE Trans. Sgnal Process., vol. 57, pp , Dec [13] A. Ghasem and E. S. Sousa, Fundamental lmts of spectrum-sharng n fadng envronments, IEEE Trans. Wreless Commun., vol. 6, pp , Feb
25 25 [14] L. Musavan and S. Assa, Capacty and power allocaton for spectrum-sharng communcatons n fadng channels, IEEE Trans. Wreless Commun., vol. 8, pp , Jan [15] X. Kang, Y.-C. Lang, A. Nallanathan, H. K. Garg, and R. Zhang, Optmal power allocaton for fadng channels n cogntve rado networks: Ergodc capacty and outage capacty, IEEE Trans. Wreless Commun., vol. 8, pp , Feb [16] R. Zhang, S. Cu, and Y.-C. Lang, On ergodc sum capacty of fadng cogntve multple-access and broadcast channels, IEEE Trans. Inform. Theory, vol. 55, pp , Nov [17] W. Yu and J. M. Coff, FDMA capacty of a Gaussan multple access channel wth ISI, IEEE Trans. Commun., vol. 50, pp , Jan [18] K. Kumaran and H. Vswanathan, Jont power and bandwdth allocaton n downlnk transmsson, IEEE Trans. Wreless Commun., vol. 4, pp , May [19] J. Acharya and R. D. Yates, Dynamc spectrum allocaton for uplnk users wth heterogeneous utltes, IEEE Trans. Wreless Commun., vol. 8, pp , Mar [20] J. Gao, S. A. Vorobyov, and H. Jang, Cooperatve resource allocaton games under spectral mask and total power constrants, IEEE Trans. Sgnal Processng, vol. 58, to be publshed n Aug (see also arxv: CS.IT/ ) [21] I. Marc and R. D. Yates, Bandwdth and power allocaton for cooperatve strateges n gaussan relay networks, IEEE Trans. Inform. Theory, vol. 56, pp , Apr [22] X. Gong, S. A. Vorobyov, and C. Tellambura, Jont bandwdth and power allocaton n mult-user decode-and-forward relay networks, n Proc. 35th IEEE Inter. Conf. Acoustcs, Speech, and Sgnal Processng, Dallas, TX, USA, Mar. 2010, pp [23] X. Gong, S. A. Vorobyov, and C. Tellambura, Jont bandwdth and power allocaton wth admsson control n wreless mult-user networks wth and wthout relayng, submtted to IEEE Trans. Sgnal Process.. [24] S. Boyd and L. Vandenberghe. Convex Optmzaton. Cambrdge Unversty Press, 2004.
26 OBPA under PTP+PIP EBPA under PTP+PIP Sum Ergodc Capacty(nats/s) P pk (db) Fg. 1. Sum ergodc capacty vs P pk PTP+AIP PTP+PIP PTP+ATP+PIP+AIP Sum Ergodc Capacty(nats/s) P pk (db) Fg. 2. Sum ergodc capacty vs P pk.
27 Sum Ergodc Capacty(nats/s) P av (db) ATP+AIP ATP+PIP PTP+ATP+PIP+AIP Fg. 3. Sum ergodc capacty vs P av ATP+PIP PTP+PIP PTP+ATP+PIP+AIP Sum Ergodc Capacty(nats/s) Q pk (db) Fg. 4. Sum ergodc capacty vs Q pk.
28 ATP+AIP PTP+AIP PTP+ATP+PIP+AIP Sum Ergodc Capacty(nats/s) Q av (db) Fg. 5. Sum ergodc capacty vs Q av. Sum Ergodc Capacty(nats/s) ATP+AIP PTP+AIP ATP+PIP PTP+PIP PTP+ATP+PIP+AIP W(Hz) Fg. 6. Sum ergodc capacty vs W.
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 informationUniversity 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 informationPower Allocation/Beamforming for DF MIMO Two-Way Relaying: Relay and Network Optimization
Power Allocaton/Beamformng for DF MIMO Two-Way Relayng: Relay and Network Optmzaton Je Gao, Janshu Zhang, Sergy A. Vorobyov, Ha Jang, and Martn Haardt Dept. of Electrcal & Computer Engneerng, Unversty
More informationCognitive Access Algorithms For Multiple Access Channels
203 IEEE 4th Workshop on Sgnal Processng Advances n Wreless Communcatons SPAWC) Cogntve Access Algorthms For Multple Access Channels Ychuan Hu and Alejandro Rbero, Department of Electrcal and Systems Engneerng,
More informationx = x 1 + :::+ x K and the nput covarance matrces are of the form ± = E[x x y ]. 3.2 Dualty Next, we ntroduce the concept of dualty wth the followng t
Sum Power Iteratve Water-fllng for Mult-Antenna Gaussan Broadcast Channels N. Jndal, S. Jafar, S. Vshwanath and A. Goldsmth Dept. of Electrcal Engg. Stanford Unversty, CA, 94305 emal: njndal,syed,srram,andrea@wsl.stanford.edu
More informationAn Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
An Upper Bound on SINR Threshold for Call Admsson Control n Multple-Class CDMA Systems wth Imperfect ower-control Mahmoud El-Sayes MacDonald, Dettwler and Assocates td. (MDA) Toronto, Canada melsayes@hotmal.com
More informationA Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
A ower Bound on SIR Threshold for Call Admsson Control n Multple-Class CDMA Systems w Imperfect ower-control Mohamed H. Ahmed Faculty of Engneerng and Appled Scence Memoral Unversty of ewfoundland St.
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationExternalities in wireless communication: A public goods solution approach to power allocation. by Shrutivandana Sharma
Externaltes n wreless communcaton: A publc goods soluton approach to power allocaton by Shrutvandana Sharma SI 786 Tuesday, Feb 2, 2006 Outlne Externaltes: Introducton Plannng wth externaltes Power allocaton:
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationArizona 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 informationTwo-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 informationAdaptive power control algorithm in cognitive radio based on game theory
IET Communcatons Research Artcle Adaptve power control algorthm n cogntve rado based on game theory ISSN 1751-8628 Receved on 23rd November 2014 Revsed on 19th January 2015 Accepted on 24th February 2015
More informationMixed Strategy Nash Equilibrium in Two-User Resource Allocation Games
IEEE Internatonal Symposum on Informaton Theory Proceedngs Mxed Strategy Nash Equlbrum n Two-User Resource Allocaton Games Je Gao, Sergy A. Vorobyov, and Ha Jang Dept. of Electrcal and Computer Engneerng,
More informationJoint Scheduling and Power-Allocation for Interference Management in Wireless Networks
Jont Schedulng and Power-Allocaton for Interference Management n Wreless Networks Xn Lu *, Edwn K. P. Chong, and Ness B. Shroff * * School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette,
More informationCOGNITIVE 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 informationA Distributed Spectrum Sharing Algorithm in Cognitive Radio Networks
A Dstrbuted Spectrum Sharng Algorthm n Cogntve Rado Networks We Sun, Tong Lu, Yanmn Zhu, Bo L Shangha Jao Tong Unversty Hong Kong Unversty of Scence and Technology Emal: {sunwt,lutong2569164,yzhu}@sjtu.edu.cn,
More informationOn 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 informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationChapter 7 Channel Capacity and Coding
Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models
More informationChapter 7 Channel Capacity and Coding
Chapter 7 Channel Capacty and Codng Contents 7. Channel models and channel capacty 7.. Channel models Bnary symmetrc channel Dscrete memoryless channels Dscrete-nput, contnuous-output channel Waveform
More informationExplicit and Implicit Temperature Constraints in Energy Harvesting Communications
Explct and Implct Temperature Constrants n Energy Harvestng Communcatons Abdulrahman Baknna, Omur Ozel 2, and Sennur Ulukus Department of Electrcal and Computer Engneerng, Unversty of Maryland, College
More informationAn 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 informationPower 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 informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 34, NO. 12, DECEMBER
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 34, NO. 12, DECEMBER 2016 3195 An Energy-Effcent Strategy for Secondary Users n Cooperatve Cogntve Rado Networks for Green Communcatons Janqng Lu,
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationOptimal 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 informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationHidden 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 information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationReal-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling
Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for
More informationEnergy Efficient Resource Allocation in Machine-to-Machine Communications with Multiple Access and Energy Harvesting for IoT
1 Energy Effcent Resource Allocaton n Machne-to-Machne Communcatons wth Multple Access and Energy Harvestng for IoT Zhaohu Yang, We Xu, Senor Member, IEEE, Yjn Pan, Cunhua Pan, and Mng Chen arxv:1711.10776v1
More informationUniversity 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 informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationThe 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 informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationOn Spatial Capacity of Wireless Ad Hoc Networks with Threshold Based Scheduling
On Spatal Capacty of Wreless Ad Hoc Networks wth Threshold Based Schedulng Yue Lng Che, Ru Zhang, Y Gong, and Lngje Duan Abstract arxv:49.2592v [cs.it] 9 Sep 24 Ths paper studes spatal capacty n a stochastc
More informationMultiuser Cognitive Access of Continuous Time Markov Channels: Maximum Throughput and Effective Bandwidth Regions
Multuser Cogntve Access of Contnuous Tme Markov Channels: Maxmum Throughput and Effectve Bandwdth Regons Shyao Chen, and Lang Tong School of Electrcal and Computer Engneerng Cornell Unversty, Ithaca, NY
More informationError Probability for M Signals
Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationOPTIMAL 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 informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationSecret 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 informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More information4884 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 61, NO. 12, DECEMBER Energy Cooperation in Energy Harvesting Communications
4884 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 6, NO., DECEMBER 3 Energy Cooperaton n Energy Harvestng Communcatons Ber Guraan, Student Member, IEEE, Omur Ozel, Student Member, IEEE, Jng Yang, Member,
More informationEnergy Efficient Resource Allocation for Quantity of Information Delivery in Parallel Channels
TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES Trans. Emergng Tel. Tech. 0000; 00: 6 RESEARCH ARTICLE Energy Effcent Resource Allocaton for Quantty of Informaton Delvery n Parallel Channels Jean-Yves
More informationECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006)
ECE 534: Elements of Informaton Theory Solutons to Mdterm Eam (Sprng 6) Problem [ pts.] A dscrete memoryless source has an alphabet of three letters,, =,, 3, wth probabltes.4,.4, and., respectvely. (a)
More informationCOS 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 informationApplication 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 informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More information(1 ) (1 ) 0 (1 ) (1 ) 0
Appendx A Appendx A contans proofs for resubmsson "Contractng Informaton Securty n the Presence of Double oral Hazard" Proof of Lemma 1: Assume that, to the contrary, BS efforts are achevable under a blateral
More informationCS294 Topics in Algorithmic Game Theory October 11, Lecture 7
CS294 Topcs n Algorthmc Game Theory October 11, 2011 Lecture 7 Lecturer: Chrstos Papadmtrou Scrbe: Wald Krchene, Vjay Kamble 1 Exchange economy We consder an exchange market wth m agents and n goods. Agent
More informationMIMO Systems and Channel Capacity
MIMO Systems and Channel Capacty Consder a MIMO system wth m Tx and n Rx antennas. x y = Hx ξ Tx H Rx The power constrant: the total Tx power s x = P t. Component-wse representaton of the system model,
More informationConsider the following passband digital communication system model. c t. modulator. t r a n s m i t t e r. signal decoder.
PASSBAND DIGITAL MODULATION TECHNIQUES Consder the followng passband dgtal communcaton system model. cos( ω + φ ) c t message source m sgnal encoder s modulator s () t communcaton xt () channel t r a n
More informationJoint Scheduling and Resource Allocation in CDMA Systems
TO APPEAR IEEE TRANSACTIONS ON INFORMATION THEORY Jont Schedulng and Resource Allocaton n CDMA Systems Vjay G. Subramanan, Randall A. Berry, and Rajeev Agrawal Abstract In ths paper, the schedulng and
More informationPricing and Resource Allocation Game Theoretic Models
Prcng and Resource Allocaton Game Theoretc Models Zhy Huang Changbn Lu Q Zhang Computer and Informaton Scence December 8, 2009 Z. Huang, C. Lu, and Q. Zhang (CIS) Game Theoretc Models December 8, 2009
More informationAnalysis of Queuing Delay in Multimedia Gateway Call Routing
Analyss of Queung Delay n Multmeda ateway Call Routng Qwe Huang UTtarcom Inc, 33 Wood Ave. outh Iseln, NJ 08830, U..A Errol Lloyd Computer Informaton cences Department, Unv. of Delaware, Newark, DE 976,
More informationCooperative Game Theory for Distributed Spectrum Sharing
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 2007 proceedngs. Cooperatve Game Theory for Dstrbuted Spectrum Sharng Juan
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationThe 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 informationJoint Scheduling and Resource Allocation in CDMA Systems
TECHNICAL REPORT - JUNE 2009 1 Jont Schedulng and Resource Allocaton n CDMA Systems Vjay G. Subramanan, Randall A. Berry, and Rajeev Agrawal Expanded Techncal Report: A shorter verson of ths paper wll
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationConvexity 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 informationDUE to the global aspiration for energy saving and reduction. Relay Power Allocation in Auction-based Game Approach
Globecom 0 - Communcatons QoS, Relablty and Modellng Symposum Relay Power Allocaton n Aucton-based Game Approach Dan Wu, Yuemng Ca, Lang Zhou, and Joel Rodrgues Insttute of Communcatons Engneerng, PLA
More informationChapter - 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 informationAmiri 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 informationThe Value of Demand Postponement under Demand Uncertainty
Recent Researches n Appled Mathematcs, Smulaton and Modellng The Value of emand Postponement under emand Uncertanty Rawee Suwandechocha Abstract Resource or capacty nvestment has a hgh mpact on the frm
More informationJoint Scheduling of Rate-guaranteed and Best-effort Services over a Wireless Channel
Jont Schedulng of Rate-guaranteed and Best-effort Servces over a Wreless Channel Murtaza Zafer and Eytan Modano Abstract We consder mult-user schedulng over the downln channel n wreless data systems. Specfcally,
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationTime 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 informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 14, NO. 2, FEBRUARY
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 14, NO., FEBRUARY 015 809 The Sum-Capacty of the Ergodc Fadng Gaussan Cogntve Interference Channel Dana Maamar, Natasha Devroye, and Danela Tunnett Abstract
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationMultipath richness a measure of MIMO capacity in an environment
EUROEA COOERATIO I THE FIELD OF SCIETIFIC AD TECHICAL RESEARCH EURO-COST SOURCE: Aalborg Unversty, Denmark COST 73 TD 04) 57 Dusburg, Germany 004/Sep/0- ultpath rchness a measure of IO capacty n an envronment
More informationBook Title: Orthogonal Frequency Division Multiple Access. Editors
Book Ttle: Orthogonal Frequency Dvson Multple Access Edtors August 18, 2009 Contents 1 Schedulng and Resource Allocaton n OFDMA 1 1.1 Introducton.................................... 2 1.2 Related Work
More informationPsychology 282 Lecture #24 Outline Regression Diagnostics: Outliers
Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.
More informationEnergy-efficient Nonstationary Spectrum Sharing
1 Energy-effcent Nonstatonary Spectrum Sharng Yuanzhang Xao and Mhaela van der Schaar, Fellow, IEEE Abstract We develop a novel desgn framework for energyeffcent spectrum sharng among autonomous users
More informationPop-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 informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationJoint Scheduling and Resource Allocation in CDMA Systems
ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY 1 Jont Schedulng and Resource Allocaton n CDMA Systems Vjay G. Subramanan, Randall A. Berry, and Rajeev Agrawal Abstract We consder schedulng and resource
More informationOn the Correlation between Boolean Functions of Sequences of Random Variables
On the Correlaton between Boolean Functons of Sequences of Random Varables Farhad Shran Chaharsoogh Electrcal Engneerng and Computer Scence Unversty of Mchgan Ann Arbor, Mchgan, 48105 Emal: fshran@umch.edu
More informationMax-Min Criterion Still Diversity-Optimal?
Energy Harvestng Cooperatve Networks: Is the 1 Max-Mn Crteron Stll Dversty-Optmal? Zhguo Dng, Member, IEEE and H. Vncent Poor, Fellow, IEEE arxv:143.354v1 [cs.it] 3 Mar 214 Abstract Ths paper consders
More informationClosed form solutions for water-filling problems in optimization and game frameworks
Closed form solutons for water-fllng problems n optmzaton and game frameworks Etan Altman INRIA BP93 24 route des Lucoles 692 Sopha Antpols FRANCE altman@sopha.nra.fr Konstantn Avrachenkov INRIA BP93 24
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationOnline 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 informationA 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 informationDistributed 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 informationEEE 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