Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Low Complexity Suboptimal User Selection Algorithm for Multiuser MIMO Systems with Block Diagonalization

  • 208 Accesses

Abstract

In downlink multiuser multiple-input multiple-output (MU-MIMO) systems, block diagonalization (BD) is a well-kown precoding technique that eliminates interuser interference. The number of simultaneously supportable users with BD is limited by the number of base station transmit antennas and the number of user receive antennas. The brute-force search for the optimal user set, however, is computationally prohibitive. Therefore, we propose a low complexity and suboptimal user selection algorithm based on block diagonalization for MU-MIMO systems. We introduce a strong tight upper bound of sum capacity as selection metric. Furthermore, we employ a substitution operation to improve system performance. The computational complexity analysis and simulation results show that the proposed algorithm achieves comparable throughput with low complexity compared to the existing algorithms.

This is a preview of subscription content, log in to check access.

Fig. 1
Fig. 2
Fig. 3

References

  1. 1.

    Weingarten, H., Steinberg, Y., & Shamai, S. (2006). The capacity region of the Gaussian multiple-input multiple-output broadcast channel. IEEE Transactions on Information Theory, 52(9), 3936–3964.

  2. 2.

    Spencer, Q. H., Swindlehurst, A. L., & Haardt, M. (2004). Zero forcing methods for downlink spatial multiplexing in multiuser MIMO channels. IEEE Transactions on Signal Processing, 52(2), 461–471.

  3. 3.

    Choi, L. U., & Murch, R. D. (2004). A transmit preprocessing technique for multiuser MIMO systems using a decomposition approach. IEEE Transactions on Wireless Communications, 3(1), 20–24.

  4. 4.

    Shen, Z., Chen, R., Andrews, J. G., Heath, R. W., & Evans, B. L. (2006). Low complexity user selection algorithms for multiuser MIMO systems with block diagonalization. IEEE Transactions on Signal Processing, 54(9), 3658–3663.

  5. 5.

    Zhang, X., & Lee, J. (2008). Low complexity multiuser MIMO scheduling with channel decomposition using capacity upperbound. IEEE Transactions on Communications, 56(6), 871–876.

  6. 6.

    Huang, S., Yin, H., Wu, J., Leung, V. C. M. (2012). User selection for multi-user MIMO downlink with zero-forcing beamforming. arXiv:1206.6217v1.

  7. 7.

    Vishwanath, S., Jindal, N., & Goldsmith, A. (2003). Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels. IEEE Transactions on Information Theory, 49(10), 2658–2668.

  8. 8.

    Lütkepohl, H. (1996). Handbook of Matrices. New York: Wiley.

  9. 9.

    Golub, G. H., & Van Loan, C. F. (1996). Matrix Computations (3rd ed.). Baltimore, MD: The John Hopkins University Press.

Download references

Acknowledgments

This work was supported by the National Science and Technology Major Project of the Ministry of Science and Technology of China (Grant No. 2012ZX03001027), the National Basic Research Program of China (973 Program, No.2012CB316100), the National High tech R&D Program of China (863 Program, No. 2012AA011701), the National Natural Science Foundation of China(Grant 61001207), the 111 Project (Grant No. B08038), and the Innovation Fund of Aerospace (Grant No. HTCXJJKT-16).

Author information

Correspondence to Chuiqiang Sun.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Sun, C., Ge, J. Low Complexity Suboptimal User Selection Algorithm for Multiuser MIMO Systems with Block Diagonalization. Wireless Pers Commun 75, 1937–1946 (2014). https://doi.org/10.1007/s11277-013-1446-8

Download citation

Keywords

  • Multiple-input multiple-output (MIMO)
  • Multiuser
  • Sum capacity
  • User selection