Joint Scheduling and Resource Allocation in CDMA Systems

Size: px
Start display at page:

Download "Joint Scheduling and Resource Allocation in CDMA Systems"

Transcription

1 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 allocaton for the downlnk n a CDMA-based wreless network. The schedulng and resource allocaton problem s to select a subset of the users for transmsson and for each of the users selected, to choose the modulaton and codng scheme, transmsson power, and number of codes used. We refer to ths combnaton as the physcal layer operatng pont (PLOP). Each PLOP consumes dfferent amounts of code and power resources. The resource allocaton task s to pck the optmal PLOP takng nto account both system-wde and ndvdual user resource constrants that can arse n a practcal system. In ths paper, we tackle ths problem as part of a utlty maxmzaton problem framed n earler papers that ncludes both schedulng and resource allocaton. In ths settng, the problem reduces to maxmzng the weghted throughput over the state-dependent downlnk capacty regon whle takng nto account the system-wde and ndvdual user constrants. We study ths problem for the downlnk of a Gaussan broadcast channel wth orthogonal CDMA transmssons. Ths results n a tractable convex optmzaton problem. We use a dual formulaton to study ths problem and obtan several key structural propertes. By explotng ths structure, we gve algorthms for fndng the optmal soluton wth geometrc convergence. V. G. Subramanan s wth the Hamlton Insttute, NUIM, Maynooth, Co. Kldare, Ireland, e-mal: vjay.subramanan@num.e. R. A. Berry s wth the Dept. of Electrcal Engneerng and Computer Scence, Northwestern Unversty, Evanston, IL 60208, USA, emal: rberry@eecs.northwestern.edu. R. Agrawal s wth the Advanced Networks and Performance Group, Motorola Inc., Arlngton Heghts, IL, USA, e-mal: rajeev.agrawal@motorola.com. The majorty of ths work was done whle V. G. Subramanan was wth the Mathematcs of Communcaton Networks Group, Motorola Inc. Hs work s also supported n part by SFI grants IN3/03/I346 and 07/IN.1/I901. The work of R. A. Berry was supported n part by the Northwestern-Motorola Center for Communcatons and NSF CAREER award CCR A prelmnary verson of ths paper was presented at the 2nd Workshop on Modelng and Optmzaton n Moble, Ad Hoc, and Wreless Networks (WOpt 04), Cambrdge, UK, March 24-26, 2004.

2 2 ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY I. INTRODUCTION Effcent schedulng and resource allocaton are essental components for enablng hgh-speed data access n wreless networks. In ths settng, schedulng s complcated due to the tmevaryng fadng of wreless channels. A varety of wreless schedulng approaches have been proposed that opportunstcally explot these temporal varatons to mprove the over-all system performance, e.g. [1] [20]. These approaches attempt to transmt to users durng perods when they have good channel qualty (and can support hgher transmsson rates), whle mantanng some form of farness among the users. Wreless schedulng approaches can be dvded nto two classes: () tme-dvson multplexed (TDM) systems, where a sngle user s transmtted to n each tme-slot, as n the HDR system (CDMA 1xEVDO) [21], [22], and () systems n whch the transmtter can smultaneously transmt to multple users n each tme-slot, by usng a combnaton of TDM and another multplexng technque such as CDMA or OFDMA. In the latter case, n addton to decdng whch users to schedule, the avalable physcal layer resources, such as bandwdth and power, must be dvded among the users. In ths paper, we consder the second class of systems, where CDMA s used to multplex users wthn a tme-slot. 1. Examples of ths type of system nclude the Hgh Speed Downlnk Packet Access (HSDPA) approach developed for W-CDMA [23, Chapter 11, pp ] or the 1x-EVDV approach for CDMA2000 [24]. In these systems, the physcal layer resources and nformaton rate assgned to a user are specfed by selectng the number of spreadng codes, the fracton of transmsson power, and the modulaton and codng scheme (MCS). We refer to a combnaton of these as the physcal layer operatng pont (PLOP). The man problem addressed n ths paper s to specfy the optmal PLOP at each schedulng nstant, whch n turn specfes the vector of user transmsson rates. Ths problem must be solved once every tme-slot (e.g., 2msec n HSDPA or 1.25 msec n 1x-EVDV), and so requres a computatonally effcent soluton. We consder ths n the context of the gradent-based schedulng framework presented n [1], [2]. In ths framework, n each tme-slot the objectve s to chose the transmsson rate vector that has the largest projecton onto the gradent of the 1 The model n ths paper also apples to OFDMA systems when each sub-channel that may be assgned to a user has the same channel state (ths may model a system n whch OFDMA sub-channels are formed by nterleavng tones from across the frequency band). A more detaled dscusson of such problems for OFDMA systems can be found n [25], [36]

3 ALTERNATE VERSION 3 total system utlty. The utlty s a functon of each user s throughput and s used to quantfy farness. Several such gradent-based schedulng algorthms have been studed for TDM systems, ncludng the proportonally far algorthm [22], whch s based on a log utlty functon. In [1], a larger class of utlty functons s consdered that allow effcency and farness to be traded-off. The problem consdered here can be vewed as fndng the maxmum weghted sum throughput for a downlnk (broadcast) channel, where the weghts are determned by the gradent of the utlty. Our soluton s general n that t also apples to other schedulng algorthms whch provde these weghts usng dfferent approaches. For example, these weghts could be based on queue sze nformaton as n the MaxWeght schedulng algorthms studed n [3], [4], [17], [26]. For the model studed here, the feasble rate regon s convex; hence, by varyng these weghts we can determne the boundary of ths regon. In related work, the problem of allocatng resources to maxmze the weghted sum capacty for the downlnk channel has been consdered from an nformaton theoretc perspectve n [28], [29]. Both of these works assume the use of optmal nformaton theoretc (mult-user) codng/decodng. 2 The work n [29] also consders several suboptmal transmsson strateges, such as approaches based on TDM, CDMA wthout multuser codng wth all users orthogonalzed and FDM; the focus n [29] s on dervng the long-term average throughputs over multple fadng states under a long-term average power constrant. Here, we focus on optmally allocatng resources for the specfc fadng state realzed n each schedulng tme-slot; the total power s constraned wthn each tme-slot as well. The problem wthn each tme-slot can be vewed as a specal case of the CDMA wthout multuser codng approach n [29] where the fadng s constant. However, focusng on ths case enables us to generate a much smpler optmal algorthm. We also take nto account addtonal per-user power and code constrants that are mposed by the capablty of each moble n a practcal system. 3 The algorthms n [29] also make use of specfc propertes of the functon a log(1+bx) that do not generalze wth the addton of these per-user constrants. 2 In the specal case of maxmzng the equal weght sum capacty n a flat fadng channel, the nformaton theoretc optmal approach s to transmt to only one user n each tme-slot [28] and hence, mult-user decodng s not requred. However, ths s not true f the users are not weghted equally or for other channel models, such a multple antenna channel. It also does not hold when addtonal per user constrants are present, as s the case here. 3 Moreover, these constrants may vary from moble to moble. For example, the ntal moble devces for HSDPA can receve up to 5 spreadng codes, whle future devces may be able to receve up to 15 spreadng codes.

