We study the problem of channel pairing and power allocation in a multichannel multihop relay network to enhance the end-to-end data rate. Both amplify-and-forward (AF) and decode-and-forward (DF) relaying strategies are considered. Given fixed power allocation to the channels, we show that channel pairing over multiple hops can be decomposed into independent pairing problems at each relay, and a sorted-SNR channel pairing strategy is sum-rate optimal, where each relay pairs its incoming and outgoing channels by their SNR order. For the joint optimization of channel pairing and power allocation under both total and individual power constraints, we show that the problem can be decoupled into two subproblems solved separately. This separation principle is established by observing the equivalence between sorting SNRs and sorting channel gains in the jointly optimal solution. It significantly reduces the computational complexity in finding the jointly optimal solution. It follows that the channel pairing problem in joint optimization can be again decomposed into independent pairing problems at each relay based on sorted channel gains. The solution for optimizing power allocation for DF relaying is also provided, as well as an asymptotically optimal solution for AF relaying. Numerical results are provided to demonstrate substantial performance gain of the jointly optimal solution over some suboptimal alternatives. It is also observed that more gain is obtained from optimal channel pairing than optimal power allocation through judiciously exploiting the variation among multiple channels. Impact of the variation of channel gain, the number of channels, and the number of hops on the performance gain is also studied through numerical examples.
Without the direct source-destination link, jointly optimizing CP and PA for DF relaying in a dual-hop OFDM system was investigated in @cite_6 and @cite_19 , where @cite_6 assumed a total power constraint shared between the source and the relay, and @cite_19 considered individual power constraints separately imposed on the source and the relay. In both cases, two-step separate CP and PA schemes were proposed and then proved to achieve the jointly optimal solution. For this dual-hop setup, it was shown that the optimal CP scheme is the one that maps the channels solely based on their channel gains independent of the optimal PA solution.
@cite_19 @cite_6
2152042368 1967453062
The combination of a multihop relay system and orthogonal frequency-division multiplexing (OFDM) modulation is a promising way to increase the capacity and coverage area. For the OFDM two-hop relay system with separate power constraints, joint subcarrier matching and power allocation is considered in this paper, which uses the ldquodecode-and-forwardrdquo relay strategy. The aforementioned problem can be formulated as a mixed binary integer programming problem, which is prohibitive when trying to find the global optimum. By separating the subcarrier matching and the power allocation, the optimal scheme, i.e., the optimal joint subcarrier matching and power allocation, is presented in this paper. After that, a suboptimal scheme with less complexity is also proposed, which can also be used to better understand the effects of power allocation. Simulation results show that the capacity of the optimal scheme is almost equivalent to the upper bound of the system capacity, and the capacity of the suboptimal scheme is close to that of the optimal scheme. In addition, simulation results also show that the one-to-one subcarrier matching is almost optimal, although it simplifies the system architecture. Orthogonal frequency division multiplexing (OFDM) multihop system is a promising way to increase capacity and coverage. In this paper, we propose an optimally joint subcarrier matching and power allocation scheme to further maximize the total channel capacity with the constrained total system power. First, the problem is formulated as a mixed binary integer programming problem, which is prohibitive to find the global optimum in terms of complexity. Second, by making use of the equivalent channel power gain for any matched subcarrier pair, a low-complexity scheme is proposed. The optimal subcarrier matching is to match subcarriers by the order of the channel power gains. The optimal power allocation among the matched subcarrier pairs is water-filling. An analytical argument is given to prove that the two steps achieve the optimally joint subcarrier matching and power allocation. The simulation results show that the proposed scheme achieves the largest total channel capacity as compared to the other schemes, where there is no subcarrier matching or power allocation.