By Topic

Fast optimal radio resource allocation in OFDMA system based on branch-and-bound method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhiwei Mao ; Dept. of Electr. Eng., Lakehead Univ., Thunder Bay, Ont., Canada ; Wang, X.M. ; Lin, J.

Our attention in this paper is focused on radio resource allocation (RRA) problems in orthogonal frequency division multiple access (OFDMA) systems. By assuming perfect channel estimation for all users, a fast optimal algorithm is developed to solve two classes of RRA problems: one class is to minimize the total transmission power at base station under the quality of service (QoS) constraint of each user, and the other class is to achieve maximum system data throughput under the constraints of maximal transmission power at base station and QoS of each user. The proposed algorithm is developed on the basis of the well-known branch-and-bound method. As shown in our results, the proposed algorithm offers the same performance as the optimal one achieved by using exhaustive full-search algorithm. However, the computational complexity involved in the proposed algorithm is significantly reduced.

Published in:

Communications, Computers and signal Processing, 2005. PACRIM. 2005 IEEE Pacific Rim Conference on

Date of Conference:

24-26 Aug. 2005