离散速率OFDMA上行链路的遍历和速率最大化

2010 European Wireless Conference (EW) Pub Date : 2010-04-12 DOI:10.1109/EW.2010.5483394

E. Yaacoub, Ahmad M. El-Hajj, Z. Dawy

{"title":"离散速率OFDMA上行链路的遍历和速率最大化","authors":"E. Yaacoub, Ahmad M. El-Hajj, Z. Dawy","doi":"10.1109/EW.2010.5483394","DOIUrl":null,"url":null,"abstract":"Weighted ergodic sum-rate maximization in OFDMA uplink is investigated. A finite set of achievable rates is assumed. The problem is formulated as a convex optimization problem. An analytical solution is derived using the Lagrangian dual decomposition. Numerical results show that the weights can be adjusted to increase the fairness in the system or to increase the priority of certain users.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Ergodic sum-rate maximization in OFDMA uplink with discrete rates\",\"authors\":\"E. Yaacoub, Ahmad M. El-Hajj, Z. Dawy\",\"doi\":\"10.1109/EW.2010.5483394\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Weighted ergodic sum-rate maximization in OFDMA uplink is investigated. A finite set of achievable rates is assumed. The problem is formulated as a convex optimization problem. An analytical solution is derived using the Lagrangian dual decomposition. Numerical results show that the weights can be adjusted to increase the fairness in the system or to increase the priority of certain users.\",\"PeriodicalId\":232165,\"journal\":{\"name\":\"2010 European Wireless Conference (EW)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 European Wireless Conference (EW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EW.2010.5483394\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 European Wireless Conference (EW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EW.2010.5483394","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

研究了OFDMA上行链路的加权遍历和速率最大化问题。假设一组有限的可实现速率。该问题被表述为一个凸优化问题。利用拉格朗日对偶分解导出了解析解。数值结果表明，可以通过调整权重来提高系统的公平性或提高某些用户的优先级。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Ergodic sum-rate maximization in OFDMA uplink with discrete rates

Weighted ergodic sum-rate maximization in OFDMA uplink is investigated. A finite set of achievable rates is assumed. The problem is formulated as a convex optimization problem. An analytical solution is derived using the Lagrangian dual decomposition. Numerical results show that the weights can be adjusted to increase the fairness in the system or to increase the priority of certain users.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 European Wireless Conference (EW)

自引率

0.00%

发文量