Multidimensional scheduling and resource allocation for MU-MIMO system over LTE-A network

Jayeta Biswas , Wei Ni , Ren Ping Liu , Iain B. Collings and Sanjay K. Jha
Department

of Computer Science and Engineering, University of New South Wales, Sydney, NSW, Australia. CSIRO Computational Informatics (CCI), Sydney, NSW, Australia. combination of consecutive sub-carriers. Although, this subcarrier grouping reduces the scheduling overhead in single antenna system, for MU-MIMO the complexity is still high to schedule independent user groups into each RB. Additionally, assignment of the RBs to the spatially separated user groups in frequency selective channel model requires extensive feedback of channel state information (CSI) to the eNB. Most of the existing MU-MIMO/OFDMA resource allocation methods do not provide QoS to the video applications. Indeed, MU-MIMO itself incurs high complexity to identify a user group that is spatially separated enough to increase the achievable rate on a particular sub-channel or RB. To reduce the complexity a suboptimal resource allocation was proposed in [1] where the key idea is to scale down the number of prospective users groups according to the channel correlation. However, it does not consider the modulation and coding scheme which nally control the actual data transmission rate. Thereafter, practical bit allocation approach was proposed in [2] which ignores the higher layer QoS needs of the users. In [3], adaptive radio resource allocation was introduced which builds a prioritized candidate user list depending on the urgency of the users and assign users from this list to the sub-carrier where they can achieve higher data rate. To reduce the complexity of exploring all the sub-carrier, a particular allocation is extended to consecutive sub-carrier as long as the user has data to transmit. However, in frequency selective channel model, the sub-carrier on which the user group gets the extension may not be favorable. Authors in [4], [5] also proposed similar sorts of QoS aware resource allocation in which there is no interaction between the QoS scheduling and spatial bit allocation. As a consequence there is no guarantee of how many bit will be allocated to these QoS sensitive users. Differently from the above methods, [6] introduced the idea of group priority. For each possible spatial group the priority is dened as the sum of individual users QoS priority. However, this priority metric does not consider the trafc arrival rate and the latency requirements of the users which are very important QoS metric for real time video application. In all these aforementioned approaches, the system overheads are not considered. To overcome this issue clustered feedback was proposed in [7] which groups the adjacent subcarriers and sends the feedback for these groups. Although, a design of QoS scheduling using clustered feedback is depicted in [7], it is not compatible with the MU-MIMO system. In this paper, we propose efcient scheduling and resource allocation algorithms which can provide a good trade-off between the multiple access gain and the scheduling overhead while maintaining the QoS guarantees of the real time video applications. Firstly, we design a QoS aware scheduling metric

AbstractThe joint application of orthogonal frequency division multiple access (OFDMA) and multiuser multiple-input multiple-output (MU-MIMO) is a key technology of Long Term Evolution-Advanced (LTE-A), that can can meet the throughput demand in frequency selective channel condition. However, due to complexity and signaling overhead issues the existing MUMIMO/OFDMA approaches hardly consider the the higher layer applications quality of services (QoS) needs e.g. the latency requirement. To address this complexity and performance tradeoff we provide useful insights into the complexity of exploring each sub-channel and then propose unied user grouping and resource allocation algorithms. The key idea is to efciently bundle the sub-channels over which potential user groups are likely to experience the same channel condition in a sequentially approach and adaptive approach. We further provide a feedback scheme that scales down the feedback overheads and the scheduling complexity without sacricing much in the QoS. Simulation results show that the proposed adaptive algorithm can reduce the computational complexity up to 64% while still preserving the delay and throughput performance within 95% of the high complexity algorithms. Moreover, the system performance loss is not much as long as 50% of the feedback is available. KeywordsMU-MIMO, LTE-A, QoS, frequency selective channel, delay, resource allocation.

I.

I NTRODUCTION

