Achievable DoF-delay trade-offs for the K-user MIMO interference channel with delayed CSIT

©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The degrees of freedom (DoFs) of the K-user multiple-input multiple-output (MIMO) interference channel are studied when perfect, but delayed channel state information is available at the transmitter side (delayed CSIT). Recent works have proposed schemes improving the DoF knowledge of the interference channel, but at the cost of developing transmission involving many channel uses (long delay), thus increasing the complexity at both transmitter and receiver side. This paper proposes three linear precoding strategies, limited to at most three phases, based on the concept of interference alignment, and built upon three main ingredients: delayed CSIT precoding, user scheduling, and redundancy transmission. In this respect, the interference alignment is realized by exploiting delayed CSIT to align the interference at the non-intended receivers along the space-time domain. Moreover, a new framework is proposed where the number of transmitted symbols and duration of the phases is obtained as the solution of a maximization problem, and enabling the introduction of complexity constraints, which allows deriving the achievable DoF as a function of the transmission delay, i.e., the achievable DoF-delay trade-off. Finally, the latter part of this paper settles that the assumption of time-varying channels common along all the literature on delayed CSIT is indeed unnecessary.Peer ReviewedPostprint (author's final draft

Statistical Mechanics Analysis of LDPC Coding in MIMO Gaussian Channels

Using analytical methods of statistical mechanics, we analyse the typical behaviour of a multiple-input multiple-output (MIMO) Gaussian channel with binary inputs under LDPC network coding and joint decoding. The saddle point equations for the replica symmetric solution are found in particular realizations of this channel, including a small and large number of transmitters and receivers. In particular, we examine the cases of a single transmitter, a single receiver and the symmetric and asymmetric interference channels. Both dynamical and thermodynamical transitions from the ferromagnetic solution of perfect decoding to a non-ferromagnetic solution are identified for the cases considered, marking the practical and theoretical limits of the system under the current coding scheme. Numerical results are provided, showing the typical level of improvement/deterioration achieved with respect to the single transmitter/receiver result, for the various cases.Comment: 25 pages, 7 figure

Cognitive Wyner Networks with Clustered Decoding

We study an interference network where equally-numbered transmitters and receivers lie on two parallel lines, each transmitter opposite its intended receiver. We consider two short-range interference models: the "asymmetric network," where the signal sent by each transmitter is interfered only by the signal sent by its left neighbor (if present), and a "symmetric network," where it is interfered by both its left and its right neighbors. Each transmitter is cognizant of its own message, the messages of the $t_\ell$ transmitters to its left, and the messages of the $t_r$ transmitters to its right. Each receiver decodes its message based on the signals received at its own antenna, at the $r_\ell$ receive antennas to its left, and the $r_r$ receive antennas to its right. For such networks we provide upper and lower bounds on the multiplexing gain, i.e., on the high-SNR asymptotic logarithmic growth of the sum-rate capacity. In some cases our bounds meet, e.g., for the asymmetric network. Our results exhibit an equivalence between the transmitter side-information parameters $t_\ell, t_r$ and the receiver side-information parameters $r_\ell, r_r$ in the sense that increasing/decreasing $t_\ell$ or $t_r$ by a positive integer $\delta$ has the same effect on the multiplexing gain as increasing/decreasing $r_\ell$ or $r_r$ by $\delta$. Moreover---even in asymmetric networks---there is an equivalence between the left side-information parameters $t_\ell, r_\ell$ and the right side-information parameters $t_r, r_r$.Comment: Second revision submitted to IEEE Transactions on Information Theor