4 4 ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY Smultaneously and ndependently of our work, 4 Kumaran and Vswanathan studed a smlar problem n [31]. They also consder the problem of maxmzng the weghted capacty wthn a tme-slot and derve several related structural characterstcs. We note that the work n [31] does not nclude per-user code constrants, but does contan an algorthm wth a per-user rate constrant. We begn wth formulatng the schedulng and resource allocaton problem n Secton II. Ths formulaton s based on a gradent-based schedulng approach from [1], [2], whch we also revew. By substtutng an analytcal formula relatng the rate, power, codes, and SINR, we obtan an analytcally tractable problem wth nce convexty propertes. In Sectons III-IV, we use a dual formulaton to study ths problem. We obtan analytc formulas for many of the quanttes of nterest. For others we have to resort to a numercal search (aded wth some heurstcs based on the structure of the problem). However, these numercal searches are n a sngle dmenson (due to the dual formulaton) rather than over the multdmensonal PLOP space. Also, thanks to the convexty of the problem, these algorthms converge geometrcally fast. Along the way we obtan key structural propertes of the optmal soluton ncludng: 1) A tght upper bound on the number of users scheduled as a functon of the per-user code constrants; when each user can use all the codes, ths bound mples at most two users wll be scheduled. 2) Gven a code assgnment, the optmal power allocaton s gven by a water-fllng algorthm, whch s modfed to take nto account the dfferent weghts assgned to each user and any per-user power constrants. 3) For a fxed code assgnment, the optmal water-level (Lagrange multpler) can be found n fnte tme. Specfcally, we gve an teratve algorthm whch wll termnate n at most M steps, where M s the number of users allocated codes. 4) For a gven water-level, the users that are scheduled are determned by smply sortng all the users based on a per-user metrc that s gven analytcally. 5) Codes are only tme-shared when tes occur n the above sort. Ths corresponds to a pont where the dual functon s not dfferentable. At these values the optmal tme-sharng can be found usng the subgradents of ths functon. We gve a complete characterzaton of 4 A verson of our work was frst presented n [30].

5 ALTERNATE VERSION 5 these subgradents. We conclude the paper wth smulaton results comparng ths algorthm wth a base-lne heurstc n Secton V. II. GRADIENT-BASED SCHEDULING AND RESOURCE ALLOCATION PROBLEM We consder the downlnk of a wreless communcaton system wth K users. The channel condtons are tme-varyng and modeled by a stochastc channel state vector e t = (e 1,t,..., e K,t ), where e,t represents the channel state of the th user at tme t. Assocated wth each channel state vector s a rate-regon R(e t ) R K +, whch ndcates the set of feasble transmsson rates r t = (r 1,t,..., r K,t ). Our pont of departure s the gradent-based schedulng framework n [1], [2]. In ths framework, at each schedulng nstant a rate vector r t R(e t ) s selected that has the maxmum projecton onto the gradent of a system utlty functon U(W t ), where U(W t ) = K U (W,t ), =1 and, for each user, U (W,t ) s a ncreasng concave utlty functon of the user s average throughput, W,t, up to tme t. In other words, the schedulng and resource allocaton decson s the soluton to max U(W t) T r t = r t R(e t) max r t R(e t) du (x) dx For example, one class of utlty functons gven n [1], [33] s c U (W,t ) = (W α,t) α, α 1, α 0, c log(w,t ), α = 0, r,t. (1) x=w,t where α 1 s a farness parameter and c s a qualty of servce (QoS) weght. In ths case, (1) becomes max r t R(e t) (2) c (W,t ) α 1 r,t. (3) Wth equal QoS weghts, α = 1 results n a maxmum throughput rule that maxmzes the total throughput durng each slot. For α = 0, ths results n the proportonally far rule.

6 6 ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY The precedng polcy can be generalzed to allow the utlty to depend on other parameters such as a user s queue sze or delay. For example, consder the utlty U (W,t, Q,t ) = c α (W,t) α d p (Q,t) p, where Q,t represents the queue length of user at tme t, d s a QoS weght for user s queue length and p > 1 s a farness parameter assocated wth the queue length. In ths case, (1) s replaced by 5 max r t R(e t) ( c (W,t ) α 1 + d (Q,t ) p 1) r,t. (4) Specal cases of ths polcy wth c = 0 have been shown to be stablzng polces n a varety of settngs [3], [4], [17], [26]. In [27] t was shown that for specfc choces of c and d ths polcy wll maxmze the total network utlty ( In general, we consder the problem max r t R(e t) c α (W,t) α ) subject to a network stablty constrant. w,t r,t, (5) where w,t 0 s a tme-varyng weght of the th user at tme t. In the precedng examples, these weghts are gven by the gradent of the utlty; however, other methods for generatng these weghts are also possble. We note that (5) must be re-solved at each schedulng nstant because of changes n both the channel state and the weghts (e.g., the gradent of the utlty). The former changes are due to the tme-varyng nature of the wreless channel, whereas the latter changes are due to new arrvals and past servce decsons. The soluton to ths problem depends on the state dependent capacty regon R(e t ), whch we assume s known at tme t. 6 In ths paper, we consder a model that s approprate for a CDMA system, such as HSDPA or 1xEVDV. Ths model s parameterzed by two sets of physcal layer parameters: the number of spreadng codes, n and the transmsson power p assgned to each user. Each choce of these parameters specfes a PLOP, whch must satsfy the followng 5 Note that we take the negatve of the gradent of the utlty wth respect to queue length. Ths s because the queue length s decreasng n the transmsson rate assgned to a user whle the throughput s ncreasng. 6 Whle, n a practcal system, the exact channel state wll not be perfectly known at the transmtter, some estmate of t s usually avalable, for example, va channel qualty feedback.

7 ALTERNATE VERSION 7 constrants: n N, (6) n N, (7) p P. (8) Here, (7) and (8) are system constrants on the total number of spreadng codes and the total system power, whle (6) s a per user constrant on the number of codes that can be assgned to user. We assume that the channel state e ndcates user s receved sgnal-to-nterference plus nose rato (SINR) per unt power, where we have suppressed the dependence on t for convenence. Furthermore, we assume that all spreadng codes are mutually orthogonal, so that the only nterference s from other cells. 7 In ths case, the SINR per code for user s gven by SINR = p n e. We model the achevable rate per code by r n = Γ(ζ SINR ). Here, Γ corresponds to the Shannon capacty for a Gaussan nose channel wth the gven SINR,.e., Γ(x) = B log(1+x), where B ndcates the symbol rate (.e., the chp rate/spreadng factor), and ζ (0, 1] s a scalng factor that can be used to model the gap from capacty n a practcal system. Ths s a reasonable model for systems that use sophstcated codng technques, such as Turbo codes. Redefnng e to be e ζ, the rate regon s then { ( R(e) = r 0 : r = n B log 1 + p ) e, n N, n n N, p P }. (9) Wthout the per-user code constrants, ths s equvalent to the achevable rate-regon obtaned n [29] for TDM, CDMA wthout multuser codng and FDM, where n each case the user s subject to constant fadng over the avalable degrees of freedom. Notce that n (9), we allow the number of codes per user to take on a non-nteger value. Of course, n a practcal system these must be nteger valued. However, we wll show that, n most cases, the soluton to ths relaxed problem results n nteger values for n. In [36] the analyss s generalzed to bgger class of functons. 7 In other words, f we neglect other cell nterference then e s smply the sgnal-to-nose rato (SNR) of user per unt power.

8 8 ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY We can now state the optmzaton problem n (5) as V := max (n,p) X V (n, p) [Prmal problem] where subject to: n N, p P, (10) V (n, p) := ( w n ln 1 + p ) e, (11) n X := {(n, p) 0 : n N }, (12) n s a vector of code allocatons, and p s a vector of power allocatons. We have normalzed the objectve by B/ ln(2) to smplfy notaton. Note that the constrant set X s convex. It can also be verfed that V s concave n (n, p). A. Addtonal Constrants In addton to (6)-(8), there may be several other constrants on the feasble PLOP n a practcal system. Ths ncludes the followng per user constrants:.) peak power constrant: p P,..) maxmum SINR (per code) constrant: SINR = p e n S p S n e,.) maxmum rate per code 8 constrant: ( r = ln 1 + p ) e (R/N) p (e (R/N) 1) n, n n e v.) mnmum rate per code constrant: ( r = ln 1 + p ) e n n (Ř/N) p (e (Ř/N) 1) n, e... 8 As n the prevous secton, we contnue to normalze the rate, r, by B/ ln(2).

