|
|
|
| A Low Complexity Maximum Weighted Sumrate Based Scheduling Algorithm in Multiuser MIMO System |
| CHEN Lei, SHE Feng, LUO Han-wen |
(School of Electronic, Information and Electrical Engineering,
Shanghai Jiaotong University, Shanghai 200240, China) |
|
|
|
Abstract To solve the problem that the dirtypaper coding based iterative waterfilling algorithm to maximize weighted sumrate has high complexity in multiuser multiinput multioutput (MIMO) system, a low complexity zeroforcing dirtypaper coding based multiuser resource scheduling algorithm was proposed. Under the transmit power constraint, the proposed algorithm combines power allocation and user scheduling. Users are selected in sequence based on the userselection parameters which are constructed using the channel state information. The proposed algorithm only needs finite repetitions, and can drop off those users with poor channel quality through the userrejection criteria. Therefore the complexity is reduced. The simulation results show that, compared to the iterative waterfilling algorithm, the proposed algorithm achieves more than 90% weighted sumrate of the iterative waterfilling algorithm under similar simulation conditions. With the increasing user number the weighted sumrate of the proposed algorithm approximates to that of the iterative waterfilling algorithm. And the complexity is reduced from the one in proportion to the square of number of users to the one in proportion to the number of users.
|
|
Received: 18 February 2008
Published: 28 October 2008
|
|
|
|
Corresponding Authors:
LUO Han-wen
|
|
|
|
| No related articles found! |
|
|
|
|
