761 research outputs found
Jointly Optimal Channel and Power Assignment for Dual-Hop Multi-channel Multi-user Relaying
We consider the problem of jointly optimizing channel pairing, channel-user
assignment, and power allocation, to maximize the weighted sum-rate, in a
single-relay cooperative system with multiple channels and multiple users.
Common relaying strategies are considered, and transmission power constraints
are imposed on both individual transmitters and the aggregate over all
transmitters. The joint optimization problem naturally leads to a mixed-integer
program. Despite the general expectation that such problems are intractable, we
construct an efficient algorithm to find an optimal solution, which incurs
computational complexity that is polynomial in the number of channels and the
number of users. We further demonstrate through numerical experiments that the
jointly optimal solution can significantly improve system performance over its
suboptimal alternatives.Comment: This is the full version of a paper to appear in the IEEE Journal on
Selected Areas in Communications, Special Issue on Cooperative Networking -
Challenges and Applications (Part II), October 201
Jointly Optimal Channel Pairing and Power Allocation for Multichannel Multihop Relaying
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.Comment: 15 pages. IEEE Transactions on Signal Processin
Jointly Optimal Channel Pairing and Power Allocation for Multichannel Multihop Relaying
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.Comment: 15 pages. IEEE Transactions on Signal Processin
Joint Subcarrier Pairing and Power Allocation for OFDM Transmission with Decode-and-Forward Relaying
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.Comment: 33 pages, 11 figure
Weighted Sum Rate Maximization for Downlink OFDMA with Subcarrier-pair based Opportunistic DF Relaying
This paper addresses a weighted sum rate (WSR) maximization problem for
downlink OFDMA aided by a decode-and-forward (DF) relay under a total power
constraint. A novel subcarrier-pair based opportunistic DF relaying protocol is
proposed. Specifically, user message bits are transmitted in two time slots. A
subcarrier in the first slot can be paired with a subcarrier in the second slot
for the DF relay-aided transmission to a user. In particular, the source and
the relay can transmit simultaneously to implement beamforming at the
subcarrier in the second slot. Each unpaired subcarrier in either the first or
second slot is used for the source's direct transmission to a user. A benchmark
protocol, same as the proposed one except that the transmit beamforming is not
used for the relay-aided transmission, is also considered. For each protocol, a
polynomial-complexity algorithm is developed to find at least an approximately
optimum resource allocation (RA), by using continuous relaxation, the dual
method, and Hungarian algorithm. Instrumental to the algorithm design is an
elegant definition of optimization variables, motivated by the idea of
regarding the unpaired subcarriers as virtual subcarrier pairs in the direct
transmission mode. The effectiveness of the RA algorithm and the impact of
relay position and total power on the protocols' performance are illustrated by
numerical experiments. The proposed protocol always leads to a maximum WSR
equal to or greater than that for the benchmark one, and the performance gain
of using the proposed one is significant especially when the relay is in close
proximity to the source and the total power is low. Theoretical analysis is
presented to interpret these observations.Comment: 8 figures, accepted and to be published in IEEE Transactions on
Signal Processing. arXiv admin note: text overlap with arXiv:1301.293
- …