9 ALTERNATE VERSION 9 v.) maxmum rate constrant: ( r = n ln 1 + p ) e n v.) mnmum rate constrant: r = n ln R p (e R /n 1) n e,. (13) ( 1 + p ) e n Ř p (eř/n 1) n, e These constrants can arse due to varous mplementaton consderatons. For example, a constrant on the rate per code s mposed by the maxmum or mnmum rate of the avalable modulaton and codng schemes: a modulaton order lmtaton usually results n the former and mnmum underlyng codng rate results n the latter. On the other hand, a maxmum rate constrant arses because there s only a fnte amount of data avalable to send to each moble at any tme. A mnmum rate constrant can be used to model the case where the system s tryng to guarantee a certan level of servce to that user. 9 All of the above constrants can be vewed as specal cases of a per user power constrant wth the form: SINR = p e n [š (n ), s (n )],, where the functon s (n ) s also dependent on the fxed (for a gven optmzaton problem) parameters P, S, e, R, (R/N), and the functon š (n ) s dependent on the parameters Ř, (Ř/N). Non-negatvty restrctons on power necessarly mply that š (n ) 0. We prmarly focus on two specal cases of ths: I. s (n ) s and š (n ) š do not depend on n, II. s (n ) s = and š (n ) s = 0. We refer to these as Type I and Type II per-user power constrants, respectvely. A Type I constrant models the case where there s a maxmum and mnmum constrant on the SINR or rate per code. A Type II constrant corresponds to no per-user power constrants. Wth the per user power constrants, the constrant set X s further restrcted to { š (n )n X := (n, p) 0 : n N, p s } (n )n,. e e. 9 Of course, wth mnmum rate and mnmum rate per code constrants the resultng optmzaton may be nfeasble, dependng on the other constrants and the channel states.

10 10 ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY The set X contnues to be convex f s (n )n s a concave functon of n and š (n )n s a convex functon of n. Note that s (n )n s ndeed concave for the two specal cases (I-II) mentoned above, as well as the case of a peak power constrant, and š (n )n s always convex n the prevous examples. Unless otherwse mentoned, we wll assume ths set s convex n the followng. For the maxmum rate constrant case (13), s (n )n s convex n n, and so the set X wll not be convex. However, one can stll get a convex formulaton [36] for ths case by nstead vewng the rate r as an addtonal optmzaton varable, so that the objectve s now to maxmze w r, where r s constraned to satsfy ( r n log 1 + p ) e, n and r [0, R ]. The fnal soluton n ths case s qute smlar to the analyss that follows n ths paper. However, to smplfy our dscusson we do not consder ths constrant here and smply focus on cases I and II above. In addton to these per user power constrants, there may also be a constrant on the maxmum number of users M scheduled n a tme-slot,.e., users wth postve code and power assgnments. 10 We wll prove later (see Lemma 4.9) that such a constrant wll n most cases automatcally be satsfed by the optmal soluton (assumng the selected users have enough data to send) as long as M 1 users can fully utlze the avalable code budget,.e., the sum of the N s for any subset of M 1 users s greater than or equal to N. For example, f N 5 for all and N 15, then no more than 4 users need to be scheduled n any tme-slot under the optmal scheme. III. THE DUAL PROBLEM AND CONVEX OPTIMIZATION In ths secton we begn consderng the soluton to (10), whch determnes the users to be scheduled as well as the amount of power and the number of codes to be assgned to each user. We solve the optmzaton problem by lookng at the dual formulaton. The objectve s concave and snce the constrants are lnear, there wll be no dualty gap (see [34]). Ths allows us to use the soluton of the dual to compute the soluton of the prmal. 10 For example, n HSDPA such a constrant arses because the system cannot schedule more users than the number of shared control channels.

11 ALTERNATE VERSION 11 A. The Dual Problem Defne a Lagrangan for the prmal problem (10) by L(n, p, λ, µ) := ( w n ln 1 + p ) ( e + λ P n The correspondng dual functon s p ) + µ ( N n ). (14) The dual problem s then gven by: L(λ, µ) := max L(n, p, λ, µ). (15) (n,p) X L := mn L(λ, µ) [Dual problem]. (16) (λ,µ) 0 Also, wth some further abuse of notaton, we defne L(λ) := mn µ 0 L(λ, µ) = mn µ 0 B. Results from dualty and convex programmng max (n,p) X L(n, p, λ, µ). (17) From standard convex programmng (see, e.g., Propostons and of [34]), we have the followng: Proposton 3.1: The dual functon L(λ, µ) s convex over the set {(λ, µ) 0} and V L(λ) L(λ, µ), λ, µ 0. From the concavty of V and convexty of the doman of optmzaton, t s easy to verfy that Assumpton of [34] holds, and therefore, we have from Propostons 5.3.1, 5.1.4, and n [34] that Proposton 3.2: There exsts at least one soluton to the dual problem and there s no dualty gap. Any optmal dual soluton, (λ, µ ) satsfes V = L(λ, µ ). Furthermore, ((n, p ), (λ, µ )) s a par of optmal prmal and optmal dual solutons f and only f (n, p ) X, n N, p P Prmal Feasblty (18) (λ, µ ) 0 Dual Feasblty (19) (n, p ) = arg max (n,p) X L(n, p, λ, µ ) Lagrangan Optmalty (20) λ (P p ) = 0, µ (N n ) = 0 Complementary Slackness (21)

12 12 ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY IV. STRUCTURE OF THE PRIMAL AND DUAL PROBLEMS In ths secton, we gve several propertes of the dual problem n (16) and the correspondng prmal problem n (10). Frst, we compute the dual functon, L(λ, µ) n (15) for a gven λ and µ. We then keep λ fxed and optmze the dual functon over µ; ths gves us L(λ) n (17). We prove that L(λ) s convex and provde bounds on the optmal λ. Usng these propertes, the optmal λ can be found wth a one-dmensonal convex search that has geometrc convergence. We fnd prmal varables (n and p) that maxmze the Lagrangan for a gven λ and µ, and fndng the optmal prmal power allocaton for a gven n. A. Computng the dual functon To evaluate the dual functon, we proceed n two steps. Frst, we optmze the Lagrangan (14) over p, for a fxed λ, µ, and n. We then optmze over n to obtan the value of the dual functon. For the frst step, we defne the followng two projectons of the set X : for a gven n, let X n = {n 0 : n N, } and let X p (n) = {p : (n, p) X }. Then we have: Lemma 4.1: For a fxed n X n and any λ 0 and µ 0, the power allocaton p X p (n) that maxmzes L(n, p, λ, µ) s gven by p = n ( s w e ) e λ, s (n ), š (n ), (22) where s ( w e, s λ (n ), š (n ) ) := max { mn {( w e 1), s λ (n ) }, š (n ) }. Ths lemma follows drectly from the Kuhn-Tucker condtons for the optmzaton problem. Note that the mn s not needed for Type II per user power constrants,.e., s (n) =. However, the maxmum s stll necessary even f š (n ) = 0, to restrct attenton to non-negatve power values. The soluton can be vewed as a modfed verson of a water-fllng power allocaton across the users [32], where the water-level s modfed to take nto account each users weght, w, and the per-user power constrants are also taken nto account. In the case of a Type I peruser power constrant (s (n ) s and š (n ) š ), the resultng SINR per code for a fxed λ, µ, and n s gven by p e n ( = s w e ) ( λ, s (n ), š (n ) = s w e ) λ, s, š, (23) whch does not depend on the number of codes n. It follows that, n the Type I case, for a gven λ the total power allocated to a user scales lnearly n the number of codes.