OFDMA is the prime multiple access technology of todays wireless wide area network (WWAN) i.e. LTE, WiMAX. OFDMA can increase the system capacity and handle the QoS needs of the users to a certain extent by assigning the users on their preferred sub-channels. To meet the appetite of mobile video trafc, MU-MIMO is the most prominent candidate solution for the next generation broadband wireless communication. It adds an extra degree of freedom which allows multiple users to transmit on the same time-frequency channel. This simultaneous transmission is limited by the number of transmit antenna available at the base station. Therefore, in single carrier system the multiple access scheme remains within the factor of transmit antennas. Consequently, it is obvious that the full multiple access gain can be realized only when both of these multiple access schemes: OFDMA and MU-MIMO are jointly adopted in scheduling and resource allocation phase. This full dimensional transmission technique has recently earned a great deal of attention due to its ability to meet the bandwidth demand and the QoS requirements as well. However, complexity turns out to be an issue for integrating this system into the dynamic scheduling structure of LTE network. In LTEs MAC layer frame structure, the minimum allocation unit is called resource block (RB) which is a

and develop a user grouping and RB allocation algorithm which considers each RB separately. Then we investigate the effect of xed RB grouping on this algorithm. By decreasing the total number of RB group the end to end delay can increase as high as 48% of the former algorithm. Therefore, to further improve the performance of the system we propose an adaptive grouping algorithm. The key idea is to group the RBs dynamically according to the QoS need and channel statistics of the users. Simulation results show that the delay performance of this adaptive grouping algorithm converges within the 95% of the aforementioned algorithm which does not use any grouping. Lastly, we introduce a feedback minimization scheme which can jointly reduce the amount of feedback overhead and scheduling complexity. According to the simulation study, with 30% feedback reduction the performance of the adaptive grouping algorithm does not deviate more than 5% while the complexity is also reduced by 30%. Contributions of this chapter are summarized as follows: New MU-MIMO\OFDMA scheduling and resource allocation algorithms referred to as multidimensional RB allocation with xed grouping (MRA-FG) and multidimensional RB allocation with adaptive grouping (MRA-AG) are proposed for LTE-A network. These complexity reduced algorithms exploit frequency selective channel model, unfold the problem of video playback delay and at the same time improve the system throughput. A feedback reduction mechanism is proposed which explicitly cuts down the number of potential user groups in the resource allocation decision without negotiating much in the system performance. Simulation results substantiate our proposed schemes from different important aspects, namely, the end to end delay, system throughput, fairness, scheduling complexity and the feedback overhead.

on top of this OFDMA subframe structure, multiple users can be assigned to the same RB. As a result, the subframe becomes a grid of three dimensional space which is depicted in Fig. 1. Here we consider a frequency selective channel model where
RB -> set of 12 subcarrier

RBN

User-A

User-C

User-F

User-H

Frequency dimension

RB3 RB2 RB1

User-E User-A User-A

User-F User-B User-B

User-G User-C User-C

User-H User-D User-D

7 OFDM Symbol

Time dimension

Spatial dimension

Fig. 1: Downlink Subframe channel gain of each user varies over different RBs. Let G denote the set of all possible user groups where each group contains NT users and B is the set of RB. Suppose a user group g G is scheduled on any nth subcarrier. The received signal vector of user k g on this nth sub-carrier is expressed as [8] yk,n = h k,n P n xn + zk,n (1)

where hk,n is the channel vector for user k g at subcarrier n, xn is the transmitted symbol vector of the eNB on subcarrier n, zk,n is the additive complex Gaussian noise with variance 2 on subcarrier n for user k g , and P n is the transmit k,n power vector on subcarrier n. Here, we assume the transmit power to be equally divided among the eNB antennas. () denotes the conjugate transpose. In this system model, we make use of the zero forcing (ZF) linear precoding [9] at the eNB. Therefore, the users devices do not need do the post processing of the received signal. The transmit spatial lter is represented by a weight vector wk,n mapping the k -th user data symbol on subcarrier n, sk,n , to the eNB antenna array outputs. Given that |g | users are selected for transmission, the output signal is given by [8]. xn =
k g

The rest of this chapter is organized as follows. In Section II, we present the system model. Our proposed algorithms are described in Section III. Section IV, explicates the feedback minimization scheme. The performance of the proposed algorithms are evaluated in Section V, before concluding in Section VI. II. S YSTEM MODEL

bk,n wk,n .

(2)

