An improved user selection algorithm in multiuser MIMO broadcast

Capacity maximizing in massive MIMO with linear precoding for SSF and LSF channel with perfect CSI

This paper investigates the zero-forcing (ZF) beamforming transmit strategy in the multiple-antenna multiuser downlink systems. We consider the case of mobile users equipped with multiple antennas. Although the capacity of such systems can be achieved by dirty paper coding (DPC), DPC is extremely difficult and challenging to implement. Thus, simple but suboptimal linear beamforming techniques like ZF beamforming can be deployed. However, the number of users that can be served using this strategy is limited by the number of transmit antennas at the base station. The solution for this limitation is user selection (scheduling), which also exploits multiuser diversity. Therefore, user selection can be used to enhance the throughput of the system. Recently, it has been shown that ZF beamforming strategy with user selection is asymptotically optimal for a large number of users. In this paper, a semi-orthogonal user selection (SUS) algorithm is extended to the system with multiple-antenna mobile users. This algorithm aims to select users, which are semi-orthogonal. The optimal ZF beamforming matrices are obtained and it is shown that the optimal ZF beamforming throughput is related to the eigenvalues of the user channels. Therefore, SUS is aimed to select the proper group of users based on maximizing the channel eigenvalues and therefore improving the optimal ZF beamforming throughput of the system.

In the multiuser multiple-input multiple-output (MU-MIMO) system, to reduce the influence of channel correlation on system performance, the base station (BS) should select the appropriate subset of user equipments (UEs) according to their channel state information (CSI). Due to a lack of channel reciprocity, the downlink CSI needs to be fed back to the BS in frequency division duplexing (FDD) mode. Some scholars have exploited kinds of deep neural networks (DNNs) for sensing and recovering CSI. However, user selection after all the CSI is reconstructed by DNNs will bring a great time delay. In this paper, we propose a deep learning-based CSI feedback scheme called US-CsiNet. Based on adversarial autoencoder (AAE), US-CsiNet can explicitly cover user schedule information while representing CSI. At the UE side, the encoder of US-CsiNet maps the CSI into codewords of which part are feature information for user schedule. Then the BS applies these partial codewords to separate the UEs into different groups and select active UEs. Finally, the decoder of AAE reconstructs the CSI of these active UEs. US-CsiNet can not only simplify the user selection process but also guarantee the accuracy of CSI reconstruction. The simulation results show that the proposed approach outperforms maximum channel gain (MCG) user selection algorithms and achieves the nearly same performance with semiorthogonal user selection (SUS) which needs full CSI of all users at the BS.

In this paper, a user selection problem for multiuser multiple-input multiple-output systems in the general wireless environment with full-rank and rank-deficient channel users is investigated. It is demonstrated that the maximum number of simultaneously supportable users is elastic, and the spatial resources occupied by each user can be squeezed in the rank-deficient environment. Therefore, a user selection algorithm is then proposed with relatively low computational overhead. The data rate requirement distinctions of different services are considered in the user selection criterion, and the resources occupied by real-time service users are primarily squeezed since they do not need extremely high data rate. Numerical results show that the effective throughput and the number of selected users achieved by the proposed user selection algorithm are larger than that of exiting researches.

This paper focuses on the design of user selection algorithm for Unitary Beamforming (UBF) in multi-user multiple-input multiple-output (MIMO) systems. A long step user selection (LSUS) algorithm is proposed, and is verified to be rather robust when combined with the Givens rotation-based iterative optimization UBF. For most of existing user selection algorithms, only the best user is chosen at each selection, we regard the step length as one. However, because members of the optimal user set must both have high channel gains and low inter-user interference, if only one user is considered each step, the user that will be selected at next step can not be guaranteed to have both high channel gain and low inter-user interference with the just selected users. Therefore, an algorithm that two users are considered at each selection is proposed in this paper, the step length is regarded as two. It will in some extent help find the favorable user set and finally lead to a higher capacity. Moreover, Gram-Schmidt orthogonalization is used in our proposed algorithm to select the favorable users and at the same time generate the initial unitary beamforming matrix according to the channel state information (CSI). Two other beamforming schemes are simulated as references to demonstrate the good performance of the proposed algorithm even under low signal-to-noise-ratio (SNR) scenario.

