Sum-Rate Maximization for Linearly Precoded Downlink Multiuser MISO Systems with Partial CSIT: A Rate-Splitting Approach

This paper considers the Sum-Rate (SR) maximization problem in downlink MU-MISO systems under imperfect Channel State Information at the Transmitter (CSIT). Contrary to existing works, we consider a rather unorthodox transmission scheme. In particular, the message intended to one of the users is split into two parts: a common part which can be recovered by all users, and a private part recovered by the corresponding user. On the other hand, the rest of users receive their information through private messages. This Rate-Splitting (RS) approach was shown to boost the achievable Degrees of Freedom (DoF) when CSIT errors decay with increased SNR. In this work, the RS strategy is married with linear precoder design and optimization techniques to achieve a maximized Ergodic SR (ESR) performance over the entire range of SNRs. Precoders are designed based on partial CSIT knowledge by solving a stochastic rate optimization problem using means of Sample Average Approximation (SAA) coupled with the Weighted Minimum Mean Square Error (WMMSE) approach. Numerical results show that in addition to the ESR gains, the benefits of RS also include relaxed CSIT quality requirements and enhanced achievable rate regions compared to conventional transmission with NoRS.Comment: accepted to IEEE Transactions on Communication

Linear Precoders for Non-Regenerative Asymmetric Two-way Relaying in Cellular Systems

Two-way relaying (TWR) reduces the spectral-efficiency loss caused in conventional half-duplex relaying. TWR is possible when two nodes exchange data simultaneously through a relay. In cellular systems, data exchange between base station (BS) and users is usually not simultaneous e.g., a user (TUE) has uplink data to transmit during multiple access (MAC) phase, but does not have downlink data to receive during broadcast (BC) phase. This non-simultaneous data exchange will reduce TWR to spectrally-inefficient conventional half-duplex relaying. With infrastructure relays, where multiple users communicate through a relay, a new transmission protocol is proposed to recover the spectral loss. The BC phase following the MAC phase of TUE is now used by the relay to transmit downlink data to another user (RUE). RUE will not be able to cancel the back-propagating interference. A structured precoder is designed at the multi-antenna relay to cancel this interference. With multiple-input multiple-output (MIMO) nodes, the proposed precoder also triangulates the compound MAC and BC phase MIMO channels. The channel triangulation reduces the weighted sum-rate optimization to power allocation problem, which is then cast as a geometric program. Simulation results illustrate the effectiveness of the proposed protocol over conventional solutions.Comment: 30 pages, 7 figures, submitted to IEEE Transactions on Wireless Communication

Wireless MIMO Switching: Weighted Sum Mean Square Error and Sum Rate Optimization

This paper addresses joint transceiver and relay design for a wireless multiple-input-multiple-output (MIMO) switching scheme that enables data exchange among multiple users. Here, a multi-antenna relay linearly precodes the received (uplink) signals from multiple users before forwarding the signal in the downlink, where the purpose of precoding is to let each user receive its desired signal with interference from other users suppressed. The problem of optimizing the precoder based on various design criteria is typically non-convex and difficult to solve. The main contribution of this paper is a unified approach to solve the weighted sum mean square error (MSE) minimization and weighted sum rate maximization problems in MIMO switching. Specifically, an iterative algorithm is proposed for jointly optimizing the relay's precoder and the users' receive filters to minimize the weighted sum MSE. It is also shown that the weighted sum rate maximization problem can be reformulated as an iterated weighted sum MSE minimization problem and can therefore be solved similarly to the case of weighted sum MSE minimization. With properly chosen initial values, the proposed iterative algorithms are asymptotically optimal in both high and low signal-to-noise ratio (SNR) regimes for MIMO switching, either with or without self-interference cancellation (a.k.a., physical-layer network coding). Numerical results show that the optimized MIMO switching scheme based on the proposed algorithms significantly outperforms existing approaches in the literature.Comment: This manuscript is under 2nd review of IEEE Transactions on Information Theor

Robust MMSE Precoding Strategy for Multiuser MIMO Relay Systems with Switched Relaying and Side Information