This section describes the system model used in this chapter. We consider the downlink transmission of LTE-A system with one eNB and K geographically scattered users which are experiencing varying channel conditions. The eNB is equipped with NT transmit antennas and each user is equipped with single receive antenna. In this model, a video server is connected to the eNB through EPC router and transmitting video stream to multiple users with variable bit rate. A. Physical Layer Model In LTE, the whole bandwidth is divided into physical resource blocks (RBs). Each of these RB block contains 12 consecutive sub-carriers in the frequency domain and 6 or 7 OFDM symbols in the time domain. The minimum allocation unit of a downlink frame is the RB. When, MU-MIMO is used

In each scheduling period, the ZF precoding matrix W n of the NT eNB antennas for the |g | selected users can be calculated by W n = Hn H nH n
1

Where H n is the |g | NT channel matrix on nth sub-carrier for user group g modeled with complex Gaussian entries. Let, consider any RB b B has n = 1...N consecutive sub-carrier and the aforementioned user group g is scheduled over this RB. Then, the achievable data rate of each user k g on RB b can be given by rk,g,b = BW log2 1 + k,g,n Pk,g,n . N n=1
N

(3)

Where BW is the channel bandwidth, Pk,g,n is the transmitted power of user k g on nth sub-carrier and and k,n is the

effective signal-to-noise ratio (SNR) of user k on the nth subcarrier which is represented as k,g,n = 1 H nH n
1 k,k

computational complexity of the scheduler. Therefore, we consider grouping of consecutive RBs. The number of RBs in a group is dened by the value of grouping factor. Algorithm 1 Multidimensional RB Allocation with Fixed Grouping(MRA-FG)
1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25:

(4)

[]k,k denotes the k -th diagonal element of a matrix. However, this achievable rate is an upper bound for the actual data transmission rate on a RB which can vary depending on the modulation and coding used. For example, rk,g,b1 and rk,g,b2 (rk,g,b1 < rk,g,b2 ) are achievable rate of user k on two consecutive RBs b1 and b2 with same bandwidth. Let consider, for a given modulation and coding (MCS) index IM CS the data transmission rate of user K over RB b1 is Rk,g,b1 rk,g,b1 . If the same MCS index is used for RB b2 , the data transmission rate will be the same as the RB b1 even though it has higher achievable rate. Therefore, the actual data transmission rate is upper bounded by the minimum achievable rate among the RBs when same modulation and coding is used. Rk,g,b1 = Rk,g,b2 rk,g,b1 . B. Medium access control (MAC) layer model The MAC layer of LTE eNB is mainly responsible for scheduling the arriving higher layer packets and allocating required number of physical RB to this scheduled users. Any user running a particular application is identied by an end to end connection identier. This identier is known as bearer [10]. According to the QoS requirement and users data subscription these bearers are classied into different priority class. At the eNB, there are separate queues for each bearer. In our system model, the head of line (HOL) delay of each queue associated with real time video applications is recorded and used in the scheduling and resource allocation decision so that delay sensitive applications can meet their video playback deadline. The CSI and the channel correlation of the users are also collected in this layer. III. M ULTIDIMENSIONAL R ESOURCE B LOCK A LLOCATION (5)

26:

gf = grouping factor; RB = set of available resource block; B = \\set of available resource block group; B = RB Grouping (RB, gf ) U = set of all user; D(u) = head of line packet waiting delay of user u U ; Qpkt (u) = queue length in packet of user u U ; Qbit (u) = queue length in bits of user u U ; for all b B do Rsingle (u) = single user rate of user u on RB b; U = ; for all u U do if Rsingle (u) (u) then U = U u; end if end for G = set of all possible user group using U ; u, R(u, g, b) = ib R(u, g, i) is the data rate of user u on group g G on RB group b ; M (g ) = Calculate Scheduling Metric using equation (7) g G; g = arg maxg M (g ) , g G S (u) = R(u, g , b) , u g Spkt (u) = f loor(S (u)/packet size), u g Qbit (u) = Qbit (u) S (u), u g ; Qpkt (u) = Qpkt (u) Spkt (u), u g ; Spkt D(u) = D(u) p=1 T (p), transmitted packet p, where T (p) is the inter arrival time of packet p and p + 1; end for

