Weighted Sum Rate Maximization for Downlink OFDMA with Subcarrier-pair based Opportunistic DF Relaying
Tao Wang, Francois Glineur, Jerome Louveaux, Luc Vandendorpe

TL;DR
This paper introduces a novel subcarrier-pair based opportunistic DF relaying protocol for downlink OFDMA, optimizing weighted sum rate with a polynomial-complexity algorithm, showing significant performance gains especially with relay proximity and low power.
Contribution
It proposes a new relay protocol with beamforming, along with an efficient resource allocation algorithm, improving weighted sum rate in downlink OFDMA systems over existing methods.
Findings
Proposed protocol outperforms benchmark in weighted sum rate.
Performance gain is significant when relay is close to source.
Algorithm effectively optimizes resource allocation with polynomial complexity.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
