Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICC.2012.6364086
Title: MIMO-OFDMA rate allocation and beamformer design using a multi-access channel framework
Authors: Khanafer, A.
Lim, T.J. 
Doostnejad, R.
Tang, T.
Issue Date: 2012
Source: Khanafer, A.,Lim, T.J.,Doostnejad, R.,Tang, T. (2012). MIMO-OFDMA rate allocation and beamformer design using a multi-access channel framework. IEEE International Conference on Communications : 2553-2558. ScholarBank@NUS Repository. https://doi.org/10.1109/ICC.2012.6364086
Abstract: This paper tackles the downlink user scheduling and transmit beamforming problems in MIMO-OFDMA by extending a recent algorithm that maximizes the weighted sum rate (WSR) to all users in MIMO flat fading channels. The proposed method has a complexity that is proportional to the number of OFDMA subcarriers, which makes it practically attractive. Having assigned users to each subcarrier and designed beamformers for each user in each subcarrier, it remains to find the best, in terms of rate maximization, adaptive modulation and coding (AMC) mode to use for each data stream. The latter problem is solved in the second half of the paper through viewing the channel from the base station to the k-th receiver as a multiple access channel (MAC) with Nk 'users', where Nk is the number of antennas at receiver k. The proposed method maps the available AMC modes to the space of allowed theoretical rates, using the signal-to-noise ratio (SNR) gap to capacity concept, and selects the operating point with the largest sum-rate. © 2012 IEEE.
Source Title: IEEE International Conference on Communications
URI: http://scholarbank.nus.edu.sg/handle/10635/112347
ISBN: 9781457720529
ISSN: 15503607
DOI: 10.1109/ICC.2012.6364086
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

1
checked on Feb 20, 2018

Page view(s)

17
checked on Feb 23, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.