arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1010.4690cs.ITmath.IT
收藏

中断约束下多用户MISO干扰信道加权和速率最大化的凸逼近方法

A convex approximation approach to Weighted Sum Rate Maximization of Multiuser MISO Interference Channel under outage constraints

Wei-Chiang Li, Tsung-Hui Chang, Che Lin, Chong-Yung Chi

摘要:

研究了中断约束下多用户多输入单输出干扰信道(MISO-IFC)的加权和速率最大化问题。带停电约束的加权和率最大化问题是一个非凸优化问题,很难求解。虽然可以通过在(离散化的)中断约束的可实现速率区域中找到所有帕累托最优速率元组来以穷举搜索方式最优地处理该问题,但是该方法受到过高的计算复杂性的影响,并且仅在发射机-接收机对的数量小时才可行。在本文中,我们提出了一个凸优化的近似方法有效地处理停电约束的加权和率最大化问题。所提出的近似方法包括解决一系列凸优化问题,因此可以有效地实现的邻域点方法。仿真结果表明,该方法可以产生接近最优的解决方案。

英文摘要:

This paper considers weighted sum rate maximization of multiuser multiple-input single-output interference channel (MISO-IFC) under outage constraints. The outage-constrained weighted sum rate maximization problem is a nonconvex optimization problem and is difficult to solve. While it is possible to optimally deal with this problem in an exhaustive search manner by finding all the Pareto-optimal rate tuples in the (discretized) outage-constrained achievable rate region, this approach, however, suffers from a prohibitive computational complexity and is feasible only when the number of transmitter-receive pairs is small. In this paper, we propose a convex optimization based approximation method for efficiently handling the outage-constrained weighted sum rate maximization problem. The proposed approximation method consists of solving a sequence of convex optimization problems, and thus can be efficiently implemented by interior-point methods. Simulation results show that the proposed method can yield near-optimal solutions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