Low complexity multiuser MIMO scheduling for weighted sum rate maximization

Ganesh Venkatraman, Antti Tölli, Janne Janhunen, M. Juntti
{"title":"Low complexity multiuser MIMO scheduling for weighted sum rate maximization","authors":"Ganesh Venkatraman, Antti Tölli, Janne Janhunen, M. Juntti","doi":"10.5281/ZENODO.43888","DOIUrl":null,"url":null,"abstract":"The paper addresses user scheduling schemes for the multiuser multiple-input multiple-output (MU-MIMO) transmission with the objective of sum rate maximization (SRM) and the weighted counterpart in a single cell scenario. We propose a low complex product of independent projection displacements (PIPD) scheduling scheme, which performs the user selection for the MU-MIMO system with significantly lower complexity in comparison with the existing successive projections (SP) based designs. The PIPD scheme uses series of independent vector projections to evaluate the decision metrics. In addition, we also propose a heuristic algorithm of weighted scheduling, addressing the weighted sum rate maximization (WSRM) objective, which can be used with any scheduling algorithm. The performance of the weighted scheduling schemes are studied with the objective of minimizing the queues.","PeriodicalId":198408,"journal":{"name":"2014 22nd European Signal Processing Conference (EUSIPCO)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 22nd European Signal Processing Conference (EUSIPCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5281/ZENODO.43888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

The paper addresses user scheduling schemes for the multiuser multiple-input multiple-output (MU-MIMO) transmission with the objective of sum rate maximization (SRM) and the weighted counterpart in a single cell scenario. We propose a low complex product of independent projection displacements (PIPD) scheduling scheme, which performs the user selection for the MU-MIMO system with significantly lower complexity in comparison with the existing successive projections (SP) based designs. The PIPD scheme uses series of independent vector projections to evaluate the decision metrics. In addition, we also propose a heuristic algorithm of weighted scheduling, addressing the weighted sum rate maximization (WSRM) objective, which can be used with any scheduling algorithm. The performance of the weighted scheduling schemes are studied with the objective of minimizing the queues.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
加权和速率最大化的低复杂度多用户MIMO调度
本文研究了以和速率最大化(SRM)为目标的多用户多输入多输出(MU-MIMO)传输的用户调度方案及其加权对应方案。我们提出了一种低复杂度的独立投影位移积(PIPD)调度方案,与现有的基于连续投影(SP)的设计相比,该方案可以显著降低MU-MIMO系统的用户选择复杂度。PIPD方案使用一系列独立的向量投影来评估决策指标。此外,我们还提出了一种加权调度的启发式算法,解决了加权和速率最大化(WSRM)的目标,该算法可用于任何调度算法。以最小化队列为目标,研究了加权调度方案的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An improved chirp group delay based algorithm for estimating the vocal tract response Bone microstructure reconstructions from few projections with stochastic nonlinear diffusion Adaptive waveform selection and target tracking by wideband multistatic radar/sonar systems Exploiting time and frequency information for Delay/Doppler altimetry Merging extremum seeking and self-optimizing narrowband interference canceller - overdetermined case
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1