TY - GEN
T1 - Align-and-forward relaying for two-hop erasure broadcast channels
AU - Kao, David T.H.
AU - Maddah-Ali, Mohammad Ali
AU - Avestimehr, A. Salman
PY - 2014
Y1 - 2014
N2 - We consider the problem of broadcast over wireless erasure networks. To understand the challenges and opportunities of these setups, we study a two-hop erasure broadcast channel consisting of a single source, two relays, and two destinations desiring independent messages. In our network, no transmitter has channel state knowledge of erasures on outgoing links (i.e., no CSIT): The source has no knowledge of any channel state, each relay only has knowledge of the channel states of its incoming link, and destinations are provided with full channel knowledge. We propose a scheme, referred to as Align-and-Forward, that exploits the (unknown) common subspace of received signals at the relays, which results from the source-to-relay broadcast, in order to minimize the dimension of the interference subspace at each destination. We show that Align-and-Forward outperforms available alternative schemes in terms of sum-rate. We also present new outer-bounds and demonstrate the optimality of Align-and-Forward in certain regimes.
AB - We consider the problem of broadcast over wireless erasure networks. To understand the challenges and opportunities of these setups, we study a two-hop erasure broadcast channel consisting of a single source, two relays, and two destinations desiring independent messages. In our network, no transmitter has channel state knowledge of erasures on outgoing links (i.e., no CSIT): The source has no knowledge of any channel state, each relay only has knowledge of the channel states of its incoming link, and destinations are provided with full channel knowledge. We propose a scheme, referred to as Align-and-Forward, that exploits the (unknown) common subspace of received signals at the relays, which results from the source-to-relay broadcast, in order to minimize the dimension of the interference subspace at each destination. We show that Align-and-Forward outperforms available alternative schemes in terms of sum-rate. We also present new outer-bounds and demonstrate the optimality of Align-and-Forward in certain regimes.
UR - https://www.scopus.com/pages/publications/84906542527
UR - https://www.scopus.com/pages/publications/84906542527#tab=citedBy
U2 - 10.1109/ISIT.2014.6875170
DO - 10.1109/ISIT.2014.6875170
M3 - Conference contribution
AN - SCOPUS:84906542527
SN - 9781479951864
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1932
EP - 1936
BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 IEEE International Symposium on Information Theory, ISIT 2014
Y2 - 29 June 2014 through 4 July 2014
ER -