基于特征值更新的MIMO-OFDM系统和速率优化启发式资源分配

Johannes Georg Klotz, C. Huppert, M. Bossert
{"title":"基于特征值更新的MIMO-OFDM系统和速率优化启发式资源分配","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":"{\"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}","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

摘要

本文提出了一种求和率最大化的启发式资源分配算法。我们考虑在基站和移动台都有多天线的正交频分复用信道。我们的算法采用特征波束形成和脏纸编码。估计用户干扰,更新受影响波束的特征值。我们的算法与最优但更复杂的解决方案进行了比较。结果表明,所提算法的性能非常接近最优。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Heuristic resource allocation for sum rate optimization in MIMO-OFDM systems using eigenvalue updates
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信