arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新，休息一下吧，周末愉快~~
arXiv 1708.04750cs.ITmath.IT
收藏

下行链路多小区MU-MISO OFDMA网络中的协调线性预编码

Coordinated Linear Precoding in Downlink Multicell MU-MISO OFDMA Networks

Mirza Golam Kibria, Hidekazu Murata, Susumu Yoshida

备注：
arXiv admin note: substantial text overlap with arXiv:1309.4203
发表信息：
Proc. IEEE Vehicular Technology Conference (IEEE VTC)., Las Vegas, USA, Sep. 2013
阅读 PDF
arXiv 页面 ↗HTML 原文 ↗

摘要：

研究了下行链路多小区多用户正交频分多址（OFDMA）网络中的协作线性预编码。提出了一种简单、快速、可证明收敛的算法，该算法在每个基站（BS）发射功率约束下最大化加权和速率。利用序贯参数凸逼近（SPCA）方法，将非凸加权和率最大化（WSRM）问题逼近到一个可解的凸形式。通过适当的变量变换、一阶线性逼近和双曲约束变换等方法，得到了优化问题的目标函数和约束条件的二阶锥规划（SOCP）公式，与已知的迭代WSRM算法相比，该算法收敛于次优解所需的迭代次数较少.最后，数值结果证明了所提出的算法的有效性和优越性。

英文摘要：

This paper considers coordinated linear precoding in downlink multicell multiuser orthogonal frequency-division multiple access (OFDMA) network. A less-complex, fast and provably convergent algorithm that maximizes the weighted sum-rate with per base station (BS) transmit power constraint is formulated. We approximate the nonconvex weighted sum- rate maximization (WSRM) problem with a solvable convex form by means of sequential parametric convex approximation (SPCA) approach. The second order cone program (SOCP) formulations of the objective function and constraints of the optimization problem are derived through proper change of vari- ables, first order linear approximation and hyperbolic constraints transformation, etc. The algorithm converges to the suboptimal solution taking fewer number of iterations in comparison to other known iterative WSRM algorithms. Finally, numerical results are presented to justify the effectiveness and superiority of the proposed algorithm.

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

↑