TY - GEN
T1 - Low complexity scheduling for downlink multiuser MIMO systems in correlated channels
AU - Han, Shengqian
AU - Yang, Chenyang
PY - 2008
Y1 - 2008
N2 - Many successive scheduling schemes associated with linear transmit beamforming have been proposed which can asymptotically achieve the sum rate of dirty paper coding (DPC) in i.i.d. channels. In this paper, the performance of the successive scheduling in spatially correlated channels is studied. Then we propose a low complexity alternating user scheduling (AUS), which can be applied to both zero-forcing beamforming (ZFBF) and regularized ZFBF (R-ZFBF). The new scheduling algorithm can achieve a comparable sum rate with that of the exhaustive searching in both i.i.d. and spatially correlated channels with the same order of complexity as the successive scheduling.
AB - Many successive scheduling schemes associated with linear transmit beamforming have been proposed which can asymptotically achieve the sum rate of dirty paper coding (DPC) in i.i.d. channels. In this paper, the performance of the successive scheduling in spatially correlated channels is studied. Then we propose a low complexity alternating user scheduling (AUS), which can be applied to both zero-forcing beamforming (ZFBF) and regularized ZFBF (R-ZFBF). The new scheduling algorithm can achieve a comparable sum rate with that of the exhaustive searching in both i.i.d. and spatially correlated channels with the same order of complexity as the successive scheduling.
UR - https://www.scopus.com/pages/publications/67249135054
U2 - 10.1109/GLOCOM.2008.ECP.740
DO - 10.1109/GLOCOM.2008.ECP.740
M3 - 会议稿件
AN - SCOPUS:67249135054
SN - 9781424423248
T3 - GLOBECOM - IEEE Global Telecommunications Conference
SP - 3856
EP - 3860
BT - 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
T2 - 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
Y2 - 30 November 2008 through 4 December 2008
ER -