Concepedia

Publication | Closed Access

Optimal Resource Allocation for OFDMA Downlink Systems

502

Citations

7

References

2006

Year

TLDR

Resource allocation in OFDMA downlink systems is non‑convex, making optimal solutions computationally prohibitive and leaving dual‑decomposition solutions without guaranteed optimality. The study proposes efficient rate and power allocation algorithms for OFDMA downlink systems with single‑user tones. The authors address weighted sum rate maximization and weighted sum power minimization by applying Lagrange dual decomposition to solve both problems efficiently. With a practical number of tones, the duality gap is virtually zero, enabling efficient attainment of optimal solutions.

Abstract

This paper proposes efficient rate and power allocation algorithms for OFDMA downlink systems where each tone is taken by at most one user. Weighted sum rate maximization (WSRmax) and weighted sum power minimization (WSPmin) problems are considered. Since these resource allocation problems are non-convex, complexity of finding the optimal solutions is prohibitively high. This paper employs the Lagrange dual decomposition method to efficiently solve both optimization problems. Because of their non-convex nature, there is no guarantee for the solution obtained by the dual decomposition method to be optimal. However, it is shown that with practical number of tones, the duality gap is virtually zero and the optimal solutions can be efficiently obtained

References

YearCitations

Page 1