996 research outputs found
Degrees of Freedom of Two-Hop Wireless Networks: "Everyone Gets the Entire Cake"
We show that fully connected two-hop wireless networks with K sources, K
relays and K destinations have K degrees of freedom both in the case of
time-varying channel coefficients and in the case of constant channel
coefficients (in which case the result holds for almost all values of constant
channel coefficients). Our main contribution is a new achievability scheme
which we call Aligned Network Diagonalization. This scheme allows the data
streams transmitted by the sources to undergo a diagonal linear transformation
from the sources to the destinations, thus being received free of interference
by their intended destination. In addition, we extend our scheme to multi-hop
networks with fully connected hops, and multi-hop networks with MIMO nodes, for
which the degrees of freedom are also fully characterized.Comment: Presented at the 2012 Allerton Conference. Submitted to IEEE
Transactions on Information Theor
A Systematic Approach for Interference Alignment in CSIT-less Relay-Aided X-Networks
The degrees of freedom (DoF) of an X-network with M transmit and N receive
nodes utilizing interference alignment with the support of relays each
equipped with antennas operating in a half-duplex non-regenerative mode
is investigated. Conditions on the feasibility of interference alignment are
derived using a proper transmit strategy and a structured approach based on a
Kronecker-product representation. The advantages of this approach are twofold:
First, it extends existing results on the achievable DoF to generalized antenna
configurations. Second, it unifies the analysis for time-varying and constant
channels and provides valuable insights and interconnections between the two
channel models. It turns out that a DoF of \nicefrac{NM}{M+N-1} is feasible
whenever the sum of the
- β¦