Optimal MU-MIMO precoder with MISO decomposition approach

Mustapha Amara, Y. Yuan-Wu, D. Slock
{"title":"Optimal MU-MIMO precoder with MISO decomposition approach","authors":"Mustapha Amara, Y. Yuan-Wu, D. Slock","doi":"10.1109/SPAWC.2010.5670810","DOIUrl":null,"url":null,"abstract":"This paper proposes a new iterative implementation algorithm for sum-rate maximization in a Multiuser MIMO system (MU-MIMO). The proposed algorithm is based on joint precoder and decoder optimization. For that we considered the best existing precoder design algorithm for a MISO multiuser system proposed in [1]. This algorithm is based on the Lagrangian sum-rate maximization procedure. For the receiving part, an optimal receiver is designed based on the system throughput maximization derived in the general case from the sum-rate expression given for a MU-MIMO broadcast channel. To link these two optimal algorithms, we use an iterative procedure transforming the MU-MIMO channel for each iteration into a MU-MISO channel trough virtual channel calculations. Finally to validate our prosed solution we compare it with an existing MMSE based iterative optimization algorithm. This algorithm proposed in [2] is based on an MMSE as well at the transmission side than at the receiving side. The obtained results demonstrate significant gains without introducing neither supplementary complexity nor resource needs.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2010.5670810","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

This paper proposes a new iterative implementation algorithm for sum-rate maximization in a Multiuser MIMO system (MU-MIMO). The proposed algorithm is based on joint precoder and decoder optimization. For that we considered the best existing precoder design algorithm for a MISO multiuser system proposed in [1]. This algorithm is based on the Lagrangian sum-rate maximization procedure. For the receiving part, an optimal receiver is designed based on the system throughput maximization derived in the general case from the sum-rate expression given for a MU-MIMO broadcast channel. To link these two optimal algorithms, we use an iterative procedure transforming the MU-MIMO channel for each iteration into a MU-MISO channel trough virtual channel calculations. Finally to validate our prosed solution we compare it with an existing MMSE based iterative optimization algorithm. This algorithm proposed in [2] is based on an MMSE as well at the transmission side than at the receiving side. The obtained results demonstrate significant gains without introducing neither supplementary complexity nor resource needs.
基于MISO分解方法的最佳MU-MIMO预编码器
提出了一种新的多用户MIMO系统(MU-MIMO)和速率最大化的迭代实现算法。该算法基于预编码器和解码器的联合优化。为此,我们考虑了[1]中提出的MISO多用户系统的现有最佳预编码器设计算法。该算法基于拉格朗日和速率最大化过程。对于接收部分,基于一般情况下由MU-MIMO广播信道的和速率表达式导出的系统吞吐量最大化,设计了最优接收机。为了连接这两种最优算法,我们使用迭代过程,通过虚拟信道计算将每次迭代的MU-MIMO信道转换为MU-MISO信道。最后,为了验证我们提出的解决方案,我们将其与现有的基于MMSE的迭代优化算法进行了比较。[2]中提出的算法不仅基于接收端,而且基于发送端的MMSE。获得的结果表明,在不引入额外复杂性和资源需求的情况下,获得了显著的收益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信