13 ALTERNATE VERSION 13 2 p*, type I constrant p*, type II constrant λ Fg. 1. An example of the optmal power allocaton, p n (22) as a functon of λ for both a Type I and type II power constrant. An example of p as a functon of λ s shown n Fg. 1 for both a Type I and Type II constrant. The horzontal segments of p under the Type II constrant correspond to when the maxmum and mnmum per user power constrants are actve; when these are not actve, the two curves overlap. Substtutng (22) nto the Lagrangan we have L(n, p, λ, µ) = ( ) ( w n ln 1 + p e + λ P n p ) ( + µ N n ) (24) = (w n h(w e, s (n ), š (n ), λ) µn ) + λp + µn, (25) where ln(1 + š (n )) h(w e, s (n ), š (n ), λ) := λ w e 1 ln λ w e, λ w e š (n ), λ w e 1+š (n ), w e 1+s (n ) λ < w e 1+š (n ), (26) ln(1 + s (n )) λ w e s (n ), λ < w e. 1+s (n )

14 ? 14 ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY 4!"$#&%''(')$*+#, -..'!"$#&%''(')$*+#, 3 /+#0 ' >575 9;:@? < 5 E4>57F5 9;:=< 5 9;:@? < 5 ACB.D < 5 GIH JKH λ Fg. 2. An example of h(w e, s, š, λ) as a functon of λ under a Type I and Type II power constrant. Notce that for a Type I per-user power constrant, h(w e, s (n ), š (n ), λ) = h(w e, s, š, λ) also does not depend on n. For a Type II per-user power constrant, 11 [ ( )] λ λ h(w e, s, š, λ) = 1 ln 1 {w e w e w e >λ}. An example of h(w e, s, š, λ) as a functon of λ s shown n Fg. 2 for both a Type I and Type II per-user power constrant. In both cases w e = 5. When w e 1+s λ w e 1+š the two curves overlap. For λ < w e 1+s, h grows wthout bound under a Type II constrant, whle t s lnear n ths range under a Type I constrant. For λ > w e 1+š, h decreases lnearly under a Type II constrant, whle under a Type I constrant t converges to 0 at λ = w e. For a Type II constrant, h crosses the x-axs at λ = ln(1+š )w e š. In ether of these cases, snce (25) s lnear n n, t s straghtforward to optmze over n. Lemma 4.2: Wth a per-user power constrant of Type I or II, the vector of code allocatons, n, that maxmzes (25) s gven by 0, µ n (λ) < µ, = N, µ (λ) > µ, (27) 11 Here the notaton 1 X denotes the ndcator functon of the event X.

15 ALTERNATE VERSION 15 where µ (λ) = w h(w e, s, š, λ). (28) If µ = µ (λ), every choce of n such that 0 n N maxmzes the Lagrangan. In other words, gven µ, the optmal code allocaton s determned for each user by checkng f µ (λ) s greater than or less than µ. The last part of ths lemma follows because when µ = µ (λ), (25) s not dependent on n. Usng (27) we have 12 ( ) w n ln 1 + p e λp n µn = [µ (λ) µ] + N. Substtutng ths nto (25) yelds the followng characterzaton of the dual functon L(λ, µ). Lemma 4.3: Wth a Type I or II per-user power constrant, L(λ, µ) = [µ (λ) µ] + N + µn + λp. (29) B. Optmzng over µ We now turn to optmzng the dual functon over µ. We restrct our attenton to ether a Type I or Type II per-user power constrant, so that the dual functon s gven by (29). To begn, we sort the users n decreasng order of µ (λ) n (28), where tes are broken arbtrarly. Assume that the users are numbered correspondng to ther poston n ths orderng,.e. so that µ (λ) µ +1 (λ) for all. 13 Let j 1 be the largest nteger such that µ j 1(λ) 0 and j 1 =1 N < N. If no such user can be found, set j = 1. Note that f š = 0 for all, then µ (λ) 0 for all, n whch case j wll be the frst user that would fll up the total code budget f all users receved ther maxmum per-user code allocaton. By conventon set µ K+1 (λ) = 1 [µ K (λ)], where [x] = [ x] +. Let N j := N j 1 =1 N. Lemma 4.4: Wth a Type I or Type II per-user power constrant, L(λ) := mn µ 0 j 1 L(λ, µ) = =1 and the mnmzng µ s gven by µ (λ) := [µ j (λ)] +. µ (λ)n + [µ j (λ)] + N j + λp, (30) 12 We use the notaton [x] + = max(x, 0). 13 Of course, as λ changes ths orderng wll change, n whch case we must re-number the users.

