Generalized spatial modulation (GSM) uses $n_t$ transmit antenna elements but fewer transmit radio frequency (RF) chains, $n_{rf}$. Spatial modulation (SM) and spatial multiplexing are special cases of GSM with $n_{rf}=1$ and $n_{rf}=n_t$, respectively. In GSM, in addition to conveying information bits through $n_{rf}$ conventional modulation symbols (for example, QAM), the indices of the $n_{rf}$ active transmit antennas also convey information bits. In this paper, we investigate {\em GSM for large-scale multiuser MIMO communications on the uplink}. Our contributions in this paper include: ($i$) an average bit error probability (ABEP) analysis for maximum-likelihood detection in multiuser GSM-MIMO on the uplink, where we derive an upper bound on the ABEP, and ($ii$) low-complexity algorithms for GSM-MIMO signal detection and channel estimation at the base station receiver based on message passing. The analytical upper bounds on the ABEP are found to be tight at moderate to high signal-to-noise ratios (SNR). The proposed receiver algorithms are found to scale very well in complexity while achieving near-optimal performance in large dimensions. Simulation results show that, for the same spectral efficiency, multiuser GSM-MIMO can outperform multiuser SM-MIMO as well as conventional multiuser MIMO, by about 2 to 9 dB at a bit error rate of $10^{-3}$. Such SNR gains in GSM-MIMO compared to SM-MIMO and conventional MIMO can be attributed to the fact that, because of a larger number of spatial index bits, GSM-MIMO can use a lower-order QAM alphabet which is more power efficient.
In this paper, we solve the sum mean-squared error (MSE)-optimal 1-bit quantized precoding problem exactly for small-to-moderate sized multiuser multiple-input multiple-output (MU-MIMO) systems via branch and bound. To this end, we reformulate the original NP-hard precoding problem as a tree search and deploy a number of strategies that improve the pruning efficiency without sacrificing optimality. We evaluate the error-rate performance and the complexity of the resulting 1-bit branch-and-bound (BB-1) precoder, and compare its efficacy to that of existing, suboptimal algorithms for 1-bit preco…
Joint user selection and precoding in multiuser MIMO settings can be interpreted as group sparse recovery in linear models. In this problem, a signal with group sparsity is to be reconstructed from an underdetermined system of equations. This paper utilizes this equivalent interpretation and develops a computationally tractable algorithm based on the method of group LASSO. Compared to the state of the art, the proposed scheme shows performance enhancements in two different respects: higher achievable sum-rate and lower interference at the non-selected user terminals.
The problem of radio resource allocation for global energy efficiency (GEE) maximization in mmWaves large-scale multiple-input multiple-output (MIMO) systems using hybrid-beamforming with spatial modulation is addressed. The theoretical properties of the optimization problem at hand are analyzed and two provably convergent optimization algorithms with affordable complexity are proposed. The former achieves the global optimum, while the latter trades off optimality with a lower computational complexity. Nevertheless, numerical results show that both algorithms attain global optimality in practi…
This letter investigates the secure communication in a reconfigurable intelligent surface (RIS)-aided multiuser massive multiple-input multiple-output (MIMO) system exploiting artificial noise (AN). We first derive a closed-form expression of the ergodic secrecy rate under spatially correlated MIMO channels. By using this derived result, we further optimize the power fraction of AN in closed form and the RIS phase shifts by developing a gradient-based algorithm, which requires only statistical channel state information (CSI). Our analysis shows that spatial correlation at the RIS provides an a…
In this work, we investigate the sum-rate performance of multicell and cell-free massive MIMO systems using linear precoding and multiuser scheduling algorithms. We consider the use of a network-centric clustering approach to reduce the computational complexity of the techniques applied to the cell-free system. We then develop a greedy algorithm that considers multiple candidates for the subset of users to be scheduled and that approaches the performance of the optimal exhaustive search. We assess the proposed and existing scheduling algorithms in both multicell and cell-free networks with the…
In this paper, we propose a joint pilot design and channel estimation scheme based on the deep learning (DL) technique for multiuser multiple-input multiple output (MIMO) channels. To this end, we construct a pilot designer using two-layer neural networks (TNNs) and a channel estimator using deep neural networks (DNNs), which are jointly trained to minimize the mean square error (MSE) of channel estimation. To effectively reduce the interference among the multiple users, we also use the successive interference cancellation (SIC) technique in the channel estimation process. The numerical result…
Due to the large power consumption in RF-circuitry of massive MIMO systems, practically relevant performance measures such as energy efficiency or bandwidth efficiency are neither necessarily monotonous functions of the total transmit power nor the number of active antennas. Optimal antenna selection is however computationally infeasible in these systems. In this paper, we propose an iterative algorithm to optimize the transmit power and the subset of selected antennas subject to non-monotonous performance measures in massive multiuser MIMO settings. Numerical results are given for energy effi…
In this thesis, we investigate the problem of efficient data detection in large MIMO and high order MU-MIMO systems. First, near-optimal low-complexity detection algorithms are proposed for regular MIMO systems. Then, a family of low-complexity hard-output and soft-output detection schemes based on channel matrix puncturing targeted for large MIMO systems is proposed. The performance of these schemes is characterized and analyzed mathematically, and bounds on capacity, diversity gain, and probability of bit error are derived. After that, efficient high order MU-MIMO detectors are proposed, bas…
This letter investigates the joint active and passive beamforming optimization for intelligent reflecting surface (IRS) aided multiuser multiple-input multiple-output systems with the objective of maximizing the weighted sum-rate. We show that this problem can be solved via a matrix weighted mean square error minimization equivalence. In particular, for the optimization of the passive IRS beamforming, we first propose an iterative algorithm with excellent performance based on the manifold optimization. By using the matrix fractional programming technique to obtain a more tractable object funct…
In this work, we consider the problem of reduced latency of low-density parity-check (LDPC) codes with iterative detection and decoding (IDD) receiver in multiuser multiple-antenna systems. The proposed knowledge-aided IDD (KA-IDD) system employs a minimum mean-square error detector with refined iterative processing and a reweighted belief propagation (BP) decoding algorithm. We present reweighted BP decoding algorithms, which exploit the knowledge of short cycles in the graph structure and reweighting factors derived from the expansion of hypergraphs. Simulation results show that the proposed…
MIMO systems are considered as most promising for wireless communications. However, with an increasing number of radio front ends the corresponding energy consumption and costs become an issue, which can be relieved by the utilization of low-resolution quantizers. In this study we propose an optimal precoding algorithm constrained to constant envelope signals and phase quantization that maximizes the minimum distance to the decision threshold at the receivers using a branch-and-bound strategy. The proposed algorithm is superior to the existing methods in terms of bit error rate. Numerical resu…
This work studies multiuser detection for one-bit massive multiple-input multiple-output (MIMO) systems in order to diminish the power consumption at the base station (BS). A low-complexity near-maximum-likelihood (nML) multiuser detection algorithm is designed, assuming that each BS antenna port is connected with a pair of single-bit resolution analog-to-digital converters (ADCs) and each user equipment (UE) transmits symbols from a quadrature amplitude modulation (QAM) constellation. First, a novel convex program is formulated as a convex surrogate of the ML detector and subsequently solved …
In this work, we investigate Block Diagonalization (BD) techniques for multiuser multiple-antenna systems using rate-splitting (RS) multiple access. In RS multiple access the messages of the users are split into a common part and a private part in order to mitigate multiuser interference. We present the system model for a RS multiple access system operating in a broadcast channel scenario where the receivers are equipped with multiple antennas. We also develop linear precoders based on BD for the RS multiple access systems along with combining techniques, such as the min-max criterion and the …
Reconfigurable intelligent surface (RIS) is envisioned to be an essential component of the paradigm for beyond 5G networks as it can potentially provide similar or higher array gains with much lower hardware cost and energy consumption compared with the massive multiple-input multiple-output (MIMO) technology. In this paper, we focus on one of the fundamental challenges, namely the channel acquisition, in an RIS-assisted multiuser MIMO system. The state-of-the-art channel acquisition approach in such a system with fully passive RIS elements estimates the cascaded transmitter-to-RIS and RIS-to-…
Study of Multiuser Scheduling Based on User Satisfaction for MU-MIMO Systems
Pontifical Catholic University of Rio de Janeiro（里约热内卢天主教大学）；Université Gustave Eiffel（古斯塔夫·埃菲尔大学）；CY Cergy Paris Université（塞吉-巴黎CY大学）；University of York（约克大学）
In this work, we investigate the performance of Rate-Splitting (RS) based on Tomlinson-Harashima Precoding (THP) in a multiple-antenna broadcast channel with perfect and imperfect Channel State Information at the Transmitter (CSIT). In particular, we consider RS using centralized and decentralized THP structures, where only one user splits its message into a common and private part, and develop expressions to describe the signal-to-interference-plus-noise (SINR) ratio and the sum rates associated with these schemes. Furthermore, we also assess the performance achieved by RS combined with Dirty…
Low-resolution precoding techniques have gained considerable attention in the wireless communications area recently. Vital but hardly discussed in literature, discrete precoding in conjunction with channel coding is the subject of this study. Unlike prior studies, we propose three different soft detection methods and an iterative detection and decoding scheme that allow the utilization of channel coding in conjunction with low-resolution precoding. Besides an exact approach for computing the extrinsic information, we propose two approximations with reduced computational complexity. Numerical r…
This paper studies the optimal bit allocation for shape-gain vector quantization of wireless channels in multiuser (MU) multiple-input multiple-output (MIMO) downlink systems based on linear precoding. Our design minimizes the mean squared-error between the original and quantized channels through optimal bit allocation across shape (direction) and gain (magnitude) for a fixed feedback overhead per user. This is shown to significantly reduce the quantization error, which in turn, decreases the MU interference. This paper makes three main contributions: first, we focus on channel gain quantizati…
