多天线高斯广播信道和功率迭代注水

Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002. Pub Date : 2002-12-01 DOI:10.1109/ACSSC.2002.1197032

N. Jindal, S. Jafar, Sriram Vishwanath, A. Goldsmith

{"title":"多天线高斯广播信道和功率迭代注水","authors":"N. Jindal, S. Jafar, Sriram Vishwanath, A. Goldsmith","doi":"10.1109/ACSSC.2002.1197032","DOIUrl":null,"url":null,"abstract":"We consider the problem of maximizing sum rate on a multiple-antenna downlink in which the base station and receivers have multiple-antennas. The optimum scheme for this system was recently found to be \"dirty paper coding\". Obtaining the optimal transmission policies of the users when employing this dirty paper coding scheme is a computationally complex nonconvex problem. We use a \"duality\" to transform this problem into a convex multiple access problem, and then obtain a simple and fast iterative algorithm that gives us the optimum transmission policies.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"173 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"502","resultStr":"{\"title\":\"Sum power iterative water-filling for multi-antenna Gaussian broadcast channels\",\"authors\":\"N. Jindal, S. Jafar, Sriram Vishwanath, A. Goldsmith\",\"doi\":\"10.1109/ACSSC.2002.1197032\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of maximizing sum rate on a multiple-antenna downlink in which the base station and receivers have multiple-antennas. The optimum scheme for this system was recently found to be \\\"dirty paper coding\\\". Obtaining the optimal transmission policies of the users when employing this dirty paper coding scheme is a computationally complex nonconvex problem. We use a \\\"duality\\\" to transform this problem into a convex multiple access problem, and then obtain a simple and fast iterative algorithm that gives us the optimum transmission policies.\",\"PeriodicalId\":284950,\"journal\":{\"name\":\"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.\",\"volume\":\"173 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"502\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2002.1197032\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2002.1197032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 502

摘要

研究了基站和接收机具有多天线的多天线下行链路上的和速率最大化问题。最近发现该系统的最佳方案是“脏纸编码”。当采用这种脏纸编码方案时，获取用户的最优传输策略是一个计算复杂的非凸问题。我们利用“对偶性”将该问题转化为一个凸多址问题，然后得到一个简单快速的迭代算法，给出最优的传输策略。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Sum power iterative water-filling for multi-antenna Gaussian broadcast channels

We consider the problem of maximizing sum rate on a multiple-antenna downlink in which the base station and receivers have multiple-antennas. The optimum scheme for this system was recently found to be "dirty paper coding". Obtaining the optimal transmission policies of the users when employing this dirty paper coding scheme is a computationally complex nonconvex problem. We use a "duality" to transform this problem into a convex multiple access problem, and then obtain a simple and fast iterative algorithm that gives us the optimum transmission policies.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.

自引率

0.00%

发文量