Abstract—Dirty paper coding (DPC) is shown to achieve the capacity of multiple-input multiple-output (MIMO) Gaussian broadcast channels (BCs). In circuit data scenarios, users demand to get service at fixed desire rate. Finding the optimal covariance matrices and order of users for maximizing user capacity requires high complexity computation. To deal with this problem, many researchers use fixed order of users and get subpar performance. In this paper we present an iterative user selection scheme that aims to maximize user capacity. The main feature of the proposed scheme is that it do not impose a fixed order on the users. Users to be served are chosen iteratively considering influence from the chosen ones. Simulation results show that the proposed scheme achieves better performance than similar simple schemes. In addition, a compromise between performance and complexity can be made by a candidate user set concept. Cardinality of the candidate user set is fixed and users in the set are dynamically adjusted.
Index Terms—DPC, Iterative User Selection, MIMO gaussian broadcast channel, user capacity.
Yingbo Li, Wei Jiang, Jianjun Zhang, Zhongjian Liu and Ye Jin are with the Satellite and Wireless Communication Laboratory, school of Electronics Engineering & Computer Science, Peking University, Beijing 100871, P. R. China. E-mail: {yingbo.li, jiangwei, zhangjj, quqianquhou and jinye}@pku.edu.cn respectively.
[PDF]
Cite: Yingbo Li, Wei Jiang, Jianjun Zhang, Zhongjian Liu, and Ye Jin, "An efficient Scheme for MIMO Broadcast Channels Based on Iterative User Selection," International Journal of Information and Electronics Engineering vol. 2, no. 1, pp. 16-20, 2011.
