Efficient Adaptive Resource Allocation for Multiuser OFDM Systems with Minimum Rate Constraints

Xu, Wei; Zhao, Chunming; Zhou, Peng; Yang, Yijin

doi:10.1109/icc.2007.847

Cited by 29 publications

(29 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The small degradation in performance observed for high data rate requirements can be compensated by the low complexity of the PROP algorithm compared with the method employed to obtain the optimal solution. APPENDIX A COMPUTATIONAL COMPLEXITY TO OBTAIN THE OPTIMAL SOLUTION OF JRAPAP As in [10] and [11], we consider summations, multiplications, and comparisons as the most relevant and timeconsuming operations. The computational complexity considered here is the worst-case one that gives an upper bound on the computational resources required by an algorithm and is represented by the asymptotic notation O(·).…”

Section: Discussionmentioning

confidence: 99%

“…Although, the optimal solution with EPA is shown in [10], the authors do not compare the outage rate 1 between the optimal and suboptimal solutions. A marginal improvement in spectral efficiency over the suboptimal solution of [10] is presented by [11]. By modifying the subcarrier reallocation part of the suboptimal solution proposed in [10], the authors in [12] are able to obtain marginal gains in outage rate compared to [10].…”

Section: Literature Review and Main Contributionsmentioning

confidence: 99%

See 1 more Smart Citation

Joint Resource Block Assignment and Power Allocation Problem for Rate Maximization With QoS Guarantees in Multiservice Wireless

Maurício

Lima

Sousa³

et al. 2016

JCIS

View full text Add to dashboard Cite

Abstract-We formulate the resource and power assignment problem of maximizing the spectral efficiency of a wireless system subject to user satisfaction constraints in the multiservice scenario. We show that although this optimization problem is nonlinear, it can be converted to an integer linear program. In this way, standard techniques can be used to obtain the optimal solution. Motivated by the high computational complexity of the optimal solution, we propose a fast suboptimal algorithm. Simulation results show that our proposal achieves near-optimal performance in low and medium loads with a much lower computational complexity compared with the algorithm used to obtain the optimal solution. Therefore, our proposed algorithm achieves a good tradeoff between performance and computational complexity. We also show that the addition of adaptive power allocation renders significant performance gains in the considered scenario.Index Terms-Multiservice, quality of service (QoS), rate maximization, resource and power assignment.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Literature Review and Main Contributionsmentioning

confidence: 99%

Joint Resource Block Assignment and Power Allocation Problem for Rate Maximization With QoS Guarantees in Multiservice Wireless

Maurício

Lima

Sousa³

et al. 2016

JCIS

View full text Add to dashboard Cite

show abstract

“…Several solutions have been presented in the literature to adaptively allocate subcarriers, rate and power to users for multiclass OFDMA systems with various QoS [6]- [9]. The purpose of a resource allocation algorithm is to share the system's resources among the various users efficiently, in which user's service requests should be taken into account.…”

Section: Introductionmentioning

confidence: 99%

Qos-aware discrete bit loading for OFDMA networks

Sani

Abbasfar

2013

2013 International Conference on Computing, Networking and Communications (ICNC)

View full text Add to dashboard Cite

Performanceoptimization of practical communication networks should be performed by considering some practical constraints such as limitation of maximum transmitted power, discrete bit allocation to carriers and users, and quality of service (QoS) requirements for different users.In this paper, we provide the optimum resource allocation solution for an OFDMA downlink in which subcarriers are loaded with discrete number of bits. Using minimum data rate with a certain BER as the criterion for the QoS, the optimization makes sure that the QoS of all users are satisfied. We analyze the complexity of this solution and propose a suboptimum solution with much less complexity. These solutions are compared with existing methods using simulation results.

show abstract

“…For the single access point (AP) system, the optimal power allocation for maximizing total capacity is well known as the "water-filling" power allocation across SCs [1]- [3], derived via Lagrange dual method [4] with a high complexity. In [5] and [6], sub-optimal schemes were proposed by equally distributing transmit power across all SCs, which has lower complexity at a cost of the total capacity. The optimal and efficient water-filling algorithm for a single AP system was studied in [7], where all the SCs with non-positive power are eliminated at each iteration, and the power on the remaining SCs are recomputed at the next iteration.…”

Section: Introductionmentioning

confidence: 99%

Optimal and efficient power allocation for OFDM non-coherent cooperative transmission

Chen

et al. 2012

2012 IEEE Wireless Communications and Networking Conference (WCNC)

View full text Add to dashboard Cite

Abstract-In this paper, we study the subchannel (SC) power allocation for orthogonal frequency division multiplexing (OFDM) multiple access points (APs) systems with non-coherent cooperative transmission. The objective is to maximize the total capacity under per-AP power constraints. It can be proved that the optimal solution can be obtained by the combination of an optimal SC partition search and the power allocation across SCs for each feasible partition. Existing work exhaustively searched the optimal SC partition and used Lagrange dual method to compute the power allocation across SCs. Since the entire complexity increases exponentially with the number of SCs, the existing method is unsuitable for practical implementation. In this paper, we propose a novel optimal power allocation algorithm for non-coherent cooperative transmission with a much lower complexity. Firstly, a concept of "cut-off SC" is proposed for searching the optimal SC partition. Then, an efficient optimal power allocation algorithm across SCs is proposed for any given cut-off SC. Simulation results demonstrate that the proposed algorithm is optimal with a polynomial complexity, and ends within an acceptable number of iterations.

show abstract

Efficient Adaptive Resource Allocation for Multiuser OFDM Systems with Minimum Rate Constraints

Cited by 29 publications

References 14 publications

Joint Resource Block Assignment and Power Allocation Problem for Rate Maximization With QoS Guarantees in Multiservice Wireless

Joint Resource Block Assignment and Power Allocation Problem for Rate Maximization With QoS Guarantees in Multiservice Wireless

Qos-aware discrete bit loading for OFDMA networks

Optimal and efficient power allocation for OFDM non-coherent cooperative transmission

Contact Info

Product

Resources

About