In this work, we propose a minimum mean squared error (MMSE) robust base station (BS) precoding strategy based on switched relaying (SR) processing and limited transmission of side information for interference suppression in the downlink of multiuser multiple-input multiple-output (MIMO) relay systems. The BS and the MIMO relay station (RS) are both equipped with a codebook of interleaving matrices. For a given channel state information (CSI) the selection function at the BS chooses the optimum interleaving matrix from the codebook based on two optimization criteria to design the robust precoder. Prior to the payload transmission the BS sends the index corresponding to the selected interleaving matrix to the RS, where the best interleaving matrix is selected to build the optimum relay processing matrix. The entries of the codebook are randomly generated unitary matrices. Simulation results show that the performance of the proposed techniques is significantly better than prior art in the case of imperfect CSI.

Rate-Splitting Multiple Access: Finite Constellations, Receiver Design, and SIC-free Implementation

Rate-Splitting Multiple Access (RSMA) has emerged as a novel multiple access technique that enlarges the achievable rate region of Multiple-Input Multiple-Output (MIMO) broadcast channels with linear precoding. In this work, we jointly address three practical but fundamental questions: (1) How to exploit the benefit of RSMA under finite constellations? (2) What are the potential and promising ways to implement RSMA receivers? (3) Can RSMA still retain its superiority in the absence of successive interference cancellers (SIC)? To address these concerns, we first propose low-complexity precoder designs taking finite constellations into account and show that the potential of RSMA is better achieved with such designs than those assuming Gaussian signalling. We then consider some practical receiver designs that can be applied to RSMA. We notice that these receiver designs follow one of two principles: (1) SIC: cancelling upper layer signals before decoding the lower layer and (2) non-SIC: treating upper layer signals as noise when decoding the lower layer. In light of this, we propose to alter the precoder design according to the receiver category. Through link-level simulations, the effectiveness of the proposed precoder and receiver designs are verified. More importantly, we show that it is possible to preserve the superiority of RSMA over Spatial Domain Multiple Access (SDMA), including SDMA with advanced receivers, even without SIC at the receivers. Those results therefore open the door to competitive implementable RSMA strategies for 6G and beyond communications.Comment: Submitted to IEEE for publicatio

Sum Throughput Maximization in Multi-Tag Backscattering to Multiantenna Reader

Backscatter communication (BSC) is being realized as the core technology for pervasive sustainable Internet-of-Things applications. However, owing to the resource-limitations of passive tags, the efficient usage of multiple antennas at the reader is essential for both downlink excitation and uplink detection. This work targets at maximizing the achievable sum-backscattered-throughput by jointly optimizing the transceiver (TRX) design at the reader and backscattering coefficients (BC) at the tags. Since, this joint problem is nonconvex, we first present individually-optimal designs for the TRX and BC. We show that with precoder and {combiner} designs at the reader respectively targeting downlink energy beamforming and uplink Wiener filtering operations, the BC optimization at tags can be reduced to a binary power control problem. Next, the asymptotically-optimal joint-TRX-BC designs are proposed for both low and high signal-to-noise-ratio regimes. Based on these developments, an iterative low-complexity algorithm is proposed to yield an efficient jointly-suboptimal design. Thereafter, we discuss the practical utility of the proposed designs to other application settings like wireless powered communication networks and BSC with imperfect channel state information. Lastly, selected numerical results, validating the analysis and shedding novel insights, demonstrate that the proposed designs can yield significant enhancement in the sum-backscattered throughput over existing benchmarks.Comment: 17 pages, 5 figures, accepted for publication in IEEE Transactions on Communication

Sum Rates, Rate Allocation, and User Scheduling for Multi-User MIMO Vector Perturbation Precoding

This paper considers the multiuser multiple-input multiple-output (MIMO) broadcast channel. We consider the case where the multiple transmit antennas are used to deliver independent data streams to multiple users via vector perturbation. We derive expressions for the sum rate in terms of the average energy of the precoded vector, and use this to derive a high signal-to-noise ratio (SNR) closed-form upper bound, which we show to be tight via simulation. We also propose a modification to vector perturbation where different rates can be allocated to different users. We conclude that for vector perturbation precoding most of the sum rate gains can be achieved by reducing the rate allocation problem to the user selection problem. We then propose a low-complexity user selection algorithm that attempts to maximize the high-SNR sum rate upper bound. Simulations show that the algorithm outperforms other user selection algorithms of similar complexity.Comment: 27 pages with 6 figures and 2 tables. Accepted for publication in IEEE Trans. Wireless Comm