16 16 ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY µ 1 (λ) µ 2 (λ) µ 3 (λ) µ 4 (λ) λ Fg. 3. An example of µ (λ) for a system wth K = 4 users and a Type I per-user power constrant. Proof: For µ (λ) < µ < µ 1 (λ), from (29) t can be seen that the dervatve of L(λ, µ) n µ s gven by N 1 j=1 N. Hence, j s the largest nteger for whch L(λ, µ) wll be ncreasng n the correspondng nterval,.e., L(λ, µ) wll be ncreasng f and only f µ > µ j (λ). The lemma then follows. From Lemma 4.2, µ s a threshold separatng the users that get ther full code allocaton from the users that get allocated no codes. As µ s decreased, more users wll be allocated ther full code allocaton. Lemma 4.4 shows that the threshold µ (λ) that mnmzes the dual functon s such that the full code budget s utlzed. Fgure 3 shows an example of the curves µ (λ) as a functon of λ for a system wth K = 4 users, under a Type I per-user power constrant. Also ndcated on the fgure are the values of λ for whch each curve µ (λ) crosses the x-axs. Consder the case where N = N for all. In ths case, j = 1 (.e. the user wth the maxmum value of µ (λ) for the gven value of λ. Therefore, for λ < ln(1+š 2)w 2 e 2 š 2, µ (λ) wll be the upper envelope of the curves shown n the fgure. For λ > ln(1+š 2)w 2 e 2 š 2 all of the µ (λ) wll be less than 0 and so µ (λ) = 0. Remark: When w w j, e > e j, and s s j then t can be shown that µ (λ) µ j (λ), for all λ. It follows that n ths case, user wll be always be gven a full code allocaton

17 ALTERNATE VERSION 17 before allocatng any codes to user j. Furthermore, assume the schedulng rule s the maxmum throughput verson of (3),.e. the case where α = 1 and the class weghts are all equal, so that the w s are constant and dentcal across users. In ths case, (stll assumng that f e > e j then s s j ) packng users nto the code budget n order of decreasng e s s optmal. C. Fndng a Lagrangan Optmal Prmal Soluton. We next consder fndng prmal values (n, p ) such that (n, p ) = arg max (n,p) X L(n, p, λ, µ (λ)) (31) for a gven λ 0. Here, µ (λ) s the optmal µ gven by Lemma 4.4. Gven the optmal λ = λ, then from Proposton 3.2, such an (n, p ) wll be an optmal soluton for the prmal problem f t also satsfes prmal feasblty (18) and complmentary slackness (21). We gve a procedure for selectng such a par n the followng. If the λ λ, ths procedure can also be used to fnd a canddate feasble ñ. In the next secton, we construct a feasble p correspondng to ñ. From Proposton 3.1, we have 14 V V (ñ, p) L(λ) V (ñ, p). We contnue restrctng our attenton to Type I or II per-user power constrants. From the results n Sectons IV-A and IV-B, t can be seen that a soluton to (31) s equvalent to fndng and settng p as n Lemma 4.1. n = arg max {n X } (µ (λ) µ (λ)) + n, (32) As n the prevous secton, we agan assume that the users are ordered n decreasng order of µ (λ) so that µ (λ) = µ j (λ). When 15 µ j 1(λ) > µ j (λ) > µ j +1(λ) and µ j (λ) 0, then there s a unque feasble n that optmzes (32) and satsfes µ (λ)(n n ) = 0. Ths s gven by N, < j, N n j =, = j and µ (λ) 0, (33) 0, = j and µ (λ) = 0, 0, > j. 14 Ths can be used as a stoppng crteron n a practcal teratve algorthm. 15 Recall that by conventon µ K+1(λ) = 1 [µ K].

18 18 ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY Note that ths soluton wll always satsfy n N, wth equalty f µ (λ) > 0. Also note that n n (33) s always an nteger code allocaton. Defnton 4.1: [35, Prop. 8.12, p. 308] A vector d R M s a subgradent of a proper, convex functon F : R M [, + ] (wth doman Dom(F ) := {x R M : F (x) R}) at x Dom(F ) f F ( x) F (x) + ( x x) T d, x Dom(F ). The set of all subgradents of F at x s denoted by F (x). Proposton 4.1: Let (ˆn, ˆp) be a soluton to (31) for a gven λ whch satsfes ˆn N, and µ (λ)(n ˆn ) = 0. Then P ˆp s a subgradent of L(λ) at λ. Proof: Usng the defnton of µ (λ) we have L( λ) = L( λ, µ ( λ)) = max L(n, p, λ, µ ( λ)) (n,p) X L(ˆn, ˆp, λ, µ ( λ)) = V (ˆn, ˆp) + λ(p ˆp ) + µ ( λ)(n ˆn ) V (ˆn, ˆp) + λ(p ˆp ) (34) = V (ˆn, ˆp) + λ(p ˆp ) + ( λ λ)(p ˆp ) = L(λ) + ( λ λ)(p ˆp ). (35) The nequalty n (34) follows because N ˆn 0 and µ ( λ) 0; equalty n (35) holds because µ (λ)(n ˆn ) = 0. Note that the code allocaton gven by (33) and the correspondng power allocaton n Lemma 4.1 satsfy the assumptons of Proposton 4.1 and so provde a subgradent of L(λ). Later n Corollary 4.1, we show that all subgradents of L(λ) can be found n ths way. When there s a te and more than one µ j (λ) = µ (λ), then there may be multple n that optmze (32) and satsfy µ (λ)(n n ) = 0 and n N. There wll also be multple

19 ALTERNATE VERSION 19 canddates for n f there s no te, but µ j = However, for the optmal λ, every such n may not result n a power allocaton that s feasble and satsfes complmentary slackness. For an arbtrary λ, dfferent choces of n wll result n dfferent subgradents for L(λ). Next, we examne resolvng such tes. Frst, we show how to resolve these tes to fnd the maxmum and mnmum subgradents of L(λ). 17 Let there be l 0 users wth < j and k 1 users wth j whose µ (λ) are ted wth µ j (λ), where l + k 1,.e., 18 µ j l 1(λ) > µ j l(λ) = µ j (λ) = µ j +k 1(λ) > µ j +k(λ). Let I λ = [j l, j + k 1] denote the set of these users. The objectve n (32) wll not depend on n, for I λ. Note that the orderng of these users based on µ (λ) s arbtrary. Frst we consder resolvng ths te to fnd the maxmum subgradent of L(λ) at λ. It follows from Lemma 4.1 and Corollary 4.1 that ths s the soluton to the followng lnear program (LP): max P res ( s w e ) {n I λ } λ, s n, š e I λ [LPmax] subject to: 0 n N, I λ n N res, I λ µ (λ)(n res I λ n ) = 0. Here, P res := P ( <j l s w e, s ) λ, š N e and N res := N <j l N are the resdual power and codes avalable for the users n the te. The mnmum subgradent can also be found va a LP gven by mn P res ( s w e ) {n I λ } λ, s n, š. e I λ subject to the same constrants as n LPmax. [LPmn] The structure of these lnear programs permts a smple greedy soluton. For LPmax, f µ (λ) = 0, then the soluton to LPmax s clearly to assgn ˆn = 0 for all I λ. Otherwse, f µ (λ) > 0, 16 It can be seen that f š = 0, then the case of µ j (λ) = 0 s trval because user j wll not receve any power regardless of ts code allocaton. 17 That these are ndeed the maxmum and mnmum follows from Corollary The case where l + k = 1 captures the stuaton where there are no tes and µ j = 0.

20 20 ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY order the users n I λ n ncreasng order of s ( w e, s ) λ, š 1 e. Let ˆΘ : I λ I λ be a permutaton of I λ accordng to ths orderng, so that f s ( w e, s ) λ, š 1 e < s ( w j e j, s ) λ j, š 1 j e j, then ˆΘ() < ˆΘ(j). For LPmn, we nstead order the users n decreasng order of s ( w e λ, s, š ) 1 e and denote ths orderng by the permutaton ˇΘ. Let ĵ be the smallest nteger such that ĵ =j l N ˆΘ 1 () N res; f no such nteger exsts, set ĵ = j + k 1. Let ǰ denote the correspondng nteger usng the ˇΘ orderng. For I λ, set N, ˆΘ() < ĵ, ˆn = N, ˆΘ() = ĵ, 0, ˆΘ() > ĵ, where N ˆΘ 1 (ĵ) = mn{n res ĵ 1 =j l N ˆΘ 1 (), N ˆΘ 1 (ĵ) }. Let ň denote the correspondng code allocaton usng the ˇΘ orderng. Lemma 4.5: The code allocaton ˆn n (36) solves LPmax for µ (λ) > 0; the correspondng code allocaton ň solves LPmn, for all values of µ (λ). When µ (λ) = 0, the soluton to LPmax s ˆn = 0 for all I λ. The proof of ths lemma follows from a smple nterchange argument. Fndng both of these solutons nvolves a sort over the users nvolved n a te, and thus each have a complexty of O( I λ log( I λ )). Typcally, f a te occurs, only a small number of users wll be nvolved. Indeed, assumng the parameters w and e are ndependently chosen accordng to an absolutely contnuous dstrbuton, then wth probablty one a te wll not nvolve more than two users. Gven the soluton to LPmax n (36), let N, < j l, n = ˆn, j l ˆΘ() j + k 1, 0, j + k. denote the correspondng complete code allocaton. In two specal cases, ths wll be a prmal optmal code allocaton. Lemma 4.6: The par (n, p ) gven by (37) and (22) are a prmal optmal soluton f ether 1) λ = 0 and LPmax has a non-negatve soluton, 2) The soluton to LPmax s zero. Ths lemma follows drectly from notng that n both of these cases, the soluton wll satsfy both the complmentary slackness and prmal feasblty condtons n Prop Note that when (36) (37)

