Rate Splitting for MIMO Wireless Networks: A Promising PHY-Layer Strategy for LTE Evolution

MIMO processing plays a central part towards the recent increase in spectral and energy efficiencies of wireless networks. MIMO has grown beyond the original point-to-point channel and nowadays refers to a diverse range of centralized and distributed deployments. The fundamental bottleneck towards enormous spectral and energy efficiency benefits in multiuser MIMO networks lies in a huge demand for accurate channel state information at the transmitter (CSIT). This has become increasingly difficult to satisfy due to the increasing number of antennas and access points in next generation wireless networks relying on dense heterogeneous networks and transmitters equipped with a large number of antennas. CSIT inaccuracy results in a multi-user interference problem that is the primary bottleneck of MIMO wireless networks. Looking backward, the problem has been to strive to apply techniques designed for perfect CSIT to scenarios with imperfect CSIT. In this paper, we depart from this conventional approach and introduce the readers to a promising strategy based on rate-splitting. Rate-splitting relies on the transmission of common and private messages and is shown to provide significant benefits in terms of spectral and energy efficiencies, reliability and CSI feedback overhead reduction over conventional strategies used in LTE-A and exclusively relying on private message transmissions. Open problems, impact on standard specifications and operational challenges are also discussed.Comment: accepted to IEEE Communication Magazine, special issue on LTE Evolutio

Downlink Noncoherent Cooperation without Transmitter Phase Alignment

Multicell joint processing can mitigate inter-cell interference and thereby increase the spectral efficiency of cellular systems. Most previous work has assumed phase-aligned (coherent) transmissions from different base transceiver stations (BTSs), which is difficult to achieve in practice. In this work, a noncoherent cooperative transmission scheme for the downlink is studied, which does not require phase alignment. The focus is on jointly serving two users in adjacent cells sharing the same resource block. The two BTSs partially share their messages through a backhaul link, and each BTS transmits a superposition of two codewords, one for each receiver. Each receiver decodes its own message, and treats the signals for the other receiver as background noise. With narrowband transmissions the achievable rate region and maximum achievable weighted sum rate are characterized by optimizing the power allocation (and the beamforming vectors in the case of multiple transmit antennas) at each BTS between its two codewords. For a wideband (multicarrier) system, a dual formulation of the optimal power allocation problem across sub-carriers is presented, which can be efficiently solved by numerical methods. Results show that the proposed cooperation scheme can improve the sum rate substantially in the low to moderate signal-to-noise ratio (SNR) range.Comment: 30 pages, 6 figures, submitted to IEEE Transactions on Wireless Communication

Autonomous Algorithms for Centralized and Distributed Interference Coordination: A Virtual Layer Based Approach

Interference mitigation techniques are essential for improving the performance of interference limited wireless networks. In this paper, we introduce novel interference mitigation schemes for wireless cellular networks with space division multiple access (SDMA). The schemes are based on a virtual layer that captures and simplifies the complicated interference situation in the network and that is used for power control. We show how optimization in this virtual layer generates gradually adapting power control settings that lead to autonomous interference minimization. Thereby, the granularity of control ranges from controlling frequency sub-band power via controlling the power on a per-beam basis, to a granularity of only enforcing average power constraints per beam. In conjunction with suitable short-term scheduling, our algorithms gradually steer the network towards a higher utility. We use extensive system-level simulations to compare three distributed algorithms and evaluate their applicability for different user mobility assumptions. In particular, it turns out that larger gains can be achieved by imposing average power constraints and allowing opportunistic scheduling instantaneously, rather than controlling the power in a strict way. Furthermore, we introduce a centralized algorithm, which directly solves the underlying optimization and shows fast convergence, as a performance benchmark for the distributed solutions. Moreover, we investigate the deviation from global optimality by comparing to a branch-and-bound-based solution.Comment: revised versio