Subcarrier allocation schemes for multiuser OFDM systems

Abstract

We consider the problem of subcarrier allocation to multiple users in a downlink OFDM access system. We study aIlocation schemes that provide varying degrees of tradeoff between (i) achieving throughput fairness among users, (ii) meeting tolerable latency requirements specified by the user applications, and (iii) achieving higher system capacity. The performance of the subcarrier allocation schemes is evaluated through simulation results.

Practical Radio Link Resource Allocation for Fair QoS-Provision on OFDMA Downlink with Partial Channel-State Information

“…In literature, authors often consider the case of full CSI with continuous modulation and zerooutage [3][4][5][6][7]. Some authors [3,6,7] consider the errorfree Shannon capacity so that r u,s = B log 2 (1 + γ u,s ). Such information-theoretical approaches provide upper bounds on the achievable performance but are not directly connected to real implementations.…”

“…The problem of resource allocation in OFDMA under fairness constraints continues to be an active research area [3][4][5][6][7]. Depending on the target application, the proposed solutions differ in the fairness requirement and in the adopted objective function.…”

Fair service provision in OFDMA with partial channel-state information

“…Resource allocation in OFDMA under fairness constraints is an active research area [1][2][3][4]. Depending on the application, the proposed solutions differ in the fairness constraints and in the objective function.…”

“…The optimization operates on some degrees of freedom like the subcarrier, rate and power allocation schemes. Authors often consider the case of full CSI with continuous modulation and zero-outage [1][2][3][4]. Some authors [1,2] consider the error-free Shannon capacity.…”

“…Authors often consider the case of full CSI with continuous modulation and zero-outage [1][2][3][4]. Some authors [1,2] consider the error-free Shannon capacity. Such information-theoretical approaches provide upperbounds on the achievable system performance but are not directly connected to real implementations.…”