Utility Maximization for Uplink MU-MIMO: Combining Spectral-Energy Efficiency and Fairness
|
|
- Baldric Parrish
- 5 years ago
- Views:
Transcription
1 EuCNC-MngtTech Utlty Maxmzaton for Uplnk MU-MIMO: Combnng Spectral-Energy Effcency and Farness Le Deng, Wenje Zhang, Yun Ru, Yeo Cha Kat Department of Informaton Engneerng, The Chnese Unversty of Hong Kong, Hong Kong School of Computer Scence, Mnnan Normal Unversty, Chna Shangha Advanced Research Insttute, Chnese Academc of Scence, Shangha, Chna School of Computer Engneerng, Nanyang Technologcal Unversty, Sngapore Emal: dl@e.cuhk.edu.hk, zhan@ntu.edu.sg, ruy@sar.ac.cn, asckyeo@ntu.edu.sg Abstract Drven by green communcatons, energy effcency (EE) has become a new mportant crteron for desgnng wreless communcaton systems. However, hgh EE often leads to low spectral effcency (SE), whch spurs the research on EE-SE tradeoff. In ths paper, we focus on how to the utlty n physcal layer for an uplnk mult-user multple-nput multpleoutput (MU-MIMO) system, where we wll not only consder EE-SE tradeoff n a unfed way, but also ensure user farness. We frst formulate the utlty maxmzaton problem, but t turns out to be non-convex. By explotng the structure of ths problem, we fnd a convexzaton procedure to convert the orgnal nonconvex problem nto an equvalent convex problem, whch has the same global optmum wth the orgnal problem. Then, we present a centralzed algorthm to solve the utlty maxmzaton problem, but t requres the global nformaton of all users. Thus we propose a prmal-dual dstrbuted algorthm whch consumes a small amount of overhead. Furthermore, we have proved that the dstrbuted algorthm can converge to the global optmum. Fnally, the numercal results show that our approach can both capture user dversty for EE-SE tradeoff and ensure user farness, and they also valdate the effectveness of our prmal-dual dstrbuted algorthm. Index Terms MU-MIMO, Spectral Effcency, Energy Effcency, Farness, Power Control, Prmal-Dual I. INTRODUCTION Among the total worldwde energy consumpton, communcaton networks have contrbuted ncreasngly from.% n 7 to.8% n, and ths proporton s antcpated to grow contnuously n the comng years []. Ths stmulates the fast development of green communcatons recently []. Compared to spectral effcency (SE), energy effcency (EE), defned as the number of bts that can be transmtted wth per energy consumpton, becomes a new mportant crteron for desgnng green wreless systems. How to obtan optmal EE has become a hot research topc n dfferent wreless communcaton systems []. On the other hand, multple-nput multple-output (MIMO) has been a key technque n modern wreless communcaton systems, because t can sgnfcantly ncrease SE by explotng transmt dversty and spatal multplexng gans []. MIMO system s used for one sngle transmtter and one sngle recever n a pont-to-pont way, so t s often referred to sngleuser MIMO (SU-MIMO). However, n some applcatons, especally n cellular networks, t s often dffcult to nstall many antennas due to the sze lmtatons of many devces such as smartphones and tablets. To ncrease the networkwde SE, mult-user MIMO (MU-MIMO) technque has been proposed. Although dstrbuted users only have a small number of antennas or even just one, they can share the same tmefrequency resource block to form a MU-MIMO system []. In ths paper, we are nterested n the uplnk MU-MIMO because users, such as smartphones and tablets, are often more energysenstve. Recently there are some papers studyng how to EE for uplnk MU-MIMO system. In [7], Mao nvestgates the uplnk MU-MIMO system where each user deploys multantennas and he demonstrates that EE s d when some antennas are turned off. In [8], Ru et al. study the uplnk MU-MIMO system where each user deploys only one antenna and they EE by jontly dong mode selecton and optmal power allocaton. However, t s well-known that SE and EE are two conflctng objectves []. Often hgh EE leads to low SE and vce verse, whch means t s more practcal to consder SE and EE smultaneously. Thus how to study the EE- SE tradeoff has attracted a lot of attenton [9], [] whereas, only a few artcles study uplnk MU-MIMO system. The authors n [9] consder how to get the EE-SE tradeoff for a largescale uplnk MU-MIMO system n a system level. They study EE-SE tradeoff n low and hgh SE regme asymptotcally and do not nvolve user farness explctly whch s mportant n mult-user system. Dfferent from [9], our paper nvestgates uplnk MU-MIMO system n the lnk level rather than the system level. More mportantly, we study EE-SE tradeoff n a unfed way and we also guarantee farness among users. Specfcally, our contrbutons are three-fold, We construct a utlty functon of all users whch not only captures the user dversty for EE-SE tradeoff n a unfed way, smlar to [], but also guarantees farness among all users. To the best of our knowledge, we are the frst to study EE-SE tradeoff and user farness together n uplnk MU-MIMO system. We proposed an approach to convert the problem nto an equvalent convex programmng problem whch has the same optmal soluton wth the orgnal problem. Apart from the centralzed algorthm, we further devse a
2 prmal-dual dstrbuted algorthm whch only consumes a small amount of overhead. Moreover, we have proved that the dstrbuted algorthm converges to the global optmal soluton. The rest of ths paper s outlned as follows. We descrbe the system model and formulate the problem n Secton II. In Secton III, we analyze the optmal power allocaton by convertng the optmzaton problem nto a convex programmng problem. Next n Secton IV, we propose a prmal-dual dstrbuted algorthm, whch can acheve the global optmum. The numercal results are shown n Secton V, followed by concluson n Secton VI. Throughout ths paper, we wll use [ ] j to denote the matrx s entry n -th row and j-th column, E[ ] to denote expectaton, I n to denote the n n dentty matrx, and the superscrpt to denote Hermtan transpose. II. SYSTEM MODEL AND PROBLEM FORMULATION A. System Model Consder a MU-MIMO system wth N users ndexed from ton, and one Node-B n a sngle cell. In ths paper, we assume that each user s only equpped wth one transmttng antenna, and the Node-B s equpped wth M(M N) recevng antennas, as shown n Fg.. In uplnk, all N users share the same tme-frequency resource to transmt data to the Node-B. Denote P as the transmt power for user. Then the receved sgnal vector y C M s, y = Hs+n, () where s C N denotes the transmt sgnal vector wth E[ss ] = dagp,p,,p N }, H C M N denotes the channel matrx, and n C M denotes the addtve whte Gaussan nose (AWGN) wth zero mean and covarance matrx E[nn ] = σ ni M. In ths paper, we assume that Node-B has perfect channel state nformaton (CSI) for all users and the recever at Node- B uses zero forcng (ZF) detecton method. Thus, the decoded sgnal vector s H # y = s+h # n, () where H # = (H H) H denotes the pseudo-nverse of channel matrx H. Then the sgnal-to-nterference-plus-nose rato (SINR) at the Node-B s recever for user s, User ( RF) User ( RF) User N ( RF) Fg.. Node-B M recevng antennas at Node-B System Model P γ = σn[(h H) = P ] σn[(h H). () ] }} δ Then we can obtan SE and EE for user as SE = log(+γ ) = log(+δ P ), () EE = SE P +P c = log(+δ P ) P +P c, () where P c s a postve constant crcut power consumed by the relevant electronc devces for user. B. Problem Formulaton Next, we wll construct the utlty functon n two steps. Frst, we consder the EE-SE tradeoff. Inspred by the wdelyused Cobb-Douglas producton functon n economcs [], we adopt ths model emprcally to get the producton of SE and EE for user, u = (SE ) w (EE ) w, () wherew [,]. More specfcally, we can regard(w, w ) as a pror artculaton of preferences for SE and EE, whch captures EE-SE tradeoff n a unfed way []. Second, we consder the farness among all N users. If we apply the proportonal farness metrc, we can defne the fnal utlty functon for user as U (P) = log(u ) = log[(se ) w (EE ) w ] = log[log(+δ P )] ( w )log(p +P c ) = U (P ), (7) where P = (P,P,,P N ) and the last step shows that the utlty for user s not related to the transmt power of other users. Based on the utlty functon n (7), we then formulate our utlty maxmzaton problem subject to a power constrant for each user and a power sum constrant for all users, (P) subject to U (P ) (8) = P P max, (9) P P max. () In (8), we am at maxmzng the sum of the utlty for all users,.e., the network-wde utlty. Inequalty (9) s the ndvdual power constrants where P max s the maxmal transmt power for user. Inequalty () s the power sum constrant for the total MU-MIMO system where P max s the maxmal transmt power for all users, whch s the power budget of the whole system. =
3 III. OPTIMAL POWER ALLOCATION In the prevous secton, we have formulated the problem to the network-wde utlty n (8), whch however s not a concave functon snce EE n () s nether convex nor concave []. Therefore, n ths secton, we wll explot the nner structure of (P) and fnd that we can narrow down the feasble regon wthout changng the global optmum. A. Convexzaton Procedure To narrow down the feasble regon n (P), we frst consder the ndvdual power constrants n (9). Snce the optmzaton problem can be changed as, max P P max, = U (P ) = = max P P max U (P ), () we just need to fnd the maxmal ndvdual utlty,.e., U (P ) for any user,,,n}. For the ndvdual utlty functon U (P ) n (7), we have the followng proposton. Proposton : For any user under ndvdual power constrant n (9), there exsts one and only one pont P u ] that s U (P ). The functon U (P ) s strctly ncreasng and strctly concave over the nterval [,P u] whle strctly decreasng over the nterval (P u,pmax ]. In addton, P u can be derved as follows, P u P max f w > β(p max ) = P f w β(p max () ) (,P max where β(p ) = δ (P +P c ) (+δ P )log(+δ P ), () and P s the unque soluton to the followng equaton when w β(p max ), β(p ) = w. () Proof: We can prove ths proposton by analyzng the frst and second dervatve of U (P ) wth respect to P. For full proof, please see Appendx A n our techncal report []. Let us denote optmal soluton under ndvdual power constrants as P u = P u,p u,,pn u}. Now we consder the power sum constrant n (). In (P), snce the feasble regon s a compact set and the objectve functon s contnuous, a global optmal soluton can be attaned. Let us denote the global optmal soluton as P = P,P,,PN }. Then we have the followng proposton. Proposton : P P u,.e., P P u,,,,n}. Proof:,,,N}, suppose P > P u. Then k P k + Pu < N k= P k P max, whch means P = P,,P,Pu,P +,,P N } s a feasble soluton to (P). Accordng to the Proposton, we have U (P ) < U (P u). So N k= U k(pk ) < k U k(pk )+U (P u ), whch s a contradcton to the fact that P s the optmal soluton to (P). Ths completes the proof. Proposton shows that for any user, the optmal transmt power P cannot be greater than P u. Therefore we have the followng man result of ths secton. Theorem : (P) s equvalent to the followng problem, U (P ) = (P) subject to P P u, () P P max. () In addton, (P) s a convex programmng problem. Proof: Followng from Proposton, we mmedately conclude that (P) s equvalent to (P). In addton, from Proposton, we know that U (P ) s strctly concave at P [,P u ]. Thus, (P) s a problem to a strctly concave functon n a convex regon, whch means t s a convex problem now. Ths completes the proof. B. Some Analyss = Next we wll gve some analyss for the optmal soluton P n the followng two cases. Case : N = Pu P max In ths case, P u s feasble for (P), so t s also the optmal soluton for (P),.e., P = P u. Case : N = Pu > P max In ths case, we can further narrow down the feasble regon for (P) and acheve the followng proposton. Proposton : If N = Pu > P max, (P) s equvalent to the followng convex optmzaton problem, U (P ) = (P) subject to P P u, (7) P = P max. (8) Proof: Suppose N = P < P max. Snce N = Pu > P max, there exsts at least one,,,n} such that P < P u (Otherwse, N = P = N = Pu > P max, whch s a contradcton). Therefore, there exsts a ǫ > such that P + ǫ P u and k P k + (P + ǫ) P max. So P = P,,P,P +ǫ,p +,,P N } s a feasble soluton for (P). Accordng to the Proposton, we have U (P ) < U (P +ǫ). Then N k= U k(pk ) < k U k(pk )+U (P + ǫ), whch s a contradcton to the fact that P s the optmal = soluton to (P). Therefore, we must have N = P = P max, whch completes the proof. C. Centralzed Algorthm Based on the above analyss, we can readly get the optmal power allocaton P for (P) wth a centralzed algorthm, as shown n Algorthm. In practce, we can mplement such a centralzed algorthm as follows. Frst, each user
4 transmts ts parameters, ncludng P max,p c and w to Node- B. After collectng all the nformaton of all users, Node-B runs Algorthm to obtan the optmal power allocaton P, and then updates the optmal transmt power P to each user. Fnally, each user transmts data at the optmal transmt power. Algorthm Centralzed Algorthm for (P) : for N do : f w > β(p max ) then : P u = P max ; : else : Get P wth Newton-Raphson teraton method for the equaton (); : P u = P ; 7: end f 8: end for 9: f N = Pu P max then : P = P u ; : else : Get P wth gradent projecton method for (P); : end f IV. DISTRIBUTED PRIMAL-DUAL IMPLEMENTATION In the prevous secton, we provde Algorthm to solve the utlty maxmzaton problem n a centralzed manner. However, t requres Node-B to have knowledge of all the global nformaton of all the users. Furthermore, the centralzed algorthm stll ncurs some computatonal complexty and s not robust aganst temporary varaton of system parameters, such as nstantaneous CSI. Hence, we hope to mplement the algorthm n a dstrbuted manner. Inspred by the dstrbuted algorthm n network flow optmzaton problem [], we desgn the followng prmal-dual dstrbuted algorthm to acheve the optmal power allocaton P, P = k [U (P ) λ] Pu + P,,,,N} λ = g[ N = P P max ] + λ, (9) where and [f] + z = [f] a+ z = max(f,), z f, z > max(f,), z mn(f,), z a f, < z < a () () and k and g are postve stepsze. From (9), each user does not need the nformaton of others but just the penalty λ. The only overhead s that Node- B broadcasts λ to all users and each user updates P to Node-B untl convergence. Therefore, such mplementaton only consumes a small amount of overhead between each user and Node-B. Also, our proposed dstrbuted algorthm reduces computatonal complexty compared to Algorthm. Moreover, we further prove that ths prmal-dual dstrbuted algorthm n (9) can converge to the global optmal, as shown n the followng theorem. Theorem : The dstrbuted algorthm n (9) s globally asymptotcally stable and the only equlbrum s P. Proof: We can prove ths theorem by constructng the followng Lyapunov functon, V(P,λ) = (P P ) + (λ λ ), () k g = where (P,P,,P N,λ ) satsfy the KKT condtons for (P) and λ s the multpler for (). For full proof, please see Appendx B n our techncal report []. V. NUMERICAL RESULTS In ths secton, smulaton results are provded to valdate our theoretc analyss. Throughout ths secton, we wll set the maxmal transmt power to be W (dbm) for all users, by adoptng the transmtter s power level for 8/9 MHz moble phones []. The crcut power s set to be.w for all users. A. User Dversty for EE-SE Tradeoff As shown n (), dfferent users can have dfferent preferences for SE and EE accordng tow. In ths part, we wll show how to capture user dversty wth w. Fg. shows the mpact of users dfferent preferences,.e., w and w. From Fg. (a), we can see the optmal transmt power for user. Under the optmal transmt power for user, Fg. (b) demonstrates that SE ncreases as w ncreases whle Fg. (c) demonstrates that EE decreases as w ncreases. Such results comply wth our ntuton for the effect ofw n (), and therefore verfy that our utlty functon can capture user dversty for EE-SE tradeoff very well wth the preference w. B. User Farness In ths part, we wll show that our utlty functon n (7) can ensure farness among all users. As shown n Fg., the closer the channel condtons are, the better the farness s. In addton, when δ = δ, the ndex s (the best farness) whch means no bas exsts and two users have the same utlty. Furthermore, even though when the channel condton s worst for user wth δ = db and the channel condton s best for user wth δ = db, the ndex stll does not touch. (the worst farness) exactly and t s actually.7. Ths means user can stll transmt data wth a postve transmt power. Therefore, user farness can be guaranteed under our proposed utlty functon n (7). C. Prmal-Dual Dstrbuted Algorthm In ths part, we wll valdate the effectveness of our prmaldual dstrbuted algorthm n (9). From Fg., we can see that the dstrbuted algorthm can converge to the global optmum, whch verfes Theorem.
5 P.8... SE(P ) EE(P ) w w w w w w (a) Optmal transmt power P (b) SE wth P (c) EE wth P Fg.. User dversty for EE-SE tradeoff wth N =,M =,P max = P max = W,P max =.W,P c = Pc =.W,δ = δ = db. Jan s Farness Index δ = db δ = db δ = db. δ (db) Fg.. User farness wth N =,M =,P max = P max = W,P max =.W,P c = Pc =.W,w = w =.. Fg.. Utlty Sum 7 Optmal Value Dstrbuted Algorthm Number of Iteratons Convergence of prmal-dual dstrbuted algorthm. VI. CONCLUSION AND FUTURE WORK In ths paper, we consder utlty maxmzaton for the uplnk MU-MIMO system. We defne the utlty functon combnng both EE-SE tradeoff and user farness. After formulatng the u- tlty maxmzaton problem wth ndvdual power constrants and sum power constrant, we analyze the optmal power allocaton scheme. Although the orgnal optmzaton problem s not convex, we propose a convexzaton procedure to convert t nto an equvalent convex programmng problem, whch has been proven to have the same global optmal soluton as the orgnal problem. Moreover, we have proposed two algorthms to obtan the optmal soluton: one s the centralzed algorthm whch requres knowledge of all the global nformaton; the other s the prmal-dual dstrbuted algorthm whch only needs a small amount of overhead between each user and Node-B. Furthermore, we have proved that our proposed dstrbuted algorthm can converge to the global optmal soluton. ACKNOWLEDGMENTS Ths work was supported by the Scentfc Research Foundaton for the Returned Overseas Chnese Scholars, State Educaton Mnstry, and No.JK7, No.MJ. REFERENCES [] S. Lambert, W. Van Heddeghem, W. Vereecken, B. Lannoo, D. Colle, and M. Pckavet, Worldwde electrcty consumpton of communcaton networks, Optcs Express, vol., no., pp. B-B,. [] F. R. Yu, X. Zhang, and V. C. M. Leung, Green Communcatons and Networkng. CRC Press,. [] D. Feng, C. Jang, G. Lm, L. J. Cmn, Jr., G. Feng, and G. Y. L, A survey of energy-effcent wreless communcatons, IEEE Commun. Surveys & Tutorals, vol., no., pp. 7-78,. [] Y. Chen, S. Zhang, S. Xu, and G. Y. L, Fundamental trade-offs on green wreless networks, IEEE Commun. Mag., vol. 9, no., pp. -7, Jun.. [] D. Tse and P. Vswanath, Fundamentals of Wreless Communcatons. Cambrdge Unversty Press,. [] GPP TR.8 (V7..), Physcal layer aspects for evolved unversal terrestral tado access (UTRA), Sept.. [7] G. Mao, Energy-effcent uplnk mult-user MIMO,, IEEE Trans. Wreless Commun., vol., no., pp. -, May. [8] Y. Ru, Q. T. Zhang, L. Deng, P. Cheng, and M. L, Mode selecton and power optmzaton for energy effcency n uplnk vrtual MIMO systems, IEEE J. Sel. Areas Commun., vol., no., pp. 9-9, May.. [9] X. Hong, Y. Je, C. X. Wang, J. Sh, and X. Ge, Energy-spectral effcency trade-off n vrtual MIMO cellular systems, IEEE J. Sel. Areas Commun., vol., no., pp. 8-, Oct.. [] L. Deng, Y. Ru, P. Cheng, J. Zhang, Q. T. Zhang, and M. L, A unfed energy effcency and spectral effcency tradeoff metrc n wreless networks, IEEE Commun. Lett., vol. 7, no., pp. -8, Jan.. [] C. W. Cobb and P. H. Douglas, A theory of producton, Amercan Economc Revew, vol. 8, no., pp. 9-, Mar. 98. [] S. Shakkotta and R. Srkant, Network optmzaton and control, Foundatons and Trends n Networkng, vol., no., pp. 7-79, 7. [] GPP TS. (V8..), Rado transmsson and recepton, Nov.. [] L. Deng, W. Zhang, Y. Ru, and Y. C. Kat, Utlty Maxmzaton for U- plnk MU-MIMO: Combnng Spectral-Energy Effcency and Farness, Techncal Report.
Uplink User Selection Scheme for Multiuser MIMO Systems in a Multicell Environment
Uplnk User Selecton Scheme for Multuser MIMO Systems n a Multcell Envronment Byong Ok Lee School of Electrcal Engneerng and Computer Scence and INMC Seoul Natonal Unversty leebo@moble.snu.ac.kr Oh-Soon
More informationPerformance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme
Performance Analyss of Mult User MIMO System wth Block-Dagonalzaton Precodng Scheme Yoon Hyun m and Jn Young m, wanwoon Unversty, Department of Electroncs Convergence Engneerng, Wolgye-Dong, Nowon-Gu,
More informationAdaptive Modulation for Multiple Antenna Channels
Adaptve Modulaton for Multple Antenna Channels June Chul Roh and Bhaskar D. Rao Department of Electrcal and Computer Engneerng Unversty of Calforna, San Dego La Jolla, CA 993-7 E-mal: jroh@ece.ucsd.edu,
More informationThe Spectrum Sharing in Cognitive Radio Networks Based on Competitive Price Game
8 Y. B. LI, R. YAG, Y. LI, F. YE, THE SPECTRUM SHARIG I COGITIVE RADIO ETWORKS BASED O COMPETITIVE The Spectrum Sharng n Cogntve Rado etworks Based on Compettve Prce Game Y-bng LI, Ru YAG., Yun LI, Fang
More informationMultiband Jamming Strategies with Minimum Rate Constraints
Multband Jammng Strateges wth Mnmum Rate Constrants Karm Banawan, Sennur Ulukus, Peng Wang, and Bran Henz Department of Electrcal and Computer Engneerng, Unversty of Maryland, College Park, MD 7 US Army
More informationEfficient Large Integers Arithmetic by Adopting Squaring and Complement Recoding Techniques
The th Worshop on Combnatoral Mathematcs and Computaton Theory Effcent Large Integers Arthmetc by Adoptng Squarng and Complement Recodng Technques Cha-Long Wu*, Der-Chyuan Lou, and Te-Jen Chang *Department
More informationResource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks
Resource Allocaton Optmzaton for Devce-to- Devce Communcaton Underlayng Cellular Networks Bn Wang, L Chen, Xaohang Chen, Xn Zhang, and Dacheng Yang Wreless Theores and Technologes (WT&T) Bejng Unversty
More informationDistributed user selection scheme for uplink multiuser MIMO systems in a multicell environment
Lee et al. EURASIP Journal on Wreless Communcatons and Networkng 212, 212:22 http://s.euraspournals.com/content/212/1/22 RESEARCH Dstrbuted user selecton scheme for uplnk multuser MIMO systems n a multcell
More informationComparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate
Comparatve Analyss of Reuse and 3 n ular Network Based On IR Dstrbuton and Rate Chandra Thapa M.Tech. II, DEC V College of Engneerng & Technology R.V.. Nagar, Chttoor-5727, A.P. Inda Emal: chandra2thapa@gmal.com
More informationFull-duplex Relaying for D2D Communication in mmwave based 5G Networks
Full-duplex Relayng for D2D Communcaton n mmwave based 5G Networks Boang Ma Hamed Shah-Mansour Member IEEE and Vncent W.S. Wong Fellow IEEE Abstract Devce-to-devce D2D communcaton whch can offload data
More informationDistributed Uplink Scheduling in EV-DO Rev. A Networks
Dstrbuted Uplnk Schedulng n EV-DO ev. A Networks Ashwn Srdharan (Sprnt Nextel) amesh Subbaraman, och Guérn (ESE, Unversty of Pennsylvana) Overvew of Problem Most modern wreless systems Delver hgh performance
More informationDynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University
Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout
More informationThroughput Maximization by Adaptive Threshold Adjustment for AMC Systems
APSIPA ASC 2011 X an Throughput Maxmzaton by Adaptve Threshold Adjustment for AMC Systems We-Shun Lao and Hsuan-Jung Su Graduate Insttute of Communcaton Engneerng Department of Electrcal Engneerng Natonal
More informationJoint Adaptive Modulation and Power Allocation in Cognitive Radio Networks
I. J. Communcatons, etwork and System Scences, 8, 3, 7-83 Publshed Onlne August 8 n ScRes (http://www.scrp.org/journal/jcns/). Jont Adaptve Modulaton and Power Allocaton n Cogntve Rado etworks Dong LI,
More informationResource Control for Elastic Traffic in CDMA Networks
Resource Control for Elastc Traffc n CDMA Networks Vaslos A. Srs Insttute of Computer Scence, FORTH Crete, Greece vsrs@cs.forth.gr ACM MobCom 2002 Sep. 23-28, 2002, Atlanta, U.S.A. Funded n part by BTexact
More informationRESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING
RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING Vaslos A. Srs Insttute of Computer Scence (ICS), FORTH and Department of Computer Scence, Unversty of Crete P.O. Box 385, GR 7 Heraklon, Crete,
More informationDistributed Interference Alignment in Cognitive Radio Networks
Dstrbuted Interference Algnment n Cogntve Rado Networks Y Xu and Shwen Mao Department of Electrcal and Computer Engneerng, Auburn Unversty, Auburn, AL, USA Abstract In ths paper, we nvestgate the problem
More informationParameter Free Iterative Decoding Metrics for Non-Coherent Orthogonal Modulation
1 Parameter Free Iteratve Decodng Metrcs for Non-Coherent Orthogonal Modulaton Albert Gullén Fàbregas and Alex Grant Abstract We study decoder metrcs suted for teratve decodng of non-coherently detected
More informationErgodic Capacity of Block-Fading Gaussian Broadcast and Multi-access Channels for Single-User-Selection and Constant-Power
7th European Sgnal Processng Conference EUSIPCO 29 Glasgow, Scotland, August 24-28, 29 Ergodc Capacty of Block-Fadng Gaussan Broadcast and Mult-access Channels for Sngle-User-Selecton and Constant-Power
More informationOptimal Transmission Scheduling of Cooperative Communications with A Full-duplex Relay
1 Optmal Transmsson Schedulng of Cooperatve Communcatons wth A Full-duplex Relay Peng L Member IEEE Song Guo Senor Member IEEE Wehua Zhuang Fellow IEEE Abstract Most exstng research studes n cooperatve
More informationSelective Sensing and Transmission for Multi-Channel Cognitive Radio Networks
IEEE INFOCOM 2 Workshop On Cogntve & Cooperatve Networks Selectve Sensng and Transmsson for Mult-Channel Cogntve Rado Networks You Xu, Yunzhou L, Yfe Zhao, Hongxng Zou and Athanasos V. Vaslakos Insttute
More informationMIMO-OFDM Systems. Team Telecommunication and Computer Networks, FSSM, University Cadi Ayyad, P.O. Box 2390, Marrakech, Morocco.
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 8, Issue 3, ay 2011 ISSN (Onlne: 1694-0814 A Low-complexty Power and Bt Allocaton Algorthm for ultuser IO-OFD Systems Ayad Habb 1, Khald El Baamran
More informationResource Allocation for Throughput Enhancement in Cellular Shared Relay Networks
Resource Allocaton for Throughput Enhancement n Cellular Shared Relay Networs Mohamed Fadel, Ahmed Hndy, Amr El-Key, Mohammed Nafe, O. Ozan Koyluoglu, Antona M. Tulno Wreless Intellgent Networs Center
More informationIEE Electronics Letters, vol 34, no 17, August 1998, pp ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES
IEE Electroncs Letters, vol 34, no 17, August 1998, pp. 1622-1624. ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES A. Chatzgeorgou, S. Nkolads 1 and I. Tsoukalas Computer Scence Department, 1 Department
More informationDesign Rules for Efficient Scheduling of Packet Data on Multiple Antenna Downlink
Desgn Rules for Effcent Schedulng of acet Data on Multple Antenna Downln Davd J. Mazzarese and Wtold A. rzyme Unversty of Alberta / TRLabs Edmonton, Alberta, Canada E-mal: djm@ ece.ualberta.ca / wa@ece.ualberta.ca
More informationFractional Base Station Cooperation Cellular Network
Fractonal Base Staton Cooperaton Cellular Network Naok usashma Tokyo Insttute of Technoloy, Department of Electrcal and Electronc Enneern, Arak-Sakauch Laboratores. Contents Backround Cell-ede problem
More informationEnergy Efficient Adaptive Modulation in Wireless Cognitive Radio Ad Hoc Networks
Energy Effcent Adaptve Modulaton n Wreless Cogntve Rado Ad Hoc Networks Song Gao, Ljun Qan*, Dhadesugoor. R. Vaman ARO/ARL Center for Battlefeld Communcatons Research Prare Vew A&M Unversty, Texas A&M
More informationChannel aware scheduling for broadcast MIMO systems with orthogonal linear precoding and fairness constraints
Channel aware schedulng for broadcast MIMO systems wth orthogonal lnear precodng and farness constrants G Prmolevo, O Smeone and U Spagnoln Dp d Elettronca e Informazone, Poltecnco d Mlano Pzza L da Vnc,
More informationEnhancing Throughput in Wireless Multi-Hop Network with Multiple Packet Reception
Enhancng Throughput n Wreless Mult-Hop Network wth Multple Packet Recepton Ja-lang Lu, Paulne Vandenhove, We Shu, Mn-You Wu Dept. of Computer Scence & Engneerng, Shangha JaoTong Unversty, Shangha, Chna
More informationA Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results
AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of
More informationRejection of PSK Interference in DS-SS/PSK System Using Adaptive Transversal Filter with Conditional Response Recalculation
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol., No., November 23, 3-9 Rejecton of PSK Interference n DS-SS/PSK System Usng Adaptve Transversal Flter wth Condtonal Response Recalculaton Zorca Nkolć, Bojan
More informationAutonomous Dynamic Spectrum Management for Coexistence of Multiple Cognitive Tactical Radio Networks
Autonomous Dynamc Spectrum Management for Coexstence of Multple Cogntve Tactcal Rado Networks Vncent Le Nr, Bart Scheers Abstract In ths paper, dynamc spectrum management s studed for multple cogntve tactcal
More informationPower Control for Full-Duplex Relay-Enhanced Cellular Networks With QoS Guarantees
SPECIAL SECTION ON FUTURE NETWORKS: ARCHITECTURES, PROTOCOLS, AND APPLICATIONS Receved January 9, 07, accepted February, 07, date of publcaton March 5, 07, date of current verson Aprl 4, 07. Dgtal Object
More informationIterative Water-filling for Load-balancing in
Iteratve Water-fllng for Load-balancng n Wreless LAN or Mcrocellular Networks Jeremy K. Chen Theodore S. Rappaport Gustavo de Vecana Wreless Networkng and Communcatons Group (WNCG), The Unversty of Texas
More informationCharacterization and Analysis of Multi-Hop Wireless MIMO Network Throughput
Characterzaton and Analyss of Mult-Hop Wreless MIMO Network Throughput Bechr Hamdaou EECS Dept., Unversty of Mchgan 226 Hayward Ave, Ann Arbor, Mchgan, USA hamdaou@eecs.umch.edu Kang G. Shn EECS Dept.,
More informationPower Minimization Under Constant Throughput Constraint in Wireless Networks with Beamforming
Power Mnmzaton Under Constant Throughput Constrant n Wreless etworks wth Beamformng Zhu Han and K.J. Ray Lu, Electrcal and Computer Engneer Department, Unversty of Maryland, College Park. Abstract In mult-access
More informationDefine Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.
Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)
More informationDistributed and Optimal Reduced Primal-Dual Algorithm for Uplink OFDM Resource Allocation
Dstrbuted and Optmal Reduced Prmal-Dual Algorthm for Uplnk OFDM Resource Allocaton Xaoxn Zhang, Lang Chen, Janwe Huang, Mnghua Chen, and Yupng Zhao Abstract Orthogonal frequency dvson multplexng OFDM s
More informationHigh Speed, Low Power And Area Efficient Carry-Select Adder
Internatonal Journal of Scence, Engneerng and Technology Research (IJSETR), Volume 5, Issue 3, March 2016 Hgh Speed, Low Power And Area Effcent Carry-Select Adder Nelant Harsh M.tech.VLSI Desgn Electroncs
More informationDistributed Energy Efficient Spectrum Access in Cognitive Radio Wireless Ad Hoc Networks
Dstrbuted Energy Effcent Spectrum Access n Cogntve Rado Wreless Ad Hoc Networks Song Gao, Ljun Qan, Dhadesugoor. R. Vaman ARO/ARL Center for Battlefeld Communcatons Research Prare Vew A&M Unversty, Texas
More informationCooperative Dynamic Game-Based Optimal Power Control in Wireless Sensor Network Powered by RF Energy
sensors Artcle Cooperatve Dynamc Game-Based Optmal Power Control n Wreless Sensor etwork Powered by RF Energy Manx Wang 1, Hatao Xu 2, * ID and Xanwe Zhou 2 1 State Key Laboratory of Complex Electromagnetc
More informationDistributed Resource Allocation and Scheduling in OFDMA Wireless Networks
Southern Illnos Unversty Carbondale OpenSIUC Conference Proceedngs Department of Electrcal and Computer Engneerng 11-2006 Dstrbuted Resource Allocaton and Schedulng n OFDMA Wreless Networks Xangpng Qn
More informationSpectrum Management and Power Allocation in. MIMO Cognitive Networks
Spectrum Management and Power Allocaton n 1 MIMO Cogntve Networks Dep N. Nguyen and Marwan Krunz Department of Electrcal and Computer Engneerng, Unversty of Arzona E-mal:{dnnguyen, krunz}@ece.arzona.edu
More informationA study of turbo codes for multilevel modulations in Gaussian and mobile channels
A study of turbo codes for multlevel modulatons n Gaussan and moble channels Lamne Sylla and Paul Forter (sylla, forter)@gel.ulaval.ca Department of Electrcal and Computer Engneerng Laval Unversty, Ste-Foy,
More informationResearch Article Heterogeneous Resource Allocation Algorithm for Ad Hoc Networks with Utility Fairness
Internatonal Journal of Dstrbuted Sensor Networks Volume 205, Artcle ID 68689, 3 pages http://dx.do.org/0.55/205/68689 Research Artcle Heterogeneous Resource Allocaton Algorthm for Ad Hoc Networks wth
More informationThe Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks
Ths artcle has been accepted for publcaton n a future ssue of ths journal, but has not been fully edted. Content may change pror to fnal publcaton. The Impact of Spectrum Sensng Frequency and Pacet- Loadng
More informationProcedia Computer Science
Proceda Computer Scence 3 (211) 714 72 Proceda Computer Scence (21) Proceda Computer Scence www.elsever.com/locate/proceda www.elsever.com/locate/proceda WCIT-21 Performance evaluaton of data delvery approaches
More informationRECENT years have witnessed a great interest in cognitive
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 30, NO. 11, DECEMBER 2012 2295 Prce-Based Jont Beamformng and Spectrum Management n Mult-Antenna Cogntve Rado Networks Dep N. Nguyen and Marwan Krunz
More informationEffective SNR Based MIMO Switching in Mobile WiMAX Systems
Effectve SNR Based MIMO Swtcng n Moble WMAX Systems Myoung-Seob Km and Yong-wan Lee Scool of Electrcal Engneerng and INMC, Seoul Natonal Unversty Kwanak P. O. Box, Seoul -600 Korea Emal: mseob@ttl.snu.ac.kr
More informationNOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION
NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION Phaneendra R.Venkata, Nathan A. Goodman Department of Electrcal and Computer Engneerng, Unversty of Arzona, 30 E. Speedway Blvd, Tucson, Arzona
More informationOn Interference Alignment for Multi-hop MIMO Networks
013 Proceedngs IEEE INFOCOM On Interference Algnment for Mult-hop MIMO Networks Huacheng Zeng Y Sh Y. Thomas Hou Wenng Lou Sastry Kompella Scott F. Mdkff Vrgna Polytechnc Insttute and State Unversty, USA
More informationResearch of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b
2nd Internatonal Conference on Computer Engneerng, Informaton Scence & Applcaton Technology (ICCIA 207) Research of Dspatchng Method n Elevator Group Control System Based on Fuzzy Neural Network Yufeng
More informationOptimum Ordering for Coded V-BLAST
Optmum Orderng for Coded V-BLAST Alan Urarte Toboso Thess submtted to the Faculty of Graduate and Postdoctoral Studes n partal fulfllment of the requrements for the degree of Master of Appled Scence n
More informationA NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems
0 nd Internatonal Conference on Industral Technology and Management (ICITM 0) IPCSIT vol. 49 (0) (0) IACSIT Press, Sngapore DOI: 0.776/IPCSIT.0.V49.8 A NSGA-II algorthm to solve a b-obectve optmzaton of
More informationUtility-based Routing
Utlty-based Routng Je Wu Dept. of Computer and Informaton Scences Temple Unversty Roadmap Introducton Why Another Routng Scheme Utlty-Based Routng Implementatons Extensons Some Fnal Thoughts 2 . Introducton
More informationPRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht
68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 13, NO. 12, DECEMBER
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 3, NO. 2, DECEMBER 204 695 On Spatal Capacty of Wreless Ad Hoc Networks wth Threshold Based Schedulng Yue Lng Che, Student Member, IEEE, Ru Zhang, Member,
More informationAN IMPROVED BIT LOADING TECHNIQUE FOR ENHANCED ENERGY EFFICIENCY IN NEXT GENERATION VOICE/VIDEO APPLICATIONS
Journal of Engneerng Scence and Technology Vol., o. 4 (6) 476-495 School of Engneerng, Taylor s Unversty A IMPROVED BIT LOADIG TECHIQUE FOR EHACED EERGY EFFICIECY I EXT GEERATIO VOICE/VIDEO APPLICATIOS
More informationJoint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding
Communcatons and Network, 2013, 5, 312-318 http://dx.do.org/10.4236/cn.2013.53b2058 Publshed Onlne September 2013 (http://www.scrp.org/journal/cn) Jont Power Control and Schedulng for Two-Cell Energy Effcent
More informationJoint Optimization of Data Routing and Energy Routing in Energy-cooperative WSNs
Jont Optmzaton of Data Routng and Energy Routng n Energy-cooperatve WSNs Dongha Da, Hu Feng, Yuedong Xu, Janqu Zhang,BoHu Key Laboratory of EMW Informaton, Fudan Unversty Electronc Engneerng Department,
More informationTraffic balancing over licensed and unlicensed bands in heterogeneous networks
Correspondence letter Traffc balancng over lcensed and unlcensed bands n heterogeneous networks LI Zhen, CUI Qme, CUI Zhyan, ZHENG We Natonal Engneerng Laboratory for Moble Network Securty, Bejng Unversty
More informationThe Performance Improvement of BASK System for Giga-Bit MODEM Using the Fuzzy System
Int. J. Communcatons, Network and System Scences, 10, 3, 1-5 do:10.36/jcns.10.358 Publshed Onlne May 10 (http://www.scrp.org/journal/jcns/) The Performance Improvement of BASK System for Gga-Bt MODEM Usng
More informationENERGY EFFICIENT MILLIMETER WAVE RADIO LINK ESTABLISHMENT WITH SMART ARRAY ANTENNAS
ENERGY EFFICIENT MILLIMETER WVE RDIO LINK ESTLISHMENT WITH SMRT RRY NTENNS ehnam Neekzad, John S. aras Insttute for Systems Research and Electrcal and Computer Engneerng Department Unversty of Maryland
More informationImpact of Interference Model on Capacity in CDMA Cellular Networks. Robert Akl, D.Sc. Asad Parvez University of North Texas
Impact of Interference Model on Capacty n CDMA Cellular Networks Robert Akl, D.Sc. Asad Parvez Unversty of North Texas Outlne Introducton to CDMA networks Average nterference model Actual nterference model
More informationBit-interleaved Rectangular Parity-Check Coded Modulation with Iterative Demodulation In a Two-Node Distributed Array
Bt-nterleaved Rectangular Party-Check Coded Modulaton wth Iteratve Demodulaton In a Two-Node Dstrbuted Array Xn L, Tan F. Wong, and John M. Shea Wreless Informaton Networkng Group Department of Electrcal
More informationSuresh Babu, International Journal of Advanced Engineering Technology E-ISSN Int J Adv Engg Tech/Vol. VII/Issue I/Jan.-March.
Research Paper OPTIMUM POWR ALLOCATION AND SYMBOL RROR RAT (SR) PRFORMANC OF VARIOUS SPAC TIM BLOCK CODS (STBC) OVR FADING COGNITIV MIMO CHANNLS IN DIFFRNT WIRLSS NVIRONMNT R. Suresh Babu Address for Correspondence
More informationEnergy-Efficient Link Adaptation in Frequency-Selective Channels
IEEE TANSACTIONS ON COMMUNICATIONS, VOL. 58, NO., FEBUAY 00 545 Energy-Effcent Lnk Adaptaton n Frequency-Selectve Channels Guowang Mao, Student Member, IEEE, Nageen Hmayat, Member, IEEE, and Geoffrey Ye
More informationEE360: Lecture 7 Outline Cellular System Capacity and ASE Announcements Summary due next week
EE360: Lecture 7 Outlne Cellular System Capacty and ASE Announcements Summary due next week Capacty Area Spectral Effcency Dynamc Resource Allocaton Revew of Cellular Lecture Desgn consderatons: Spectral
More informationOn Space-Frequency Water-Filling Precoding for Multi-User MIMO Communications
Proceedngs of the World ongress on Engneerng 05 Vol I WE 05, July - 3, 05, London, U.. On Space-Frequency Water-Fllng Precodng for Mult-User MIMO ommuncatons Yu-uan hang, Ye-Shun Shen, Fang-Bau Ueng and
More informationWalsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter
Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957
More information熊本大学学術リポジトリ. Kumamoto University Repositor
熊本大学学術リポジトリ Kumamoto Unversty Repostor Ttle Wreless LAN Based Indoor Poston and Its Smulaton Author(s) Ktasuka, Teruak; Nakansh, Tsune CtatonIEEE Pacfc RIM Conference on Comm Computers, and Sgnal Processng
More informationA Unified Cross-Layer Framework for Resource Allocation in Cooperative Networks
3000 IEEE TRNSCTIONS ON WIRELESS COMMUNICTIONS, VOL. 7, NO. 8, UGUST 2008 Unfed Cross-Layer Framework for Resource llocaton n Cooperatve Networks We Chen, Member, IEEE, Ln Da, Member, IEEE, Khaled Ben
More informationPower Control for Wireless Data
Power Control for Wreless Data Davd Goodman Narayan Mandayam Electrcal Engneerng WINLAB Polytechnc Unversty Rutgers Unversty 6 Metrotech Center 73 Brett Road Brooklyn, NY, 11201, USA Pscataway, NJ 08854
More informationJoint iterative beamforming and power adaptation for MIMO ad hoc networks
RESEARCH Open Access Jont teratve beamformng and power adaptaton for MIMO ad hoc networks Engn Zeydan *, Ddem Kvanc 2, Ufuk Turel 2 and Crstna Comancu Abstract In ths paper, we present dstrbuted cooperatve
More informationChaotic Filter Bank for Computer Cryptography
Chaotc Flter Bank for Computer Cryptography Bngo Wng-uen Lng Telephone: 44 () 784894 Fax: 44 () 784893 Emal: HTwng-kuen.lng@kcl.ac.ukTH Department of Electronc Engneerng, Dvson of Engneerng, ng s College
More informationHUAWEI TECHNOLOGIES CO., LTD. Huawei Proprietary Page 1
Project Ttle Date Submtted IEEE 802.16 Broadband Wreless Access Workng Group Double-Stage DL MU-MIMO Scheme 2008-05-05 Source(s) Yang Tang, Young Hoon Kwon, Yajun Kou, Shahab Sanaye,
More informationA New Opportunistic Interference Alignment Scheme and Performance Comparison of MIMO Interference Alignment with Limited Feedback
A New Opportunstc Interference Algnment Scheme and Performance Comparson of MIMO Interference Algnment wth Lmted Feedback Johann Lethon, Chau Yuen, Hmal A. Suraweera and Hu Gao Sngapore Unversty of Technology
More informationPerformance Analysis of Power Line Communication Using DS-CDMA Technique with Adaptive Laguerre Filters
Internatonal Conference on Informaton and Electroncs Engneerng IPCSIT vol.6 ( ( IACSIT Press, Sngapore Performance Analyss of Power Lne Communcaton Usng DS-CDMA Technque wth Adaptve Laguerre Flters S.
More informationRelevance of Energy Efficiency Gain in Massive MIMO Wireless Network
Relevance of Energy Effcency Gan n Massve MIMO Wreless Network Ahmed Alzahran, Vjey Thayananthan, Muhammad Shuab Quresh Computer Scence Department, Faculty of Computng and Informaton Technology Kng Abdulazz
More informationPower Allocation in Wireless Relay Networks: A Geometric Programming-Based Approach
ower Allocaton n Wreless Relay Networks: A Geometrc rogrammng-based Approach Khoa T. han, Tho Le-Ngoc, Sergy A. Vorobyov, and Chntha Telambura Department of Electrcal and Computer Engneerng, Unversty of
More informationCalculation of the received voltage due to the radiation from multiple co-frequency sources
Rec. ITU-R SM.1271-0 1 RECOMMENDATION ITU-R SM.1271-0 * EFFICIENT SPECTRUM UTILIZATION USING PROBABILISTIC METHODS Rec. ITU-R SM.1271 (1997) The ITU Radocommuncaton Assembly, consderng a) that communcatons
More informationCROSSFIRE. FP7 Contract Number:
CROSSFIRE Uncoordnated network strateges for enhanced nterference, moblty, rado resource, and energy savng management n LTE-Advanced networks FP7 Contract Number: 376 WP Interference-Aware LTE-A Heterogeneous
More informationCooperative Multicast Scheduling Scheme for IPTV Service over IEEE Networks
Cooperatve Multcast Schedulng Scheme for IPTV Servce over IEEE 802.16 Networks Fen Hou 1, Ln X. Ca 1, James She 1, Pn-Han Ho 1, Xuemn (Sherman Shen 1, and Junshan Zhang 2 Unversty of Waterloo, Waterloo,
More informationCDMA Uplink Power Control as a Noncooperative Game
Wreless Networks 8, 659 670, 2002 2002 Kluwer Academc Publshers. Manufactured n The Netherlands. CDMA Uplnk Power Control as a Noncooperatve Game TANSU APCAN, TAMER BAŞAR and R. SRIKANT Coordnated Scence
More informationDirectional Beamforming for High-Speed Railway Communications with. Frequency offset precorrection.
Chnese Journal of Electroncs Vol.23, No.1, Jan. 2014 Drectonal Beamformng for Hgh-Speed Ralway Communcatons wth Frequency Offset Precorrecton CAO Yuan 1,2, WEN Ynghong 1,XUWe 3,2 and XIE Xn 3 (1.School
More informationInformation-Theoretic Comparison of Channel Capacity for FDMA and DS-CDMA in a Rayleigh Fading Environment
WSEAS TRANSATIONS on OMMUNIATIONS Informaton-Theoretc omparson of hannel apacty for FDMA and DS-DMA n a Raylegh Fadng Envronment PANAGIOTIS VARZAAS Department of Electroncs Technologcal Educatonal Insttute
More informationANNUAL OF NAVIGATION 11/2006
ANNUAL OF NAVIGATION 11/2006 TOMASZ PRACZYK Naval Unversty of Gdyna A FEEDFORWARD LINEAR NEURAL NETWORK WITH HEBBA SELFORGANIZATION IN RADAR IMAGE COMPRESSION ABSTRACT The artcle presents the applcaton
More informationThe Application of Interpolation Algorithms in OFDM Channel Estimation
The Applcaton of Interpolaton Algorthms n OFDM Estmaton Xjun ZHANG 1,, Zhantng YUAN 1, 1 School of Electrcal and Informaton Engneerng, Lanzhou Unversty of Technology, Lanzhou, Gansu 730050, Chna School
More informationOptimal Spectrum Management in Multiuser Interference Channels
Optmal Spectrum Management n Multuser Intererence Channels Yue Zhao, and Gregory J. Potte Department o Electrcal Engneerng Unversty o Calorna, Los Angeles Los Angeles, CA, 90095, USA Emal: yuezhao@ucla.edu,
More informationSpectrum Sharing For Delay-Sensitive Applications With Continuing QoS Guarantees
Spectrum Sharng For Delay-Senstve Applcatons Wth Contnung QoS Guarantees Yuanzhang Xao, Kartk Ahuja, and Mhaela van der Schaar Department of Electrcal Engneerng, UCLA Emals: yxao@seas.ucla.edu, ahujak@ucla.edu,
More informationTest 2. ECON3161, Game Theory. Tuesday, November 6 th
Test 2 ECON36, Game Theory Tuesday, November 6 th Drectons: Answer each queston completely. If you cannot determne the answer, explanng how you would arrve at the answer may earn you some ponts.. (20 ponts)
More informationSubcarrier allocation for OFDMA wireless channels using lagrangian relaxation methods
Unversty of Wollongong Research Onlne Faculty of Informatcs - Papers (Archve) Faculty of Engneerng and Informaton Scences 2006 Subcarrer allocaton for OFDMA wreless channels usng lagrangan relaxaton methods
More informationDecomposition Principles and Online Learning in Cross-Layer Optimization for Delay-Sensitive Applications
Techncal Report Decomposton Prncples and Onlne Learnng n Cross-Layer Optmzaton for Delay-Senstve Applcatons Abstract In ths report, we propose a general cross-layer optmzaton framework n whch we explctly
More informationSpace Time Equalization-space time codes System Model for STCM
Space Tme Eualzaton-space tme codes System Model for STCM The system under consderaton conssts of ST encoder, fadng channel model wth AWGN, two transmt antennas, one receve antenna, Vterb eualzer wth deal
More informationJoint Data and Power Transfer Optimization for Energy Harvesting Mobile Wireless Networks
Jont Data and Power Transfer Optmzaton for Energy Harvestng Moble Wreless Networs Bassem Khalf, Bechr Hamdaou, Mahd Ben Ghorbel, Mohsen Guzan, and X Zhang Oregon State Unversty, Qatar Unversty, Texas A&M
More informationResearch Article A Utility-Based Rate Allocation of M2M Service in Heterogeneous Wireless Environments
Internatonal Dstrbuted Sensor etworks Volume 3, Artcle ID 3847, 7 pages http://dx.do.org/.55/3/3847 Research Artcle A Utlty-Based Rate Allocaton of MM Servce n Heterogeneous Wreless Envronments Yao Huang,
More informationBit Error Probability of Cooperative Diversity for M-ary QAM OFDM-based system with Best Relay Selection
011 Internatonal Conerence on Inormaton and Electroncs Engneerng IPCSIT vol.6 (011) (011) IACSIT Press, Sngapore Bt Error Proalty o Cooperatve Dversty or M-ary QAM OFDM-ased system wth Best Relay Selecton
More informationQueuing-Based Dynamic Channel Selection for Heterogeneous Multimedia Applications over Cognitive Radio Networks
1 Queung-Based Dynamc Channel Selecton for Heterogeneous ultmeda Applcatons over Cogntve Rado Networks Hsen-Po Shang and haela van der Schaar Department of Electrcal Engneerng (EE), Unversty of Calforna
More informationAdaptive Modulation and Coding for Utility Enhancement in VMIMO WSN Using Game Theory
Adaptve Modulaton and Codng for Utlty nhancement n VMIMO WSN Usng Game Theory R. Vall and P. Dananjayan mparments. The data transmtted from the sensor nodes s hghly susceptble to error n a wreless envronment
More informationAN EFFICIENT ITERATIVE DFT-BASED CHANNEL ESTIMATION FOR MIMO-OFDM SYSTEMS ON MULTIPATH CHANNELS
AN FFICINT ITRATIV DFT-BASD CHANNL STIMATION FOR MIMO-OFDM SYSTMS ON MULTIPATH CHANNLS Jan Hafang Graduate Unversty of the Chnese Academy of Scences Insttute of Semconductors, CAS Beng, Chna hf@sem.ac.cn
More information