21 ALTERNATE VERSION 21 λ = 0, s ( w e, s λ, š ) = s for all, 19 and thus the ˆΘ-orderng corresponds to sortng the users based on s e. A correspondng code allocaton can be defned based on ˇΘ and ň ; f ths results n a soluton to LPmn of zero, then t wll also be prmal optmal. If the soluton to LPmax s negatve, then all the subgradents of L(λ) at λ wll be negatve. Lkewse, f the soluton to LPmn s postve, then all the subgradents wll be postve. However, f LPmax has a postve soluton and LPmn has a negatve one, then L(λ) wll have a zero subgradent at λ; a feasble code allocaton correspondng to ths zero subgradent wll be prmal optmal. In ths case, there must exst an α [0, 1] such that ( ) ( ) ( w e ) α λ, s ˆn ( w e ), š + (1 α) e λ, s ň, š e I t s Solvng for α above, set I t s = P res. ñ = αˆn + (1 α)ň (38) for all I t and let n denote the correspondng complete code allocaton as n (37). Lemma 4.7: If the soluton to LPmax s postve and the soluton to LPmn s negatve, then n constructed usng (38) and the correspondng p are a prmal optmal soluton. Once agan, ths follows from notng that by constructon the code and power allocatons satsfy the assumptons n Prop Ths gves a prmal optmal soluton; but dependng on the number of users nvolved n the te, t may not be the prmal soluton wth the mnmum number of users scheduled. As dscussed n Sect. II-A, n practce there may be constrants on ths number. The next lemma gves an upper bound on the mnmum number of users scheduled n an optmal soluton. Usng typcal parameter values for a HSDPA system, ths bound wll be no greater than 4. Lemma 4.8: For a Type I or II power constrant, an optmal code allocaton can always be found such that at most N/N mn + 1 users wll be scheduled, where N mn := mn N. Proof: At the optmal λ, f the condtons n Lemma 4.6 are satsfed then the code assgnment n (37) s optmal and wll result n no more than N/N mn + 1 users scheduled. Therefore, we need only consder the case where these condtons are not satsfed,.e., λ > 0 and the soluton to LPmax s strctly greater than Ths wll arse only wth a Type I power constrant.

22 22 ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY When λ > 0, from complementary slackness and Prop. 4.1, a prmal optmal code allocaton must result n a zero subgradent of L(λ). Such a code allocaton s a soluton to the followng feasblty problem: maxmze n 1 subject to: P 1 ( n s w e ) e λ, s, š = 0 n = N 0 n N,. Ths s a LP and the feasble set s a K dmensonal bounded polyhedron. 20 By Lemma 4.7, ths polyhedron s non-empty,.e. the LP has a soluton. However, the soluton gven n Lemma 4.7 may result n more than N/N mn + 1 users scheduled. In ths case, we show that ths LP must have another soluton wth the desred property. In partcular, t must have an extreme pont soluton; we consder such an extreme pont code allocaton. At an extreme pont, at least K constrants must be bndng, two of whch are the two equalty constrants. Ths means that at least K 2 users must have n set equal to ether 0 or N and so at most 2 users wll have a fractonal code assgnment. Frst, assume N/N mn s an nteger. If N/N mn users have n = N, then clearly to satsfy the second constrant, no other users can have postve code allocatons. Lkewse, f no more than N/N mn 1 users have n = N, then from the above argument at most N/N mn = N/N mn + 1 users wll have a postve code allocaton. Smlarly, f N/N mn s not an nteger, then at most N/N mn 1 users can have n = N to satsfy the second equalty, and so at most N/N mn + 1 users wll have a postve code allocaton. Though n general (37) may result n more than N/N mn + 1 users beng scheduled, n several key specal cases ths soluton wll also nvolve no more N/N mn + 1 users. Ths s useful n practce, snce determnng the soluton n (37) s less complex than solvng the LP n the proof of Lemma Lemma 4.9: For a Type I or II power constrant, the code allocaton n (37) results n no more than N/N mn + 1 users beng scheduled n ether of the followng cases: 20 Note, for convenence we formulate ths LP as a functon of all K users nstead of just the I λ users nvolved n the te. 21 Solvng ths nvolves lstng all the extreme ponts and determnng the one that works.

23 ALTERNATE VERSION 23 1) At most two users are nvolved n a te; 2) For all users I λ, N N res. The second condton n ths lemma mples that the per-user code constrants wll be nactve for any soluton to LPmax or LPmn. 22 In ths case, the soluton to LPmax and LPmn wll nvolve one user each and the combnaton n (38) wll nvolve only these two users. 23 Note that when N = N, ths condton wll always be satsfed. Based on the above dscusson, we outlne a procedure for fndng a prmal feasble n gven an arbtrary λ. Ths can be used to construct a feasble soluton n a sub-optmal algorthm, whch does not fnd the optmal λ. Te breakng rule: 1) Solve LPmax, f the soluton s non-postve, or λ = 0, resolve the te usng ˆn. 2) Otherwse, solve LPmn, a) If the soluton s negatve use ñ n (38) to resolve the te, b) otherwse use ň. For a gven λ, we denote by n (λ) the code allocaton gven by usng ths te breakng rule. If the optmal choce of λ s used, n (λ) wll be an optmal code allocaton. Otherwse, t s the allocaton that corresponds to the mnmum postve subgradent (f all subgradents are postve) or the maxmum negatve subgradent (f all subgradents are negatve). D. Optmzng the power allocaton In ths secton, we consder the optmal prmal power allocaton, p, gven a fxed non-negatve code allocaton n,.e., we want to solve V (n) := max V (n, p) p X p(n) subject to: p P. Ths can be solved by fndng λ (n) usng the dual formulaton and then computng the optmal p (n) as n Lemma 4.1. We note that the results n ths secton are not restrcted to Type I or (39) 22 In practcal systems, ths condton wll often be satsfed. For example, n a HSDPA system wth N = 15 and N = 15 or 10, then ths condton wll always be satsfed. 23 If µ (λ) = 0, then the soluton of LPmax wll nvolve zero users, and the combnaton n (38) wll nvolve only one user.

24 24 ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY Type II per user power constrants but wll hold for any reasonable per-user constrants. 24 not just those dscussed n Secton II-A. Wthout loss of generalty, we remove any users wth zero code allocatons. Let M be the number of remanng users wth postve code allocaton, and assume these are numbered = 1,..., M. We frst need to check f the problem s nfeasble,.e., f M =1 p mn := n e š (n ) P. If ths s the case, then (39) wll have no feasble solutons. We also check f the sum power constrant s nactve,.e., M =1 p max := n e s (n ) P. If ths s the case, the optmal power allocaton s smply p = n e s (n ). Henceforth, we assume the problem s feasble and the power constrant s actve. In ths case, the sum power constrant must be satsfed wth equalty for the optmal powers, otherwse at least one of the powers can be ncreased resultng n a larger value of the objectve functon. We can now construct a Lagrangan for (39) as M ( L n (p, λ) := w n ln 1 + p ) ( e + λ P n =1 p ). (40) Notce that f µ(n n ) = 0, L n (p, λ) wll be equal to the orgnal Lagrangan n (14). The dual functon correspondng to (40) s gven by L n (λ) := max L n(p, λ). (41) p X p(n) Also, note that when optmzng over powers, the constrant set s always convex regardless of the functon s (n )n. Maxmzng L n (p, λ) over p s essentally the same as the problem for L(p, n, λ, µ) covered n Secton IV-A. The optmal p s gven by (22) as before. Substtutng ths nto (41) yelds L n (λ) = M w n h(w e, s (n ), š (n ), λ) + λp. =1 24 By reasonable constrants we refer to constrants such that 0 š (n ) s (n ).

