Low Complexity Joint Scheduling and Beamforming Method Based on Random User Grouping in Massive MIMO Systems 


Vol. 47,  No. 8, pp. 1055-1058, Aug.  2022
10.7840/kics.2022.47.8.1055


PDF
  Abstract

In this letter, a low complexity joint beamforming and scheduling method based on random user grouping is proposed for massive multiple-input multiple-output (MIMO) system. In the proposed scheme, users are divided into multiple user groups and scheduling is performed per user group. After that, block diagonalization (BD) strategy is applied for inter-group beamforming and matched filter (MF) is used for inner-group beamforming. It is verified that the proposed scheme has lower computational complexity and robustness against channel estimation error compared to the conventional beamforming and scheduling schemes.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

T. Kim, "Low Complexity Joint Scheduling and Beamforming Method Based on Random User Grouping in Massive MIMO Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 47, no. 8, pp. 1055-1058, 2022. DOI: 10.7840/kics.2022.47.8.1055.

[ACM Style]

Taehyoung Kim. 2022. Low Complexity Joint Scheduling and Beamforming Method Based on Random User Grouping in Massive MIMO Systems. The Journal of Korean Institute of Communications and Information Sciences, 47, 8, (2022), 1055-1058. DOI: 10.7840/kics.2022.47.8.1055.

[KICS Style]

Taehyoung Kim, "Low Complexity Joint Scheduling and Beamforming Method Based on Random User Grouping in Massive MIMO Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 47, no. 8, pp. 1055-1058, 8. 2022. (https://doi.org/10.7840/kics.2022.47.8.1055)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880