In this section, we propose new user scheduling and resource allocation algorithms which satisfy the latency requirements of the real time video applications as well as maximize the system throughput. In our proposed algorithms, we designed a scheduling metric that consider both of the users latency requirements and the channel correlation. Let consider, the estimated data transmission rate of any user k corresponding to group g on RB b is Rk,g,b and the HOL packet waiting delay of this user is Dk . Then the scheduling metric Mk,g,b is expressed as Mk,g,b = Rk,g,b Dk . (6)

In the rst step of the proposed MRA-FG algorithm shown in Algorithm 1 the RBs are grouped. When the value of grouping factor is one there is actually no grouping. Therefore, user groups are selected for all the individual RBs. Same MCS index is used within a RB group. Thus, the data transmission rate over this RB group is computed by summing the data transmission rate of the RBs within this group. Before allocating the RBs, the HOL delay and queue length of the users are initialized for the current scheduling period. In this algorithm we assume that the CSI over all the RBs are available. For any RB group, a candidate user list is constructed where the individual users data transmission is bounded by a threshold value. By ignoring these users with poor channel condition the numbers of candidate user groups are also truncated which reduces the complexity of exploring large number of user groups. The QoS requirements of the users which are not in the candidate list can still be satised by assigning to the other RBs where they have higher data rate. For each candidate group the scheduling metric is computed and the user group having maximum metric value is selected for this RB. According to the allocated bit the queue length and HOL delay of the selected users are updated. To

The scheduling metric for any user group g is computed by summing the metric for all the users of that group which is given by Mg,b = Rk,g,b Dk . (7)
k g

As the number of possible users group can be very large, nding the best user group for each RB would increase the

update the HOL delay, inter arrival time of the stored packets are used. All those algorithms in which xed QoS priority is used, a user may get high priority for all the RBs even if its requirement can be satised by one or two RBs. Thus, the fairness among the users is reduced. Therefore, we introduce this sequential update of the QoS parameter which provides more granularities to maintain the fairness among the users. This process is repeated for all the RB groups. Algorithm 2 RB Grouping (RB, gf )
1: 2: 3: 4: 5: 6: 7: 8:

Algorithm 3 Multidimensional RB Allocation with Adaptive Grouping (MRA-AG)

1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: 26:

GRP = Total Number of RB grp = celli(RB/gf ) for all i GRP do J = number of RB in the ith group for all j J do B (i) = add (i + (j 1))th RB to group i; end for end for Return B ;

The complexity of searching every RB is reduced when RBs are grouped that means the value of grouping factor is increased. However, increased grouping factor has a negative impact over the system throughput. For instance, it may happen that only one RB is enough to satisfy the requirements of a user but due to the group assignment this user gets allocation for more than one RB. Therefore, some RBs are wasted which can be assigned for other potential users. To beat this issue, we further propose a multidimensional RB allocation algorithm with adaptive grouping (MRA-AG) which is depicted in Algorithm 3. Instead of using xed grouping this algorithm groups the users dynamically according to the users QoS requirements and channel condition over the RBs. The basic principle of this algorithm is to expand the selected user group allocation of a RB to the successive RBs until this group remains a potential candidate for these RBs. At the beginning of the algorithm, user group for the starting RB is selected using the same selection process used in xed grouping algorithm. HOL delay and queue lengths are updated. Average HOL delay for the selected users group is computed and compared with the HOL delay of other unselected users. At the same time the estimated data rate of the selected user group over the next RB is also computed. If this average waiting delay is still greater than that of the unselected users and the estimated data rate over the next RB is within a factor of the data rate for the previous RB, this user group is also assigned for the next RB. QoS parameters are updated accordingly. This expansion process is repeated as long as the above two conditions are satised. This batch allocation is considered as a group allocation and same MCS index is used within this group. As the estimated data rate for the extended RB is within a certain factor of the rst RB in the group, bit error rate is very negligible. Therefore, it is ensured that no RB space is wasted by allocating it to already satised users. IV. F EEDBACK OVERHEAD