25 ALTERNATE VERSION 25 From basc convex optmzaton theory, we know that L n (λ) s convex n λ. Furthermore, t can be shown that L n (λ) s contnuously dfferentable n λ. To see ths note that from (26), for each, d h(w e, s (n ), λ) d λ = š(n ) w e, 1 w e 1, λ w e 1+š (n ) λ, w e 1+s (n ) λ < w e 1+š (n ), s (n ) w e, λ < w e 1+s (n ), whch s contnuous n the three ntervals as well as at the two break ponts. Ths allows us to conclude that L n (λ) s mnmzed by the set ponts at whch the dervatve s zero. Note that for each user, (42) s constant n two of the three ntervals; hence, t s possble that there are multple ponts at whch the dervatve s zero. The followng lemma gves an alternatve characterzaton of the λ whch mnmzes L n (λ). Let a and b be the two break ponts for each user = 1,..., M,.e., a := w e 1+s (n ), and b = w e 1+š (n ). Lemma 4.10: A λ > 0 s the soluton to the dual problem mn λ 0 L n (λ) f and only f λ = n w 1 [a,b )(λ) P ( ), n (43) s e (n )1 [0,a )(λ) š (n )1 [b, )(λ) + 1 [a,b )(λ) where, by conventon, f numerator and denomnator of the rght-hand sde are both zero, then we set ths equal to λ. Proof: Note that whle the optmal λ may not be unque, the set of optmzers must form an nterval by the convexty of L n (λ). Snce for any gven λ, the p that maxmzes the Lagrangan s unque, t follows from complementary slackness that λ > 0 s optmal f and only f the correspondng p satsfes p = P. Substtutng n p from (22) we have that λ > 0 s optmal f and only f n ( w e e λ 1)1 [a,b )(λ) + n e s (n )1 [0,a )(λ) + (42) n e š (n )1 [b, )(λ) = P. (44) The desred result then follows from smple algebra. Note that f the rght-hand sde of (43) s 0, then the frst term on the left-hand sde of (44) must be zero. Ths corresponds to all users 0 ether beng assgned ther maxmum or mnmum ndvdual power, n such a way that the total power constrant s exactly met. Such a power allocaton, wll not depend on small varatons n λ, provded that λ does not enter a new nterval n (42) for some user Indeed, t follows that ths s the only case n whch the optmal λ s not unque.

26 26 ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY Let λ (n) denote an optmal value of λ for a gven code allocaton, and let p (n) denote the correspondng optmal power allocaton gven by (22). Ths lemma says that f λ (n) > 0, t must satsfy (43). Next we show that a soluton to ths equaton can be found n fnte-tme. Sort the set {a, b = 1,..., M} nto a decreasng set of numbers {x[l]; l = 1,..., 2M}, where tes are resolved arbtrarly. For l = 1,..., 2M, let P sum [l] denote the total power p where p s gven by (22) wth λ = x[l]. Let l be the smallest value of l such that P sum [l] P. (Assumng that λ (n) > 0 such an l must exst.) Lemma 4.11: For a gven n, f the sum power constrant s actve, 26 an optmal λ (n) can be found n fnte-tme and s gven by the rght-hand sde of (43) wth λ = x[l ]. Proof: Note that as λ decreases, the rght-hand sde of (43) s rght-contnuous and only changes values when λ = x[l], l = 1,..., 2M. (Durng any nterval when the rght-hand sde s 0, by our conventon, the value changes contnuously n λ; but ths does not effect the followng 0 argument.) Hence, an optmal λ must be gven by evaluatng the rght-hand sde of (43) wth λ = x[l] for some l = 1,..., 2M. Also, note that as λ decreases, the total power, p s ncreasng. By assumpton the sum power constrant s actve at the optmal soluton. Thus, we have x[l 1] > λ (n) x[l ]. Combnng these observatons, the lemma follows. The dea behnd ths lemma s llustrated n Fg. 4, whch shows an example where only two users have postve code allocatons. The optmal power allocaton for each user, p from (22) s shown as a functon of λ, as well as the total power p 1 + p 2. In ths example, for a total power of P, x[l ] = a 1, and the optmal λ can then be calculated usng Lemma Lemma 4.11 provdes an algorthm for solvng (43) by calculatng P sum [l] startng wth l = 1 and stoppng when the total power constrant s volated. Also, note that wth the above orderng, the rght-hand sde of (43) can be recursvely calculated as l ncreases. The algorthm complexty s O(M log M) due to the sort of {x[l]}. Recall, M s the number of users wth postve code allocatons. As dscussed after Lemma 4.9, ths wll typcally be on the order of 1-4. Also, note that under a type II per-user power constrant, a = 0. Thus wth no per-user power constrants, 26 We make ths assumpton for smplcty of exposton. The algorthm can easly be modfed to take nto account the case where ths constrant s not actve and wll stll complete n fnte tme.

27 ALTERNATE VERSION p* 1 (λ) p* 2 (λ) p* 1 (λ)+p* 2 (λ) 3 P a a b b 2 λ Fg. 4. Example llustratng Lemma only the M values of x[] correspondng to the b s need to be consdered n the above search, and a smpler algorthm results. E. Optmzng the dual over λ Recall, L(λ) s the mnmum of the dual functon over µ 0. The soluton to the dual problem, L s thus gven by L = mn λ 0 L(λ). We consder ths problem and several characterstcs of L(λ) n the followng. Frst we show that L(λ) s convex n λ. 27 Lemma 4.12: Wth a Type I or Type II per-user power constrant, L(λ) s convex n λ. Proof: From Lemma 4.4, L(λ) = j 1 =1 µ (λ)n + [µ j (λ)] + N j + λp, 27 Ths lemma also follows from Prop. 4.1, snce a functon wll only have a subgradent at every pont f t s convex. Here we gve an alternatve proof that does not rely on subgradents.

28 28 ACCEPTED TO IEEE TRANSACTIONS ON INFORMATION THEORY where the users are re-ordered accordng to µ (λ) for each λ. Ths can be re-wrtten as: L(λ) = max µ (λ)n + λp n N where, N = { n : = max n N L n(λ), (45) n N, 0 n N, We have already establshed n Sect. IV-D that for each n, L n (λ) s convex n λ. Snce the maxmum of a set of convex functons s also convex, t follows that L(λ) s convex. In (45), L(λ) s expressed as the maxmum of an nfnte number of the functons L n (λ). Next we show that n fact only a fnte number of such functons are needed to characterze L(λ), e.g. where N Π } L(λ) = max n N Π L n (λ) (46) s a fnte subset of N. Specfcally, from Lemma 4.4, t follows that for each permutaton of the users, we only need to consder a sngle greedy code allocatons whch uses all the codes,.e. a code allocaton as n (33) that sequentally assgns each user the maxmum feasble number of codes untl the code budget s full. We can then set N Π to be the set of such code allocatons, one for each permutaton. Now we turn to fndng the optmal λ. From Lemma 4.12, ths s the mnmum of an unvarate convex functon, and so t can be found by usng a one-dmensonal convex search technque, such as the bsecton method or a Fbonacc search [34]. Also note that, from (22) f λ > ln(1+š ) š w e, then user wll be allocated zero power. Therefore the optmal λ, must satsfy 0 λ ln(1 + š ) max w e max w e. (47) These bounds provde a startng pont for the algorthms consdered n the next secton. š As noted n Secton IV-D, L n (λ) s contnuously dfferentable. From (46), we then have: Lemma 4.13: Wth a Type I or II per user power constrant, L(λ) s dfferentable for all λ for whch there exsts a unque n N Π, wth L n (λ) = L(λ). When there s not a unque n N Π, ths s exactly the te case dscussed n Secton IV-C. Ths s llustrated n Fg. 5. Shown are three curves L n (λ) correspondng to dfferent code allocatons; L(λ) s the upper envelope of these curves whch s shown n bold. L(λ) s dfferentable, except for at the two ndcated places where a te occurs. At the te values, the dervatves of the L n (λ).

