Joint Power and Subcarrier Allocation for Multicarrier Full-Duplex Systems

TL;DR

This paper proposes a low-complexity iterative algorithm for joint power and subcarrier allocation in multicarrier full-duplex systems, significantly improving throughput over existing methods.

Contribution

It introduces a novel suboptimal algorithm based on successive convex approximation for resource allocation in full-duplex multicarrier systems.

Findings

The proposed algorithm outperforms baseline schemes in throughput.

Simulation results demonstrate substantial throughput improvements.

The method offers a practical solution with reduced computational complexity.

Abstract

In this paper, we investigate resource allocation for multicarrier communication systems employing a full-duplex base station for serving multiple half-duplex downlink and uplink users simultaneously. We study the joint power and subcarrier allocation design for the maximization of the weighted sum throughput of the system. The algorithm design is formulated as a mixed combinatorial non-convex optimization problem and obtaining the globally optimal solution may require prohibitively high computational complexity. Therefore, a low computational complexity suboptimal iterative algorithm exploiting successive convex approximation is proposed to obtain a locally optimal solution. Simulation results confirm that the proposed suboptimal algorithm obtains a substantial improvement in system throughput compared to various existing baseline schemes.