{"title":"Heuristic resource allocation for sum rate optimization in MIMO-OFDM systems using eigenvalue updates","authors":"Johannes Georg Klotz, C. Huppert, M. Bossert","doi":"10.1109/ISWCS.2008.4726006","DOIUrl":null,"url":null,"abstract":"In this paper a heuristic resource allocation algorithm for sum rate maximization is presented. We consider an orthogonal frequency division multiplexing channel with multiple antennas at the base station as well as at the mobile stations. Our algorithm uses eigen-beamforming and dirty paper coding. The user interference is estimated and the eigenvalues of the affected beams are updated. Our algorithm is compared to the optimal but more complex solution. It is shown that the performance of the suggested algorithm is very close to the optimum.","PeriodicalId":158650,"journal":{"name":"2008 IEEE International Symposium on Wireless Communication Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Symposium on Wireless Communication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2008.4726006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In this paper a heuristic resource allocation algorithm for sum rate maximization is presented. We consider an orthogonal frequency division multiplexing channel with multiple antennas at the base station as well as at the mobile stations. Our algorithm uses eigen-beamforming and dirty paper coding. The user interference is estimated and the eigenvalues of the affected beams are updated. Our algorithm is compared to the optimal but more complex solution. It is shown that the performance of the suggested algorithm is very close to the optimum.