The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Salah satu teknologi utama untuk sistem komunikasi mudah alih generasi kelima (5G) ialah berbilang masukan berbilang keluaran (MIMO) secara besar-besaran yang menggunakan pembentuk pancaran untuk mengimbangi kerugian perambatan besar dalam jalur frekuensi tinggi dan membolehkan pemultipleksan spatial sesuatu sejumlah besar aliran isyarat ke atas berbilang pengguna. Untuk meningkatkan lagi daya pemprosesan sistem, sistem kluster yang diselaraskan di mana sejumlah besar stesen pangkalan MIMO besar-besaran digunakan dalam ketumpatan tinggi telah disiasat. Penggunaan padat meningkatkan kapasiti sistem dengan mengawal stesen pangkalan daripada unit jalur asas berpusat. Walau bagaimanapun, apabila gugusan terletak berdekatan untuk memberi perkhidmatan kepada kawasan berpenduduk padat, gangguan antara rasuk antara gugusan bersebelahan menjadi lebih teruk. Untuk menyekat gangguan kepada kelompok bersebelahan, hanya skim kawalan suis rasuk mudah di sempadan kelompok telah disiasat sebagai skim konvensional. Dalam makalah ini, algoritma penjadualan untuk penghantaran pautan bawah MIMO besar-besaran berhampiran sempadan kluster, yang menggabungkan dua algoritma penjadualan, telah dicadangkan. Dalam skim yang dicadangkan, setiap stesen pangkalan membahagikan selnya sendiri kepada berbilang kawasan, menukar kawasan sokongan secara berurutan, dan memberi perkhidmatan kepada pengguna di kawasan tersebut. Keputusan berangka menunjukkan bahawa daya pengeluaran bertambah baik dengan sedikit pengurangan dalam indeks kesaksamaan (FI) apabila bilangan pengguna bagi setiap blok sumber ialah seorang. FI mencapai tahap tertinggi apabila bilangan pengguna setiap sel adalah sama dengan bilangan kawasan terbahagi. Skim yang dicadangkan mengurangkan kerumitan pengiraan berbanding dengan dua skim konvensional.
Masahito YATA
Keio University
Yukitoshi SANADA
Keio University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Masahito YATA, Yukitoshi SANADA, "User Scheduling at Base Station Cluster Boundary for Massive MIMO Downlink Transmission" in IEICE TRANSACTIONS on Communications,
vol. E106-B, no. 9, pp. 837-843, September 2023, doi: 10.1587/transcom.2022EBP3157.
Abstract: One of the key technologies for the fifth-generation (5G) mobile communication system is massive multiple-input multiple-output (MIMO) that applies beamforming in order to effectively compensate for large propagation losses in high frequency bands and enable the spatial multiplexing of a large number of signal streams over multiple users. To further improve a system throughput, a coordinated cluster system in which a large number of massive MIMO base stations are deployed in high density has been investigated. The dense deployment greatly improves the system capacity by controlling base stations from a centralized base band unit. However, when clusters are closely located in order to serve densely populated areas, inter-beam interference between adjacent clusters becomes more severe. To suppress the interference to adjacent clusters, only a simple beam switch control scheme at a cluster boundary has been investigated as a conventional scheme. In this paper, the scheduling algorithm for massive MIMO downlink transmission near cluster boundaries, which combines two scheduling algorithms, has been proposed. In the proposed scheme, each base station divides its own cell to multiple areas, switches supporting areas sequentially, and serves users in those areas. The numerical results show that the throughputs improve with a little reduction in a fairness index (FI) when the number of users per resource block is one. The FI reaches the highest when the number of users per cell is equal to the number of divided areas. The proposed scheme reduces computational complexity as compared with those of conventional two schemes.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2022EBP3157/_p
Salinan
@ARTICLE{e106-b_9_837,
author={Masahito YATA, Yukitoshi SANADA, },
journal={IEICE TRANSACTIONS on Communications},
title={User Scheduling at Base Station Cluster Boundary for Massive MIMO Downlink Transmission},
year={2023},
volume={E106-B},
number={9},
pages={837-843},
abstract={One of the key technologies for the fifth-generation (5G) mobile communication system is massive multiple-input multiple-output (MIMO) that applies beamforming in order to effectively compensate for large propagation losses in high frequency bands and enable the spatial multiplexing of a large number of signal streams over multiple users. To further improve a system throughput, a coordinated cluster system in which a large number of massive MIMO base stations are deployed in high density has been investigated. The dense deployment greatly improves the system capacity by controlling base stations from a centralized base band unit. However, when clusters are closely located in order to serve densely populated areas, inter-beam interference between adjacent clusters becomes more severe. To suppress the interference to adjacent clusters, only a simple beam switch control scheme at a cluster boundary has been investigated as a conventional scheme. In this paper, the scheduling algorithm for massive MIMO downlink transmission near cluster boundaries, which combines two scheduling algorithms, has been proposed. In the proposed scheme, each base station divides its own cell to multiple areas, switches supporting areas sequentially, and serves users in those areas. The numerical results show that the throughputs improve with a little reduction in a fairness index (FI) when the number of users per resource block is one. The FI reaches the highest when the number of users per cell is equal to the number of divided areas. The proposed scheme reduces computational complexity as compared with those of conventional two schemes.},
keywords={},
doi={10.1587/transcom.2022EBP3157},
ISSN={1745-1345},
month={September},}
Salinan
TY - JOUR
TI - User Scheduling at Base Station Cluster Boundary for Massive MIMO Downlink Transmission
T2 - IEICE TRANSACTIONS on Communications
SP - 837
EP - 843
AU - Masahito YATA
AU - Yukitoshi SANADA
PY - 2023
DO - 10.1587/transcom.2022EBP3157
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E106-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2023
AB - One of the key technologies for the fifth-generation (5G) mobile communication system is massive multiple-input multiple-output (MIMO) that applies beamforming in order to effectively compensate for large propagation losses in high frequency bands and enable the spatial multiplexing of a large number of signal streams over multiple users. To further improve a system throughput, a coordinated cluster system in which a large number of massive MIMO base stations are deployed in high density has been investigated. The dense deployment greatly improves the system capacity by controlling base stations from a centralized base band unit. However, when clusters are closely located in order to serve densely populated areas, inter-beam interference between adjacent clusters becomes more severe. To suppress the interference to adjacent clusters, only a simple beam switch control scheme at a cluster boundary has been investigated as a conventional scheme. In this paper, the scheduling algorithm for massive MIMO downlink transmission near cluster boundaries, which combines two scheduling algorithms, has been proposed. In the proposed scheme, each base station divides its own cell to multiple areas, switches supporting areas sequentially, and serves users in those areas. The numerical results show that the throughputs improve with a little reduction in a fairness index (FI) when the number of users per resource block is one. The FI reaches the highest when the number of users per cell is equal to the number of divided areas. The proposed scheme reduces computational complexity as compared with those of conventional two schemes.
ER -