Browse > Article
http://dx.doi.org/10.5515/JKIEES.2011.11.2.071

Low Complexity Multiuser Scheduling in Time-Varying MIMO Broadcast Channels  

Lee, Seung-Hwan (Electronics and Telecommunications Research Institute (ETRI))
Lee, Jun-Ho (Mobile Communication and Digital Broadcasting Engineering, University of Science and Technology (UST))
Publication Information
Abstract
The sum-rate maximization rule can find an optimal user set that maximizes the sum capacity in multiple input multiple output (MIMO) broadcast channels (BCs), but the search space for finding the optimal user set becomes prohibitively large as the number of users increases. The proposed algorithm selects a user set of the largest effective channel norms based on statistical channel state information (CSI) for reducing the computational complexity, and uses Tomlinson-Harashima precoding (THP) for minimizing the interference between selected users in time-varying MIMO BCs.
Keywords
Multiuser Scheduling; Multiple Input Multiple Output (MIMO); Statistical Channel State Information(CSI); Scheduling Delay; Channel Norm;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 S. Lee, J. Thompson, and J. Kim, "Statistical CSIassisted multiuser scheduling in MIMO broadcast channels," IET Electronics Letters, vol. 44, no. 20, p. 1222-1223, 2008.   DOI   ScienceOn
2 T. Yoo, 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. 528-541, 2006.   DOI   ScienceOn
3 X. Zhang, E. Jorswieck, B. Ottersten, and A. Paulraj, "On the asymptotic optimality of opportunistic normbased user selection with hard SINR constraint," EURASIP Journal on Advances in Signal Processing, vol. 2009, article ID. 475273, 2009.
4 S. Lee, J. Thompson, "Simulation models for investigation of multiuser scheduling in MIMO broadcast channels," ETRI Journal, vol. 30, no. 6, pp. 765- 773, 2008.   DOI   ScienceOn
5 X. Zhang, J. Lee, "Low complexity MIMO scheduling with channel decomposition using capacity upper bound," IEEE Trans. on Communications, vol. 56, no. 6, Jun. pp. 871-876, 2008.   DOI   ScienceOn