Improved Iterative Water-Filling with Rapid Convergence and Parallel Computation for Gaussian Multiple Access Channels

P. He, Lian Zhao, A. Anpalagan
{"title":"Improved Iterative Water-Filling with Rapid Convergence and Parallel Computation for Gaussian Multiple Access Channels","authors":"P. He, Lian Zhao, A. Anpalagan","doi":"10.1109/VETECS.2010.5493708","DOIUrl":null,"url":null,"abstract":"For a class of the important problems that seek to maximize the sum rate of the multi-user multiple input multiple output multiple access channel (MIMO MAC) and compute the corresponding optimal input distribution, we developed a more efficient algorithm for solving this class of the problems compared with currently known algorithms. The performance result of this new algorithm indicates that the proposed algorithm overcomes some of the weaknesses of other algorithms. One of the key weaknesses that it overcomes is that the well-known iterative water-filling algorithms cannot utilize the machinery of parallel computation, owning to their inherent structure defects. Not only does the proposed algorithm sufficiently utilizes the machinery of parallel computation, it also shows faster convergence compared with previous research results. Numerical results show that the same properties of the proposed algorithm are also effective for finding the optimal input policy due to its simplicity and fast convergence.","PeriodicalId":325246,"journal":{"name":"2010 IEEE 71st Vehicular Technology Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 71st Vehicular Technology Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VETECS.2010.5493708","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

For a class of the important problems that seek to maximize the sum rate of the multi-user multiple input multiple output multiple access channel (MIMO MAC) and compute the corresponding optimal input distribution, we developed a more efficient algorithm for solving this class of the problems compared with currently known algorithms. The performance result of this new algorithm indicates that the proposed algorithm overcomes some of the weaknesses of other algorithms. One of the key weaknesses that it overcomes is that the well-known iterative water-filling algorithms cannot utilize the machinery of parallel computation, owning to their inherent structure defects. Not only does the proposed algorithm sufficiently utilizes the machinery of parallel computation, it also shows faster convergence compared with previous research results. Numerical results show that the same properties of the proposed algorithm are also effective for finding the optimal input policy due to its simplicity and fast convergence.
基于快速收敛和并行计算的高斯多址信道改进迭代充水
对于一类寻求最大化多用户多输入多输出多接入信道(MIMO MAC)的和速率并计算相应的最优输入分布的重要问题,我们开发了一种比目前已知算法更有效的算法来解决这类问题。该算法的性能结果表明,该算法克服了其他算法的一些缺点。它克服的一个关键弱点是,众所周知的迭代注水算法由于其固有的结构缺陷而无法利用并行计算的机制。该算法不仅充分利用了并行计算的机制,而且与以往的研究结果相比,收敛速度更快。数值结果表明,该算法具有简单、快速收敛的特点,能够有效地找到最优输入策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信