Achievable DoF Regions of MIMO Networks With Imperfect CSIT

We focus on a two-receiver multiple-input-multiple-output (MIMO), broadcast channel (BC), and interference channel (IC) with an arbitrary number of antennas at each node. We assume an imperfect knowledge of local channel state information at the transmitters, whose error decays with the signal-to-noise-ratio. With such configuration, we characterize the achievable degrees-of-freedom (DoF) regions in both BC and IC, by proposing a rate-splitting (RS) approach, which divides each receiver's message into a common part and a private part. Compared with the RS scheme designed for the symmetric MIMO case, the novelties of the proposed block lie in: 1) delivering additional non-ZF-precoded private symbols to the receiver with the greater number of antennas and 2) a space-time implementation. These features provide more flexibilities in balancing the common-message-decodabilities at the two receivers, and fully exploit asymmetric antenna arrays. Besides, in IC, we modify the power allocation designed for the asymmetric BC based on the signal space, where the two transmitted signals interfere with each other. We also derive an outer-bound for the DoF regions and show that the proposed achievable DoF regions are optimal under some antenna configurations and channel state information at the transmitter side qualities

MISO Networks with Imperfect CSIT: A Topological Rate-Splitting Approach

Recently, the Degrees-of-Freedom (DoF) region of multiple-input-single-output (MISO) networks with imperfect channel state information at the transmitter (CSIT) has attracted significant attentions. An achievable scheme is known as rate-splitting (RS) that integrates common-message-multicasting and private-message-unicasting. In this paper, focusing on the general $K$-cell MISO IC where the CSIT of each interference link has an arbitrary quality of imperfectness, we firstly identify the DoF region achieved by RS. Secondly, we introduce a novel scheme, so called Topological RS (TRS), whose novelties compared to RS lie in a multi-layer structure and transmitting multiple common messages to be decoded by groups of users rather than all users. The design of TRS is motivated by a novel interpretation of the $K$-cell IC with imperfect CSIT as a weighted-sum of a series of partially connected networks. We show that the DoF region achieved by TRS covers that achieved by RS. Also, we find the maximal sum DoF achieved by TRS via hypergraph fractional packing, which yields the best sum DoF so far. Lastly, for a realistic scenario where each user is connected to three dominant transmitters, we identify the sufficient condition where TRS strictly outperforms conventional schemes.Comment: submitted for publicatio

The Degrees of Freedom Region of Temporally Correlated MIMO Networks With Delayed CSIT

We consider the temporally-correlated Multiple-Input Multiple-Output (MIMO) broadcast channels (BC) and interference channels (IC) where the transmitter(s) has/have (i) delayed channel state information (CSI) obtained from a latency-prone feedback channel as well as (ii) imperfect current CSIT, obtained, e.g., from prediction on the basis of these past channel samples based on the temporal correlation. The degrees of freedom (DoF) regions for the two-user broadcast and interference MIMO networks with general antenna configuration under such conditions are fully characterized, as a function of the prediction quality indicator. Specifically, a simple unified framework is proposed, allowing to attain optimal DoF region for the general antenna configurations and current CSIT qualities. Such a framework builds upon block-Markov encoding with interference quantization, optimally combining the use of both outdated and instantaneous CSIT. A striking feature of our work is that, by varying the power allocation, every point in the DoF region can be achieved with one single scheme. As a result, instead of checking the achievability of every corner point of the outer bound region, as typically done in the literature, we propose a new systematic way to prove the achievability.Comment: Revised to IEEE Trans. Inf. Theory. A new simple and unified framework is proposed, allowing to attain optimal DoF region for general antenna configurations and current CSIT qualities. A striking feature is that, every corner point in the DoF region can be achieved with one single scheme, and hence a new systematic way is proposed to prove the achievability instead of checking every corner poin

On the Capacity Region of the Deterministic Y-Channel with Common and Private Messages

In multi user Gaussian relay networks, it is desirable to transmit private information to each user as well as common information to all of them. However, the capacity region of such networks with both kinds of information is not easy to characterize. The prior art used simple linear deterministic models in order to approximate the capacities of these Gaussian networks. This paper discusses the capacity region of the deterministic Y-channel with private and common messages. In this channel, each user aims at delivering two private messages to the other two users in addition to a common message directed towards both of them. As there is no direct link between the users, all messages must pass through an intermediate relay. We present outer-bounds on the rate region using genie aided and cut-set bounds. Then, we develop a greedy scheme to define an achievable region and show that at a certain number of levels at the relay, our achievable region coincides with the upper bound. Finally, we argue that these bounds for this setup are not sufficient to characterize the capacity region.Comment: 4 figures, 7 page

Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey

This paper provides a comprehensive review of the domain of physical layer security in multiuser wireless networks. The essential premise of physical-layer security is to enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers without relying on higher-layer encryption. This can be achieved primarily in two ways: without the need for a secret key by intelligently designing transmit coding strategies, or by exploiting the wireless communication medium to develop secret keys over public channels. The survey begins with an overview of the foundations dating back to the pioneering work of Shannon and Wyner on information-theoretic security. We then describe the evolution of secure transmission strategies from point-to-point channels to multiple-antenna systems, followed by generalizations to multiuser broadcast, multiple-access, interference, and relay networks. Secret-key generation and establishment protocols based on physical layer mechanisms are subsequently covered. Approaches for secrecy based on channel coding design are then examined, along with a description of inter-disciplinary approaches based on game theory and stochastic geometry. The associated problem of physical-layer message authentication is also introduced briefly. The survey concludes with observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials, 201