Low Complexity User Scheduling, Ordering and Transmit Covariance Matrix Optimization Algorithms for Successive Zero-Forcing Precoding.Image.Marked资料.pdf
- 1、本文档共18页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Low Complexity User Scheduling, Ordering and Transmit Covariance Matrix Optimization Algorithms for Successive Zero-Forcing Precoding.Image.Marked资料
Wireless Pers Commun (2014) 75:2467–2484
DOI 10.1007/s11277-013-1477-1
Low Complexity User Scheduling, Ordering
and Transmit Covariance Matrix Optimization
Algorithms for Successive Zero-Forcing Precoding
Shreeram Sigdel · Witold A. Krzymie´n
Published online: 15 November 2013
© Springer Science+Business Media New York 2013
Abstract In this paper we consider user scheduling, ordering and transmit covariance matrix
optimization problems under successive zero-forcing (SZF) precoding for multiuser multiple-
input multiple-output downlink. We propose a heuristic user scheduling metric and an inter-
mediate user grouping technique to develop a low complexity greedy scheduling algorithm.
A suboptimal user ordering technique is also proposed for transmit covariance matrix opti-
mization under SZF. Proposed algorithm is of low complexity, but performs closely to the
highly complex exhaustive search algorithm. For transmit covariance optimization under
SZF, a dirty paper coding based algorithm has been previously proposed, which is computa-
tionally very complex. In this paper, we propose a suboptimal but much simplified algorithm,
which employs an iterative procedure similar to a known multiple access channel (MAC)
covariance optimization algorithm, but does not involve multiple levels of covariance matrix
transformations. With the proposed suboptimal user ordering the exhaustive search through
all possible user orders is avoided during transmit covariance matrix optimization resulting
in a significant complexity reduction, and without a significant performance penalty. Simu-
lation results show that the proposed algorithm performs very close to the known algorithm
in the low SNR region.
Keywords Multiuser MIMO downlink · Successive zero-forcing precoding · User
scheduling and ordering · Transmit covariance matrix optimization · Reduced complexity
This work was in part presented at and published in the proceedings of the 69th IEEE Vehicul
您可能关注的文档
- litigating the public interest in the gilded age common law.Image.Marked资料.pdf
- Low back pain and kidney mobility local osteopathic fascial manipulation decreases pain perception and improves renal mobility.Image.Marked资料.pdf
- Low-grazing angles scattering of electromagnetic waves from one-dimensional natural surfaces Rigorous and approximate theories.Image.Marked资料.pdf
- LS变频器Starvert-iG5说明书.pdf
- lt;em gt;basic dutch a grammar and workbook lt;em gt;. by oosterhoff, jenneke a.Image.Marked资料.pdf
- LS产电LV-S100 系列变频器中文说明书.pdf
- LU315W-560W系列螺杆空压机使用及维护说明书.pdf.pdf
- 合同范本之室外管网施工合同.docx
- 合同范本之如何看施工合同.docx
- 合同范本之商品房买卖合同代理词.docx
文档评论(0)