Abstract
We consider the joint subcarrier and power allocation problem with the objective of maximizing the total utility of users in the uplink of an OFDMA system. Our formulation includes the problems of sum rate maximization, proportional fairness and max-min fairness as special cases. Unlike some previous algorithms, which are iterative and time consuming, our proposed one is non-iterative and with time complexity of only O(K N log2 N), where K and N are the number of users and subcarriers respectively. We prove that it provides a solution that is Pareto optimal within a large neighborhood of itself. Besides, we derive an efficiently computable upper bound of the optimal solution. Simulation results show that our algorithm is nearly optimal. © 2008 IEEE.
| Original language | English |
|---|---|
| Article number | 4524325 |
| Pages (from-to) | 1667-1675 |
| Journal | IEEE Transactions on Wireless Communications |
| Volume | 7 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - May 2008 |
Research Keywords
- Fairness
- Local Pareto optimal
- Non-iterative algorithm
- OFDMA
- Subcarrier and power allocation
- Uplink
- Upper bound
- Utility maximization
Fingerprint
Dive into the research topics of 'Low complexity subcarrier and power allocation for utility maximization in uplink OFDMA systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver