Linear Precoding Based on Polynomial Expansion: Large-Scale Multi-Cell MIMO Systems

Large-scale MIMO systems can yield a substantial improvement in spectral efficiency for future communication systems. Due to the finer spatial resolution achieved by a huge number of antennas at the base stations, these systems have shown to be robust to inter-user interference and the use of linear precoding is asymptotically optimal. However, most precoding schemes exhibit high computational complexity as the system dimensions increase. For example, the near-optimal RZF requires the inversion of a large matrix. This motivated our companion paper, where we proposed to solve the issue in single-cell multi-user systems by approximating the matrix inverse by a truncated polynomial expansion (TPE), where the polynomial coefficients are optimized to maximize the system performance. We have shown that the proposed TPE precoding with a small number of coefficients reaches almost the performance of RZF but never exceeds it. In a realistic multi-cell scenario involving large-scale multi-user MIMO systems, the optimization of RZF precoding has thus far not been feasible. This is mainly attributed to the high complexity of the scenario and the non-linear impact of the necessary regularizing parameters. On the other hand, the scalar weights in TPE precoding give hope for possible throughput optimization. Following the same methodology as in the companion paper, we exploit random matrix theory to derive a deterministic expression for the asymptotic SINR for each user. We also provide an optimization algorithm to approximate the weights that maximize the network-wide weighted max-min fairness. The optimization weights can be used to mimic the user throughput distribution of RZF precoding. Using simulations, we compare the network throughput of the TPE precoding with that of the suboptimal RZF scheme and show that our scheme can achieve higher throughput using a TPE order of only 3

Rate-Splitting Robustness in Multi-Pair Massive MIMO Relay Systems

Relay systems improve both coverage and system capacity. Toward this direction, a full-duplex (FD) technology, being able to boost the spectral efficiency by transmitting and receiving simultaneously on the same frequency and time resources, is envisaged to play a key role in future networks. However, its benefits come at the expense of self-interference (SI) from their own transmit signal. At the same time, massive multiple-input massive multiple-output systems, bringing unconventionally many antennas, emerge as a promising technology with huge degrees-of-freedom. To this end, this paper considers a multi-pair decode-and-forward FD relay channel, where the relay station is deployed with a large number of antennas. Moreover, the rate-splitting (RS) transmission has recently been shown to provide significant performance benefits in various multi-user scenarios with imperfect channel state information at the transmitter (CSIT). Engaging the RS approach, we employ the deterministic equivalent analysis to derive the corresponding sum-rates in the presence of interferences. Initially, numerical results demonstrate the robustness of RS in half-duplex (HD) systems, since the achievable sum-rate increases without bound, i.e., it does not saturate at high signal-to-noise ratio. Next, we tackle the detrimental effect of SI in FD. In particular, and most importantly, not only FD outperforms HD, but also RS enables increasing the range of SI over which FD outperforms HD. Furthermore, increasing the number of relay station antennas, RS appears to be more efficacious due to imperfect CSIT, since SI decreases. Interestingly, increasing the number of users, the efficiency of RS worsens and its implementation becomes less favorable under these conditions. Finally, we verify that the proposed DEs, being accurate for a large number of relay station antennas, are tight approximations even for realistic system dimensions.Peer reviewedFinal Accepted Versio

Multicast Multigroup Precoding and User Scheduling for Frame-Based Satellite Communications

The present work focuses on the forward link of a broadband multibeam satellite system that aggressively reuses the user link frequency resources. Two fundamental practical challenges, namely the need to frame multiple users per transmission and the per-antenna transmit power limitations, are addressed. To this end, the so-called frame-based precoding problem is optimally solved using the principles of physical layer multicasting to multiple co-channel groups under per-antenna constraints. In this context, a novel optimization problem that aims at maximizing the system sum rate under individual power constraints is proposed. Added to that, the formulation is further extended to include availability constraints. As a result, the high gains of the sum rate optimal design are traded off to satisfy the stringent availability requirements of satellite systems. Moreover, the throughput maximization with a granular spectral efficiency versus SINR function, is formulated and solved. Finally, a multicast-aware user scheduling policy, based on the channel state information, is developed. Thus, substantial multiuser diversity gains are gleaned. Numerical results over a realistic simulation environment exhibit as much as 30% gains over conventional systems, even for 7 users per frame, without modifying the framing structure of legacy communication standards.Comment: Accepted for publication to the IEEE Transactions on Wireless Communications, 201

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

Rate-Splitting to Mitigate Residual Transceiver Hardware Impairments in Massive MIMO Systems

Rate-Splitting (RS) has recently been shown to provide significant performance benefits in various multi-user transmission scenarios. In parallel, the huge degrees-of-freedom provided by the appealing massive Multiple-Input Multiple-Output (MIMO) necessitate the employment of inexpensive hardware, being more prone to hardware imperfections, in order to be a cost-efficient technology. Hence, in this work, we focus on a realistic massive Multiple-Input Single-Output (MISO) Broadcast Channel (BC) hampered by the inevitable hardware impairments. We consider a general experimentally validated model of hardware impairments, accounting for the presence of \textit{multiplicative distortion} due to phase noise, \textit{additive distortion noise} and \textit{thermal noise amplification}. Under both scenarios with perfect and imperfect channel state information at the transmitter (CSIT), we analyze the potential robustness of RS to each separate hardware imperfection. We analytically assess the sum-rate degradation due to hardware imperfections. Interestingly, in the case of imperfect CSIT, we demonstrate that RS is a robust strategy for multiuser MIMO in the presence of phase and amplified thermal noise, since its sum-rate does not saturate at high signal-to-noise ratio (SNR), contrary to conventional techniques. On the other hand, the additive impairments always lead to a sum-rate saturation at high SNR, even after the application of RS. However, RS still enhances the performance. Furthermore, as the number of users increases, the gains provided by RS decrease not only in ideal conditions, but in practical conditions with RTHIs as well.Comment: accepted in IEEE TVT. arXiv admin note: text overlap with arXiv:1702.0116

On the capacity of MIMO broadcast channels with partial side information

In multiple-antenna broadcast channels, unlike point-to-point multiple-antenna channels, the multiuser capacity depends heavily on whether the transmitter knows the channel coefficients to each user. For instance, in a Gaussian broadcast channel with M transmit antennas and n single-antenna users, the sum rate capacity scales like Mloglogn for large n if perfect channel state information (CSI) is available at the transmitter, yet only logarithmically with M if it is not. In systems with large n, obtaining full CSI from all users may not be feasible. Since lack of CSI does not lead to multiuser gains, it is therefore of interest to investigate transmission schemes that employ only partial CSI. We propose a scheme that constructs M random beams and that transmits information to the users with the highest signal-to-noise-plus-interference ratios (SINRs), which can be made available to the transmitter with very little feedback. For fixed M and n increasing, the throughput of our scheme scales as MloglognN, where N is the number of receive antennas of each user. This is precisely the same scaling obtained with perfect CSI using dirty paper coding. We furthermore show that a linear increase in throughput with M can be obtained provided that M does not not grow faster than logn. We also study the fairness of our scheduling in a heterogeneous network and show that, when M is large enough, the system becomes interference dominated and the probability of transmitting to any user converges to 1/n, irrespective of its path loss. In fact, using M=αlogn transmit antennas emerges as a desirable operating point, both in terms of providing linear scaling of the throughput with M as well as in guaranteeing fairness