Search

The $K$ -user multiple-input and multiple-output (MIMO) broadcast channel (BC) with no channel state information at the transmitter is considered, where each receiver is assumed to be equipped with either conventional antennas or reconfigurable antennas in which each reconfigurable antenna is capable of choosing a subset of receiving modes from several preset modes. Under general antenna configurations, the sum linear degrees of freedom (DoFs) of the $K$ -user MIMO BC with reconfigurable antennas are completely characterized, which corresponds to the maximum sum DoF achievable by linear coding strategies. [ABSTRACT FROM PUBLISHER]

We show that the 2\,\times \,2\,\times \,2 interference network, i.e., the multihop interference network formed by concatenation of two two-user interference channels achieves the min-cut outer bound value of 2 DoF, for almost all values of channel coefficients, for both time-varying or fixed-channel coefficients. The key to this result is a new idea, called aligned interference neutralization, that provides a way to align interference terms over each hop in a manner that allows them to be canceled over the air at the last hop. [ABSTRACT FROM PUBLISHER]

We study a layered K-user M-hop Gaussian relay network consisting of Km nodes in the m^th layer, where M\geq 2 and K=K1=KM+1. We observe that the time-varying nature of wireless channels or fading can be exploited to mitigate the interuser interference. The proposed amplify-and-forward relaying scheme exploits such channel variations and works for a wide class of channel distributions including Rayleigh fading. We show a general achievable degrees of freedom (DoF) region for this class of Gaussian relay networks. Specifically, the set of all (d1,\ldots , dK) such that di\leq 1 for all i and \sum i=1^{K} di\leq K\Sigma is achievable, where di is the DoF of the i^th source-destination pair and K\Sigma is the maximum integer such that K\Sigma \leq \mathop min\limits m\{Km\} and M/K\Sigma is an integer. We show that surprisingly the achievable DoF region coincides with the cut-set outer bound if M/ \mathop min\limits m\{Km\} is an integer; thus, interference-free communication is possible in terms of DoF. We further characterize an achievable DoF region assuming multi-antenna nodes and general message set, which again coincides with the cut-set outer bound for a certain class of networks. [ABSTRACT FROM PUBLISHER]