scholarly journals Multiuser Scheduling In 3GPP LTE-A Uplink Non-Stand-Alone Cellular Network With Virtual MIMO

2021 ◽  
Author(s):  
Shweta Kukade ◽  
M. S. Sutaone ◽  
R. A. Patil
Keyword(s):  
Spectral Efficiency ◽  
Cellular Network ◽  
Mimo System ◽  
Scheduling Algorithm ◽  
High Volume ◽  
User Scheduling ◽  
Time Frequency ◽  
3Gpp Lte ◽  
Effective Manner ◽  
Multiuser Scheduling

Abstract New 5G architecture gives access to New Radio (NR) with co-exist LTE. 3GPP LTE-A transition towards NR is a wireless technology that is widely employed in the cellular mobile network to support significantly high volume traffic. In this paper, we propose the best N-subset reduction and a modified RME algorithm (BNSRME) as an uplink multiuser scheduler. It is responsible for allocating resources among the active users in the most effective manner. The N-subset reduction method selects the best chunk of continuous resource blocks from the available system bandwidth. Users are assigned chunks based on channel-dependent selection and utility function. The BNSRME scheduling algorithm aims to optimize performance, spectral efficiency, and allows multiuser scheduling where multiple active users are allocated the same time-frequency resources. We consider the threshold cap SNRT to improve sensitivity quality for satisfactory users. The approach is MU scheduling which will be the most commonly deployed in non-stand-alone (NSA) 5G uplink cellular network. The result shows that the system spectral efficiency improves by 32.55 % by using the proposed multiuser algorithm compared to single user scheduling in an uplink. It has been shown that its performance can be further improved by using the MU-MIMO system.

Performance Analysis of Low Complexity Multiuser Scheduling Algorithms in MIMO System

2013 ◽  
Vol 392 ◽  
pp. 867-871
Author(s):  
Ming Xia Lv ◽  
Yan Kun Lai ◽  
Dong Tang
Keyword(s):  
Mimo System ◽  
Scheduling Algorithm ◽  
Low Complexity ◽  
Base Station ◽  
User Scheduling ◽  
Sum Capacity ◽  
Multiuser Scheduling ◽  
The Common ◽  
The Cost ◽  
Selection Algorithms

The total throughput of the communication system can be maximized by allocating the common radio resource to the user or the user group having the best channel quality at a given time and the multiuser diversity gain can be obtained when multiple users share the same channel at one time. The object to select the users is to select the users with the maximum sum capacity. As for a scheduling algorithm, exhaustive algorithm can get the largest capability of the system by multi-user scheduling. However, this algorithm is quite complex hence the cost of operation to a base station has substantial increased. We compare the multiuser performance of two fast user selection algorithms with low complexity in MIMO-MRC systems with co-channel interferences. From the simulation results, these two algorithms not only decrease the computational complexity of the scheduling algorithm but also retain large capability of the MIMO system.

Unitary Beamforming Multi-User MIMO System with Efficient User Scheduling Algorithm

2010 ◽  
Vol E93-B (7) ◽  
pp. 1965-1968 ◽  
Author(s):  
Illsoo SOHN ◽  
Joonil CHOI ◽  
Byong OK LEE ◽  
Kwang-Bok LEE
Keyword(s):  
Mimo System ◽  
Scheduling Algorithm ◽  
User Scheduling

A Fast Scheduling Algorithm for Multiple User MIMO-MRC System

2013 ◽  
Vol 385-386 ◽  
pp. 1738-1742
Author(s):  
Dong Tang ◽  
Ming Xia Lv
Keyword(s):  
Computational Complexity ◽  
Mimo System ◽  
Scheduling Algorithm ◽  
Low Complexity ◽  
Base Station ◽  
User Group ◽  
User Scheduling ◽  
Channel Quality ◽  
Multiple User ◽  
The Cost

When multiple users share the same channel at one time, the total throughput of the communication system can be maximized by allocating the common radio resource to the user or the user group having the best channel quality at a given time and the multiuser diversity gain can be obtained. The object to select the users in the best group is to select the users with the maximum sum capacity. Because of the co-channel interferences among the users, user in the best group is often not the user with the best channel quality when only does it transmit to the base station. As for a scheduling algorithm, exhaustive algorithm is to search the whole possibilities of the user group and is an approach that can get the largest capability of the system by multi-user scheduling. However, this algorithm is quite complex and usually brings huge workload to a base station with multiple antennas, hence the cost of operation to a base station has substantially increased. We propose a fast user selection algorithm with low complexity to reduce the computational complexity of the scheduling algorithm. From the simulation results, this algorithm not only decreases the computational complexity of the scheduling algorithm but also retains large capability of the MIMO system.

scholarly journals Multi-User Scheduling for 6G V2X Ultra-Massive MIMO System

Sensors ◽  
2021 ◽  
Vol 21 (20) ◽  
pp. 6742
Author(s):  
Shibiao He ◽  
Jieru Du ◽  
Yong Liao
Keyword(s):  
High Speed ◽  
Mimo Systems ◽  
Mimo System ◽  
Scheduling Algorithm ◽  
Link Quality ◽  
Channel Gain ◽  
User Scheduling ◽  
Channel Correlation ◽  
Automatic Driving ◽  
Channel Quality

6G vehicle-to-everything (V2X) communication will be combined with vehicle automatic driving technology and play an important role in automatic driving. However, in 6G V2X systems, vehicle users have the characteristics of high-speed movement. Therefore, how to provide stable and reliable wireless link quality and improve channel gain has become a problem that must be solved. To solve this problem, a new multi-user scheduling algorithm based on block diagonalization (BD) precoding for 6G ultra-massive multiple-input multiple-output (MIMO) systems is proposed in this paper. The algorithm takes advantage of the sensitive nature of BD precoding to channel correlation, uses the Pearson coefficient after matrix vectorization to measure the channel correlation between users, defines the scheduling factor to measure the channel quality according to the user noise enhancement factor, and jointly considers the influence of the correlation between user channels and channel quality, ensuring the selection of high-quality channels while minimizing channel correlation. Simulation results show that compared with the multi-user scheduling algorithm based on subspace correlation, condition number, and geometric angle, the proposed algorithm can obtain higher user channel gain, effectively reduce the system bit error rate, and can be applied to 6G V2X communication.

Research on Multiuser Scheduling Algorithm Based on the Frobenius-Norm of Channel Matrix

2014 ◽  
Vol 687-691 ◽  
pp. 4110-4113
Author(s):  
Yong Bo Zhang ◽  
Jian Xin Li ◽  
Yan Ping Li
Keyword(s):  
Power Distribution ◽  
Mimo System ◽  
Signal To Noise Ratio ◽  
Scheduling Algorithm ◽  
Base Station ◽  
Frobenius Norm ◽  
Channel Matrix ◽  
Water Filling ◽  
Multiuser Scheduling ◽  
Service Application

In MU-MIMO system when a base station sometimes has not enough resources to satisfy the service application from each user, we should arrange to communicate selectively for a certain number of users according to some appropriate method, i.e. multiuser scheduling. Given necessary channel state information this paper investigated the relationship between the norm of channel matrix and channel quality and studied multiuser scheduling algorithm typically based on the Frobenius-norm of channel matrix which was simulated respectively for equal power distribution and water-filling power distribution in MU-MIMO system model. The simulation result showed that at the same transmitted signal-to-noise ratio (SNR) such scheduling algorithm could be able to lower the bit error rate (BER) effectively and improve the receive capability in comparison to random scheduling.

Sign in / Sign up

Export Citation Format

Share Document