## Type of Work

Article (4) Book (0) Theses (0) Multimedia (0)

## Peer Review

Peer-reviewed only (0)

## Supplemental Material

Video (0) Audio (0) Images (0) Zip (0) Other files (0)

## Publication Year

## Campus

UC Berkeley (0) UC Davis (0) UC Irvine (4) UCLA (0) UC Merced (0) UC Riverside (0) UC San Diego (0) UCSF (0) UC Santa Barbara (0) UC Santa Cruz (0) UC Office of the President (0) Lawrence Berkeley National Laboratory (0) UC Agriculture & Natural Resources (0)

## Department

Center for Pervasive Communications and Computing (4)

## Journal

## Discipline

Engineering (4)

## Reuse License

## Scholarly Works (4 results)

In this paper we investigate the sum degrees of freedom (DoF) of multiple unicasts in a wireless network. With 2 source nodes, 2 destination nodes, there are a total of 4 independent unicast sessions (messages), one from each source to each sink node (this setting is also known as an X network), and also there is a delay-free relay working in full-duplex mode helping the transmissions from the source to destination nodes. For such a channel setting, we prove that 5/3 DoF is achievable almost surely for time-varying/frequency-selective channels, based on the ideas of aligned interference neutralization, linear forwarding and interference alignment. Also, the achievable scheme can be easily translated to the rational alignment scheme for the network with constant-values channel coefficients. In addition, we provide an intuition for the 5/3 DoF result from the perspective of counting the number of linear equations and variables.

We investigate the optimality of linear interference

alignment (allowing symbol extensions) for Â 3-user

$M_T\times M_R$ MIMO interference channel where $M_T$ and $M_R$

denote the number of antennas at each transmitter and each receiver,

respectively, and the \emph{channel coefficients are held constant}. Recently, Wang et al. have conjectured that interference alignment based on linear beamforming using only proper Gaussian codebooks and possibly with symbol extensions, is sufficient to achieve the information theoretic DoF outer bound for all $M_T, M_R$ values except

if $|M_T-M_R|=1$, $\min(M_T,M_R)\geq 2$. A partial proof of the conjecture is provided by Wang et al. for arbitrary $M_T, M_R$ values subject to a final numerical evaluation step that needs to be performed for each $M_T, M_R$ setting to complete the proof. The numerical evaluation step is also carried out explicitly by Wang et al. to settle the conjecture for all Â $M_T, M_R$ values up to 10. For $|M_T-M_R|=1$, $\min(M_T,M_R)\geq 2$, Wang et al. show that interference alignment schemes based on linear beamforming with proper Gaussian signaling and symbol extensions are not sufficient to achieve the information-theoretic DoF outer bonds. In contrast, in this note we show, for all $M_T, M_R$ values up to 10, that interference alignment schemes based on linear beamforming over symbol extensions are enough to achieve the information theoretic DoF outer bounds for constant channels, if \emph{asymmetric complex signaling} is utilized. Based on this new insight, we conjecture that linear interference alignment is optimal for achieving the information theoretic DoF outer bounds for all $M_T, M_R$ values in the 3 user $M_T\times M_R$ MIMO interference channel with constant channel coefficients, except for the case $M_T=M_R=1$ where it is known that either time/frequency-varying channels or non-linear (e.g., rational alignment) schemes are required.