Joint Scheduling and Resource Allocation in CDMA Systems

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

Joint Scheduling and Resource Allocation in CDMA Systems

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

Joint Scheduling and Resource Allocation in CDMA Systems

Joint Scheduling and Resource Allocation in CDMA Systems SUBMITTED TO IEEE TRANSACTIONS ON INFORMATION THEORY 1 Jont Schedulng and Resource Allocaton n CDMA Systems Vjay Subramanan, Randall A. Berry, and Rajeev Agrawal Abstract We consder schedulng and resource

More information

ECE559VV Project Report

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

More information

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

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

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

Assortment Optimization under MNL

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

More information

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

Module 9. Lecture 6. Duality in Assignment Problems

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

More information

Book Title: Orthogonal Frequency Division Multiple Access. Editors

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

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

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

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

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

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals

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

COS 521: Advanced Algorithms Game Theory and Linear Programming

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

More information

Kernel Methods and SVMs Extension

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

More information

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

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

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

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

Lagrange Multipliers Kernel Trick

Lagrange Multipliers Kernel Trick Lagrange Multplers Kernel Trck Ncholas Ruozz Unversty of Texas at Dallas Based roughly on the sldes of Davd Sontag General Optmzaton A mathematcal detour, we ll come back to SVMs soon! subject to: f x

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

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

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

More information

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

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments

More information

More metrics on cartesian products

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

More information

Lecture 4: November 17, Part 1 Single Buffer Management

Lecture 4: November 17, Part 1 Single Buffer Management Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input

More 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

Real-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling

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

Economics 101. Lecture 4 - Equilibrium and Efficiency

Economics 101. Lecture 4 - Equilibrium and Efficiency Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of

More 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

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

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed

More information

NP-Completeness : Proofs

NP-Completeness : Proofs NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem

More information

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

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

More information

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

Lossy Compression. Compromise accuracy of reconstruction for increased compression.

Lossy Compression. Compromise accuracy of reconstruction for increased compression. Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost

More information

Foundations of Arithmetic

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

More information

VQ widely used in coding speech, image, and video

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

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Difference Equations

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

More information

Computing Correlated Equilibria in Multi-Player Games

Computing Correlated Equilibria in Multi-Player Games Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More 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

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

Generalized Linear Methods

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

More information

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

Welfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium? APPLIED WELFARE ECONOMICS AND POLICY ANALYSIS Welfare Propertes of General Equlbrum What can be sad about optmalty propertes of resource allocaton mpled by general equlbrum? Any crteron used to compare

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

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

More information

6.854J / J Advanced Algorithms Fall 2008

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

More information

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

Lecture 12: Discrete Laplacian

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

More information

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

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

More information

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-

More information

Perfect Competition and the Nash Bargaining Solution

Perfect Competition and the Nash Bargaining Solution Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange

More information

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

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

More information

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

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

More information

CSC 411 / CSC D11 / CSC C11

CSC 411 / CSC D11 / CSC C11 18 Boostng s a general strategy for learnng classfers by combnng smpler ones. The dea of boostng s to take a weak classfer that s, any classfer that wll do at least slghtly better than chance and use t

More information

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

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

More information

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

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

Technical Note: Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model

Technical Note: Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model Techncal Note: Capacty Constrants Across Nests n Assortment Optmzaton Under the Nested Logt Model Jacob B. Feldman, Huseyn Topaloglu School of Operatons Research and Informaton Engneerng, Cornell Unversty,

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

2.3 Nilpotent endomorphisms

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

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

Lecture 10 Support Vector Machines. Oct

Lecture 10 Support Vector Machines. Oct Lecture 10 Support Vector Machnes Oct - 20-2008 Lnear Separators Whch of the lnear separators s optmal? Concept of Margn Recall that n Perceptron, we learned that the convergence rate of the Perceptron

More information

An Interactive Optimisation Tool for Allocation Problems

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

More information

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

Supplementary Notes for Chapter 9 Mixture Thermodynamics

Supplementary Notes for Chapter 9 Mixture Thermodynamics Supplementary Notes for Chapter 9 Mxture Thermodynamcs Key ponts Nne major topcs of Chapter 9 are revewed below: 1. Notaton and operatonal equatons for mxtures 2. PVTN EOSs for mxtures 3. General effects

More information

Joint Scheduling and Power-Allocation for Interference Management in Wireless Networks

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

The Finite Element Method

The Finite Element Method The Fnte Element Method GENERAL INTRODUCTION Read: Chapters 1 and 2 CONTENTS Engneerng and analyss Smulaton of a physcal process Examples mathematcal model development Approxmate solutons and methods of

More information

Natural Language Processing and Information Retrieval

Natural Language Processing and Information Retrieval Natural Language Processng and Informaton Retreval Support Vector Machnes Alessandro Moschtt Department of nformaton and communcaton technology Unversty of Trento Emal: moschtt@ds.untn.t Summary Support

More information

Maximal Margin Classifier

Maximal Margin Classifier CS81B/Stat41B: Advanced Topcs n Learnng & Decson Makng Mamal Margn Classfer Lecturer: Mchael Jordan Scrbes: Jana van Greunen Corrected verson - /1/004 1 References/Recommended Readng 1.1 Webstes www.kernel-machnes.org

More information

4DVAR, according to the name, is a four-dimensional variational method.

4DVAR, according to the name, is a four-dimensional variational method. 4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The

More information

LECTURE 9 CANONICAL CORRELATION ANALYSIS

LECTURE 9 CANONICAL CORRELATION ANALYSIS LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of

More information

Formulas for the Determinant

Formulas for the Determinant page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More 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

x = , so that calculated

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

More information

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

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

More information

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

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

More information

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results. Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson

More information

Annexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances

Annexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton

More information

THE SUMMATION NOTATION Ʃ

THE SUMMATION NOTATION Ʃ Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the

More information

Section 8.3 Polar Form of Complex Numbers

Section 8.3 Polar Form of Complex Numbers 80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the

More information

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,

More information

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

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

More information

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

Report on Image warping

Report on Image warping Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.

More information

Integrals and Invariants of Euler-Lagrange Equations

Integrals and Invariants of Euler-Lagrange Equations Lecture 16 Integrals and Invarants of Euler-Lagrange Equatons ME 256 at the Indan Insttute of Scence, Bengaluru Varatonal Methods and Structural Optmzaton G. K. Ananthasuresh Professor, Mechancal Engneerng,

More information

Lecture 14: Bandits with Budget Constraints

Lecture 14: Bandits with Budget Constraints IEOR 8100-001: Learnng and Optmzaton for Sequental Decson Makng 03/07/16 Lecture 14: andts wth udget Constrants Instructor: Shpra Agrawal Scrbed by: Zhpeng Lu 1 Problem defnton In the regular Mult-armed

More information

Tornado and Luby Transform Codes. Ashish Khisti Presentation October 22, 2003

Tornado and Luby Transform Codes. Ashish Khisti Presentation October 22, 2003 Tornado and Luby Transform Codes Ashsh Khst 6.454 Presentaton October 22, 2003 Background: Erasure Channel Elas[956] studed the Erasure Channel β x x β β x 2 m x 2 k? Capacty of Noseless Erasure Channel

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

Portfolios with Trading Constraints and Payout Restrictions

Portfolios with Trading Constraints and Payout Restrictions Portfolos wth Tradng Constrants and Payout Restrctons John R. Brge Northwestern Unversty (ont wor wth Chrs Donohue Xaodong Xu and Gongyun Zhao) 1 General Problem (Very) long-term nvestor (eample: unversty

More information

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper

Games of Threats. Elon Kohlberg Abraham Neyman. Working Paper Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017

More information