{"title":"Multiuser OFDMA optimization: Algorithms and duality gap analysis","authors":"G. Wunder, T. Michel","doi":"10.1109/WSA.2008.4475564","DOIUrl":null,"url":null,"abstract":"In this paper we address the problem of power allocation in OFDM multi-user systems, if each subcarrier has to be allocated exclusively to a single user. Such transmit strategies are of particular interest for practical systems because users are orthogonalized and thus signal processing is extremely simple. Due to the combinatorial structure the considered problems are non-convex. We propose algorithms based on the Lagrangian dual avoiding a combinatorial optimization. The resulting power allocations are surprisingly close to the information-theoretic optimum. Moreover, the performance loss can be upper bounded by an expression based on the the Lagrangian duality gap, which yields a valuable statement about any arbitrary resource allocation fulfilling the constraints.","PeriodicalId":255495,"journal":{"name":"2008 International ITG Workshop on Smart Antennas","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International ITG Workshop on Smart Antennas","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WSA.2008.4475564","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
In this paper we address the problem of power allocation in OFDM multi-user systems, if each subcarrier has to be allocated exclusively to a single user. Such transmit strategies are of particular interest for practical systems because users are orthogonalized and thus signal processing is extremely simple. Due to the combinatorial structure the considered problems are non-convex. We propose algorithms based on the Lagrangian dual avoiding a combinatorial optimization. The resulting power allocations are surprisingly close to the information-theoretic optimum. Moreover, the performance loss can be upper bounded by an expression based on the the Lagrangian duality gap, which yields a valuable statement about any arbitrary resource allocation fulfilling the constraints.