A CONVEX APPROXIMATION METHOD FOR MULTIUSER MISO SUM RATE MAXIMIZATION UNDER DISCRETE RATE CONSTRAINTS
Refereed conference paper presented and published in conference proceedings


Full Text

Times Cited
Web of Science3WOS source URL (as at 16/09/2021) Click here for the latest count

Other information
AbstractThis paper considers a discrete sum rate maximization (DSRM) problem for transmit optimization in multiuser MISO downlink. Unlike many existing sum rate maximization designs, DSRM focuses on a scenario where each user's achievable rate can only be chosen from a given discrete rate set. This discrete rate-based design is motivated by the fact that practical communication systems can support only a finite number of combinations of modulation and coding schemes. We tackle the DSRM problem first by deriving a novel reformulation of DSRM, in which the discrete rate variables are absorbed by the objective function. Then, from this reformulation, an approximation algorithm based on convex optimization and iterative solution refinement is developed. Simulations results are provided to demonstrate the performance of the proposed algorithm compared with some state-of-the-art algorithms.
All Author(s) ListWai HT, Li Q, Ma WK
Name of ConferenceIEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)
Start Date of Conference26/05/2013
End Date of Conference31/05/2013
Place of ConferenceVancouver
Country/Region of ConferenceCanada
Detailed descriptionorganized by IEEE,
Year2013
Month1
Day1
PublisherIEEE
Pages4759 - 4763
eISBN978-1-4799-0356-6
ISSN1520-6149
LanguagesEnglish-United Kingdom
Keywordsdiscrete sum rate maximization; transmit beamforming; transmit optimization
Web of Science Subject CategoriesAcoustics; Engineering; Engineering, Electrical & Electronic

Last updated on 2021-17-09 at 01:25