Abstract
We consider the weighted sum-rate maximization problem in downlink Orthogonal Frequency Division Multiple Access (OFDMA) systems. Motivated by the increasing popularity of OFDMA in future wireless technologies, a low complexity suboptimal resource allocation algorithm is obtained for joint optimization of multiuser subcarrier assignment and power allocation. The algorithm is based on an approximated primal decomposition-based method, which is inspired from exact primal decomposition techniques. The original nonconvex optimization problem is divided into two subproblems which can be solved independently. Numerical results are provided to compare the performance of the proposed algorithm to Lagrange relaxation based suboptimal methods as well as to optimal exhaustive search-based method. Despite its reduced computational complexity, the proposed algorithm provides close-to-optimal performance
Highlights
Orthogonal Frequency Division Multiple Access (OFDMA) plays a major role in the physical layer specifications of future wireless technologies (e.g., 3G-LTE, WIMAX, IMT-A) [1,2,3,4]
Motivated by the increasing popularity of OFDMA in future wireless technologies, a low complexity suboptimal resource allocation algorithm is obtained for joint optimization of multiuser subcarrier assignment and power allocation
The algorithm is based on an approximated primal decomposition-based method, which is inspired from exact primal decomposition techniques
Summary
Orthogonal Frequency Division Multiple Access (OFDMA) plays a major role in the physical layer specifications of future wireless technologies (e.g., 3G-LTE, WIMAX, IMT-A) [1,2,3,4]. A suboptimal method for characterizing the achievable rate region of the two-users frequency division multiple access (FDMA) channel have been presented in [10]. A Lagrangian relaxation-based method has been proposed in [13] for the weighted sum-rate maximization problem. The optimality of the final value cannot be guaranteed due to the nonconvexity of the problem, the simulations show that rate-region achieved by the proposed algorithm exactly matches with the one obtained using optimal exhaustive search algorithm.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
