arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.04861cs.ITmath.IT

多播中继网络中的秩二波束成形与功率分配

Rank-Two Beamforming and Power Allocation in Multicasting Relay Networks

Adrian Schad, Ka L. Law, Marius Pesavento

AI总结:

针对单组多播放大转发中继网络,提出利用两路联合处理、Alamouti 编码和直连链路的秩二波束成形与功率分配迭代算法,显著提升最低接收服务质量。

摘要:

本文提出一种新颖的单组多播中继波束成形方案。我们假设一个源通过多个放大转发中继向多个目的地传输公共消息。为增加波束成形设计中的自由度数量,各中继联合处理两个接收信号,并通过两个不同波束发送 Alamouti 空时分组码。此外,与文献中现有中继多播方案不同,我们考虑了从源到目的地的直连链路。我们的目标是通过选择合适的中继权重以及网络中功率资源的理想分配,使最低接收服务质量最大化。为求解相应优化问题,我们提出一种迭代算法,该算法求解原始非凸优化问题的一系列凸近似。仿真结果表明,与文献中现有中继多播方案以及一种基于流行半定松弛技术的算法相比,所提方法具有显著的性能提升。

英文摘要:

In this paper, we propose a novel single-group multicasting relay beamforming scheme. We assume a source that transmits common messages via multiple amplify-and-forward relays to multiple destinations. To increase the number of degrees of freedom in the beamforming design, the relays process two received signals jointly and transmit the Alamouti space-time block code over two different beams. Furthermore, in contrast to the existing relay multicasting scheme of the literature, we take into account the direct links from the source to the destinations. We aim to maximize the lowest received quality-of-service by choosing the proper relay weights and the ideal distribution of the power resources in the network. To solve the corresponding optimization problem, we propose an iterative algorithm which solves sequences of convex approximations of the original non-convex optimization problem. Simulation results demonstrate significant performance improvements of the proposed methods as compared with the existing relay multicasting scheme of the literature and an algorithm based on the popular semidefinite relaxation technique.

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

↑