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

解码转发中继OFDM传输中的联合子载波配对和功率分配

Joint Subcarrier Pairing and Power Allocation for OFDM Transmission with Decode-and-Forward Relaying

Chih-Ning Hsu, Hsuan-Jung Su, Pin-Hsun Lin

摘要:

在本文中,一个点对点的正交频分复用(OFDM)系统的解码和转发(DF)中继被认为是。传输由两个跳组成。源在第一跳中发送,中继在第二跳中发送。每一跳占用一个时隙。中继是半双工的,并且能够在一个时隙中的特定子载波上解码消息,并且在下一个时隙中的不同子载波上重新编码和转发它。因此,每个消息在两跳中在一对子载波上传输。假设目的地能够组合来自源和中继的关于同一消息的信号。该算法的目标是通过联合优化子载波配对和每跳子载波上的功率分配来最大化系统的加权和速率。速率的加权要考虑不同子载波可以携带用于不同服务的信号的事实。总的和个人的电源和继电器的功率约束进行了研究。对于中继不发送的情况下,在一些子载波上,因为这样做不会提高加权和速率,我们进一步允许源发送新的消息在这些空闲的子载波上。据我们所知,这样的联合优化包括目的地组合尚未在文献中讨论。该问题首先制定为一个混合整数规划问题。然后通过连续松弛法将其转化为凸优化问题,并在对偶区域内求解。基于优化结果,算法,以实现可行的解决方案也被提出。仿真结果表明,该算法几乎达到了最优的加权和速率,并优于现有的方法在各种信道条件下。

英文摘要:

In this paper, a point-to-point Orthogonal Frequency Division Multiplexing (OFDM) system with a decode-and-forward (DF) relay is considered. The transmission consists of two hops. The source transmits in the first hop, and the relay transmits in the second hop. Each hop occupies one time slot. The relay is half-duplex, and capable of decoding the message on a particular subcarrier in one time slot, and re-encoding and forwarding it on a different subcarrier in the next time slot. Thus each message is transmitted on a pair of subcarriers in two hops. It is assumed that the destination is capable of combining the signals from the source and the relay pertaining to the same message. The goal is to maximize the weighted sum rate of the system by jointly optimizing subcarrier pairing and power allocation on each subcarrier in each hop. The weighting of the rates is to take into account the fact that different subcarriers may carry signals for different services. Both total and individual power constraints for the source and the relay are investigated. For the situations where the relay does not transmit on some subcarriers because doing so does not improve the weighted sum rate, we further allow the source to transmit new messages on these idle subcarriers. To the best of our knowledge, such a joint optimization inclusive of the destination combining has not been discussed in the literature. The problem is first formulated as a mixed integer programming problem. It is then transformed to a convex optimization problem by continuous relaxation, and solved in the dual domain. Based on the optimization results, algorithms to achieve feasible solutions are also proposed. Simulation results show that the proposed algorithms almost achieve the optimal weighted sum rate, and outperform the existing methods in various channel conditions.

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

↑