gf = grouping factor; U = set of all user; D(u) = head of line packet waiting delay of user u U ; Qpkt (u) = queue length in packet of user u U ; Qbit (u) = queue length in bits of user u U ; RB = set of available resource block; b = 1; N o of group = 0 while b <= length(RB ) do Rsingle (u) = single user rate of user u on RB b; U = ; for all u U do if Rsingle (u) (u) then U = U u; end if end for G = set of all possible user group using U ; u, R(u, g, b) = is the data rate of user u on group g G on RB group b ; M (g ) = Calculate Scheduling Metric using equation (7) g G; g = arg maxg M (g ) , g G Update Spkt , Qbit , D using steps (21-25) of MRA-AG; Extend = 1 ; bstart = start of the RB group = b; while Extend == 1 do Dselected = average HOL delay of selected user = if Dselected D(k : k / g ) and 1)
ug
ug H (u) |g |

R(u, g , b +
ug

R(u, g , bstart ) then

27: 28: 29: 30: 31: 32: 33: 34: 35: 36: 37:

Extend previous allocation to RB (b + 1) b = b + 1; Update Spkt , Qbit and D accordingly else Extend = 0 ; N o of group = N o of group + 1 break ; end if end while b = b + 1; end while

CSI information, in uplink frame total KBP bits are needed to send the feedback information to the eNB. Clustered feedback is a widely known feedback method for OFDMA system in which user sends feedback for their preferred RB group. This feedback method might be useful for algorithms with xed grouping factor. However, Algorithm 1 with higher grouping factor suffers from RB wastage which is expected to become more worst when clustered feedback is added on top of that. In the previous section, for algorithm MRA-FG and MRAAG we have introduced the idea of pre-screening of the single users data rate where for a particular RB the users with poor data rate are ltered out to reduce the complexity of

One of the major issues with the MU-MIMO enabled OFDMA system, is the excessive amount of CSI feedback required from each of the users over each RB. For example, with K number of user, B number of RBs and P bits for each

55 50 Average delay (msec) 45 40 35 30 25 20 6 grouping factor = 1 adaptive grouping grouping factor = 2 grouping factor = 3

2.4 grouping factor = 1 adaptive grouping grouping factor = 2 grouping factor = 3 Fairness Index

0.96 0.94 0.92 0.9 0.88 0.86 grouping factor = 1 adaptive grouping grouping factor = 2 grouping factor = 3

2.2 Throughput (Mbit/sec)

1.8

1.6 0.84 1.4 6 0.82 6

9 No of User

10

11

12

9 No of User

10

11

12

9 No of User

10

11

12

(a) Average Delay

(b) Throughput

(c) Fairness

Fig. 2: Performance comparison of MRA-AG and MRA-FG algorithm with grouping factor 1,2 and 3 the scheduling. Therefore, if there is no feedback information for theses users and RB combinations, performance would not be compromised too much. Therefore, we propose a new feedback scheme in which users only feedback their preferred RBs where the maximum number of RBs that the users can feedback is limited by a feedback limiting factor. Depending on the channel characteristic of the users this limiting factor can be varied to maintain a desired level of performance. V. P ERFORMANCE EVALUATION 3 the delay increases up to 48% while for MRA-AG algorithm the increase in delay is at most 5%. Fig. 2(b) compares the throughput loss in different grouping schemes. It represents that the throughput loss for grouping factor 3 and grouping factor 2 are respectively 23% and 17% in high load scenarios. This happens because of using same MCS index within a group which limits the data transmission rate to the worst RB of any group. As in MRA-AG algorithm RBs are only grouped when data transmission rate is within a percentage of the best RB, the throughput loss is reduced up to 70% compared to the former two xed grouping factors. To measure the fairness of the proposed algorithms we use the delay fairness index [11]. Fig. 2(c) represents the fairness among the users for different number of total users. MRA-FG algorithm with no grouping and MRA-AG algorithm achieves a fairness index which is very close to the ideal value of one. On the other hand the fairness index shows a decreasing pattern in MRA-FG algorithm for higher grouping factor. As in higher grouping factor some users get more preference irrespective of their actual QoS requirements, the fairness among the users get imbalanced. As the scheduling complexity is inversely proportional to the grouping factor, we measure the average number of RB per RB group for these algorithms which is depicted in Table I. It shows that for MRA-AG algorithm the average number of RB per RB group is 2.8 which fall between grouping factor 2 and 3. Therefore, the complexity of MRA-AG algorithm is almost similar to the MRA-FG algorithm with higher grouping factor. TABLE I: Average No. of RB per RB Group
RB Grouping Grouping factor =1 or no Grouping Grouping factor =2 Grouping factor =3 Adaptive grouping Number of RB per group 1 2 3 2.8

Our simulation is based on downlink MU-MIMO/OFDMA system over LTE-A network. We use OPNET Modeler to develop the simulation model. We consider frequency selective channel model where the channel gain varies over the RBs but has at response over the sub-carriers within a RB. The eNB is equipped with NR = 4 transmit antennas. K = 12 users are randomly distributed around the eNB. Each user is equipped with a single receive antenna. Depending on the channel conditions, the received SNR of the users varies between 5dB to 25dB. We use 5 MHz FDD PHY prole of the LTE-A. We create different scenarios by varying the total number of users, as well as the trafc load of the system. In this system model, eNB is connected to an external video server through an EPC router. We congure each user to sequentially request for a video clip from this server. At rst we compare the performance of the MRA-FG algorithm with the MRA-AG algorithm. For MRA-FG algorithm we use three different grouping factors, such as 1, 2 and 3. When grouping factor is 1 there is no grouping. Thus, the performance is high. After that we illustrate how the system performance and complexity of the MRA-AG algorithm uctuate in reduced feedback. Fig. 2(a) shows the average end to end delay performance of the xed grouping algorithm and adaptive grouping algorithm for varying number of users. When less number of users are present in the system, all the algorithms experiences almost same amount of delay. As the number of users becomes high with increased trafc load, the MRA-FG algorithm without any grouping experiences shorter delay compared to the other algorithms. With the increase of grouping factor the average delay experienced by each user also increases. This is due to the fact that with grouping factor 2 or 3 some of the users get more allocation even if they do not have much data to transmit which reduces the allocation for other users. Therefore, theses users packets have to wait longer period of time in the queue. This gure revels that in high load situation for grouping factor

To evaluate the effect of feedback reduction on the system performance and computational complexity, we investigate two reduced feedback scenario for MRA-AG algorithm where the maximum number of RB that the user can feedback are respectively 2/3 and 1/3 of the total RBs. Note that, when reduced feedback is used in MRA-AG algorithm, no further pre-ltering of the users is done. Fig. 3(a) shows how the delay gets affected in reduced feedback. The gure revels that when the number of user is

45 feedback 1/3 RB feedback 2/3 RB full feedback

2.4 2.3 2.2 Throughput (Mbit /sec) 2.1 2 1.9 1.8 1.7 1.6 1.5 feedback 1/3 RB feedback 2/3 RB full feedback Fairness Index

0.96 0.94 0.92 0.9 0.88 0.86 0.84 6 feedback 1/3 RB feedback 2/3 RB full feedback

40 Average delay (msec)

35

30

25

20 6

9 No of User

10

11

12

1.4 6

9 No of User

10

11

12

9 No of User

10

11

12

(a) Average Delay

(b) Throughput

(c) Fairness

Fig. 3: Effect of reduced feedback on the performance of MRA-AG algorithm increased in the system, MRA-AG with reduced feedback experience longer delay compared to the full feedback. Because in reduced feedback, user having poor channel condition over most of the RBs may fail to get allocation in any of the preferred RBs even it is experiencing longer delay. In this gure it is also noticeable that when feedback is reduced to 2/3 of the total RB the increase in delay is about 5% while it increase up to 23% with 1/3 feedback. Fig. 3(b) illustrates the throughput loss due to the feedback reduction. As the feedback amount is reduced to 1/3 number of total RB, the loss in throughput increases tremendously. When some RB is deeply faded, it is very highly probable that no user will send feedback for this RB which results in throughput loss. This aspect becomes worst when feedback is reduced too much. Fig. 3(c) shows that fairness among the users also gets affected by the feedback reduction. In reduced feedback users with poor channel condition needs to experience longer delay before becoming eligible to get allocation into their preferred RBs. Therefore, when feedback is reduced too much the fairness index shows decreasing pattern. TABLE II: Average No. of candidate user for each RB
Feedback amount Full feedback Feedback 2/3 RB Feedback 1/3 RB 6 user 6 4 2.2 8 user 8 5.333 3.26 10 user 10 7.3333 4.8666 12 user 12 8 5.4

that utilize two different RB grouping techniques to cut-off the complexity of exploring each individual RB. In these proposed algorithms we jointly consider the QoS requirements and channel correlation of the users so that the trade-off between QoS and system throughput is also balanced. Simulation results indicate that using MRA-AG algorithm, the complexity of RB exploring can be reduced up to 64% while still preserving the QoS performance within 95% of the high complexity algorithms that do not use any grouping. We also investigate the feedback overheads and design a reduced feedback scheme that is adaptable with the aforesaid MRA-AG algorithm. The performance evaluations illustrate that the system performance loss is not much as long as 50% of the feedback is available. R EFERENCES
[1] P. Chan and R. Cheng, Capacity maximization for zero-forcing MIMOOFDMA downlink systems with multiuser diversity, IEEE Transactions on Wireless Communications, vol. 6, pp. 18801889, May 2007. C. Zhong, C. Li, R. Zhao, L. Yang, and X. Gao, Dynamic resource allocation for downlink multi-user MIMO-OFDMA/SDMA systems, in Proc. of IEEE ICC09, June 2009, pp. 15. C.-F. Tsai, C.-J. Chang, F.-C. Ren, and C.-M. Yen, Adaptive radio resource allocation for downlink OFDMA/SDMA systems with multimedia trafc, IEEE Transactions on Wireless Communications, vol. 7, no. 5, pp. 17341743, May 2008. C. Huang, C.-Y. Chang, P.-H. Chen, and M.-H. Wu, Performance evaluation of SDMA based mobile WiMAX systems, in Proc. of IEEE IWCMC08, Aug 2008, pp. 10421046. A. Zubow, J. Marotzke, D. Camps-Mur, and X. Perez-Costa, sGSA: an SDMA-OFDMA scheduling solution, in Proc. of EW12, April 2012. T. Maciel and A. Klein, On the performance, complexity, and fairness of suboptimal resource allocation for multiuser MIMO-OFDMA systems, IEEE Transactions on Vehicular Technology, vol. 59, no. 1, pp. 406419, Jan 2010. P. Svedman, S. Wilson, L. Cimini, and B. Ottersten, Opportunistic beamforming and scheduling for OFDMA systems, IEEE Transactions on Communications,, vol. 55, no. 5, pp. 941952, May 2007. Z. Rosberg, A. Cantoni, and R. Liu, Resource allocation for QoS multiuser MIMO with zero forcing and MMSE beamforming, in Proc. of IWQoS10, June 2010, pp. 1 6. T. Yoo and A. Goldsmith, On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming, IEEE Journal on Selected Areas in Communications, vol. 24, no. 3, pp. 528541, March 2006. H. Ekstrom, QoS control in the 3GPP evolved packet system, IEEE Communications Magazine, vol. 47, no. 2, pp. 7683, february 2009. J. Biswas, R. P. Liu, W. Ni, I. Collings, and S. Jha, Joint channel and delay aware user scheduling for multiuser MIMO system over LTE-A network, in Proc. of IWQoS13, 2013, pp. 18.

[2]

[3]

[4]

[5] [6]

The complexity of exploring the users group over each RB is proportional to the number of candidate user per RB. In reduced feedback this number of candidate users per RB is a varying factor which is depicted in Table II. It shows that number of candidate user is reduced at least 33% for 2/3 of RB feedback. Therefore, from all the above performance measures it can be concluded that reducing the feedback up to 2/3 of the total RBs, can reduce the computational complexity without sacricing too much in the performance. VI. C ONCLUSION

[7]

[8]

[9]

[10]

In this paper, we study the performance and complexity trade-off of the multi-carrier spatial user grouping and resource allocation of the MU-MIMO\OFDMA system in frequency selective channel conditions. We propose efcient algorithms

[11]