In this paper, we propose a new low-complexity user selection algorithm for multi-user downlink channels. We only consider the scenario that linear beamforming, such as zero-forcing beamforming, is employed at the base station (BS). In this scenario, the number of concurrent active users is limited by the number of transmit antennas at the BS. Thus, there arises the problem how to select the optimal set of active users that can maximize the downlink channel capacity based on the channel state information (CSI) of all users. However, the optimal solution to this problem is an exhaustive search of all possible combinations of the users, which has prohibitive computational complexity. We propose a sub-optimal greedy user selection algorithm based on the norm and correlation between the channel matrices of different users. Our new algorithm requires low computational complexity and provides nearly optimal performance. Simulation results are presented to illustrate the good performance of our algorithm.

WiFi 5/6 relies on a key feature, Multi-User Multiple-In-Multiple-Out (MU-MIMO), to offer high-volume network throughput and spectrum efficiency. MU-MIMO uses a user selection algorithm, based on each user's channel state information (CSI), to schedule transmission opportunities for a group of users to maximize the service quality and efficiency. In this paper, we discover that such algorithm creates a subtle attack surface for attackers to subvert user selection in MU-MIMO, causing severe disruptions in today's wireless networks. We develop a system, named MU-MIMO user selection strategy inference and subversion (MUSTER), to systematically study the attack strategies and further to seek efficient mitigation. MUSTER is designed to include two major modules: (i) strategy inference, which leverages a new neural group-learning strategy named MC-grouping via combining Recurrent Neural Network (RNN) and Monte Carlo Tree Search (MCTS) to reverseengineer a user selection algorithm, and (ii) user selection subversion, which proactively fabricates CSI to manipulate user selection results for disruption. Experimental evaluation shows that MUSTER achieves a high accuracy rate around 98.6% in user selection prediction and effectively launches the attacks to disrupt the network performance. Finally, we create a Reciprocal Consistency Checking technique to defend against the proposed attacks to secure MU-MIMO user selection.

In downlink multiuser multiple-input multiple-output (MIMO) systems, system performance highly depends on the reliability of downlink channel state information (CSI) at the base station (BS). In frequency division duplexing, the most practical solution is to have downlink CSI from the users fed back to the BS. Most work on this feedback design has assumed independent block fading channels. However, this paper proposes a new differential feedback scheme using the observation that the channel realizations are usually temporally correlated. The sum-rate loss assuming differential feedback is analyzed for a system with the number of users K equal to the number of transmit antennas M. When K >; M, a user selection algorithm based on an approximated signal-to-interference plus noise ratio (SINR) estimation is proposed. In simulation results, the proposed differential feedback scheme increases the sum-rate compared to previous differential feedback schemes. Moreover, the proposed user selection algorithm outperforms semi-orthogonal user selection in the moderate signal-to-noise ratio (SNR) region, despite requiring less feedback information. In low mobility channels, utilizing the channels' time correlation during quantization is shown to play a bigger role in determining sum-rate performance than multiuser diversity for most SNR regimes when a practical number of users is considered.

Background and Objectives: We propose here joint semi-orthogonal user selection and antenna selection algorithm based on precoding scheme. Methods: The focus of this proposed algorithm is to increase the system sumrate and decrease the complexity. We select and schedule users from a large number of users based on semi-orthogonality condition among them. Here, we select only the maximum channel gain antennas to maximize the system sumrate. Subsequently, the user selection and antenna selection have been scheduled in an adequate manner in order to obtain maximum system sumrate. We calculate the system sumrate for two scenarios: firstly, by considering the interference and secondly without considering the interference. We achieve maximum system sumrate at MMSE and lowest at without precoding while considering the interference. However, when we do not consider the interference we obtain lowest sumrate at MMSE and maximum at without precoding. Results and Conclusion: Here, we apply the precoding scheme to increase the system sumrate and we obtain approximately 20% to 35% higher system sumrate compared to without precoding, when interference is considered. Thus, we achieve higher sumrate in our proposed algorithms compared to other existing work.

The objective of this paper is to study the performance of a multicell vector perturbation (MVP) precoding technique under practical situations in a network multiple-input multiple-output (MIMO) scheme employing joint transmission. The conventional perturbation strategy that minimizes the total power is considered, and the power at each base station (BS) is properly scaled to enforce per-BS power constraints. In our scenario, we consider multiple-antenna users and use block diagonalization (BD) as the linear front-end precoder for VP. The sum rate for the MVP in the case of uniformly distributed input and an asymptotic upper bound on the sum rate at high signal-to-noise ratios (SNRs) are derived. In addition, using the asymptotic upper bound on the individual user rates, we propose a proportionally fair (PF) user scheduling algorithm of lower complexity and better performance compared with the benchmark fair semiorthogonal user selection (SUS) algorithm. As opposed to the PF-SUS, the proposed PF scheduling algorithm requires no predefined correlation threshold. Furthermore, we study the impact of backhaul delay on the performance of both VP and BD by deriving bounds on the sum rate. The numerical results show that MVP in the case of perfect channel state information (CSI) outperforms multicell BD. In the presence of a backhaul delay, the performance of MVP significantly degrades, but the upper bound on the sum rate for MVP is still higher than for multicell BD.

An efficient uplink user selection algorithm for distributed antenna systems (DAS) is proposed in this paper. Previous user selection algorithms in multiple-input-multiple-output (MIMO) systems are designed for conventional MIMO systems where antennas are located together. Since DAS can be thought as a variation of MIMO systems, the user selection algorithms which are originally designed for conventional MIMO systems can also be applied to DAS. However, the channel characteristics of DAS are different from those of conventional MIMO systems. Thus there should be specific user selection algorithm for DAS environments which utilizes the channel characteristics of DAS. This paper proposes an efficient uplink user selection algorithm specified for DAS. Simulation results show that the proposed algorithm gives near optimal performance which reaches up to 98.5% of the optimal spectral efficiency. Furthermore, the complexity of the proposed algorithm is also examined and the results show that it is easy to implement in practical systems.

Radio resource allocation is a major research field in wireless networks. The main challenge is to find the most suitable user for each time and frequency resource to ensure the Quality of Service (QoS) requirements. The use of Massive Multiple-Input-Multiple-Output (MIMO) makes it possible to simultaneously schedule several users on the same time and frequency resources. This is a new paradigm for resource scheduling. In this context, resource allocation algorithms have to account for the choice of users served on the same time and frequency resource in their decision mechanism. In this paper we analyze the impact of different group sizes on system capacity using several user selection algorithms and we propose a new user selection algorithm which performs closer to the optimal algorithm proposed in the literature.

In this paper we present a low-complexity user selection algorithm for the downlink of a distributed antenna system (DAS) that achieves an optimum solution for a weighted matching problem. The user selection process is modeled as a linear sum assignment problem (LSAP). The proposed solution consists of two phases. In the first phase, a set of potential users to be scheduled is found by combining two complementary approaches: greedy and minimum-throughput-loss selection. In the second phase, the set of scheduled users is refined by selecting the users that maximize sum throughput. We provide numerical results to confirm the optimality of our user selection algorithm and to compare its performance with existing solutions.

In this paper schemes for feedback reduction in MIMO broadcast channels are considered for a multi-user system. We consider a case where the number of single antenna users K >> M where M is the size of antenna array at the base station (BS). We consider zero-forcing beamforming system with semi-orthogonal user selection algorithm in which channel state information is splitted into channel quality information (CQI) and channel direction information (CDI). In such a user-dense multi-user system feedback channel is inundated if all the users are feedbacking even in the case where only a limited feedback is employed. In order to reduce the feedback load we propose threshold based schemes in which threshold is applied on CQI or CDI. We show that by employing proposed feedback reduction schemes feedback load can be significantly reduced without sacrificing much of the sum-capacity of the system.

The distributed Goppa-coded generalized spatial modulation (DGC-GSM) scheme with the source, relay, and destination in cooperative communications is proposed, where the source and relay adopt different Goppa codes. Goppa codes have many advantages such as the flexible codeword length, excellent code construction, and easy encoding and decoding complexity. At the relay, we select portions of the source information bits for further encoding. For each selection, the destination constructs a channel code. To obtain the best code in the destination, we propose the optimal information bit selection algorithm at the relay to choose the source information. However, Goppa codes with a large block length will impose high complexity on the optimal algorithm. Thus, the locally optimized selection algorithm is further proposed. At the destination, the joint decoding algorithm is adopted to recover the source information. Our simulated results indicate that the two selection algorithms proposed achieve better performance than the random selection method. This is because the optimized algorithms can generate the code with a larger minimum distance at the destination. Moreover, the proposed DGC-GSM scheme outperforms the non-cooperative system. Moreover, the DGC-GSM scheme can obtain the approximate performance with the distributed Goppa-coded spatial modulation (DGC-SM) scheme but has a significantly reduced transmit antenna number.