TY - GEN
T1 - On efficient min-cut approximations in half-duplex relay networks
AU - Etkin, Raul
AU - Parvaresh, Farzad
AU - Shomorony, Ilan
AU - Avestimehr, A. Salman
PY - 2013
Y1 - 2013
N2 - Computing the cut-set bound in half-duplex (HD) relay networks is a challenging optimization problem that involves an exponential number of variables and constraints (exponential in the number of nodes in the network). We present a general technique for efficiently computing the HD schedule that maximizes the cut-set bound (with i.i.d. input distribution) in layered Gaussian relay networks. We use simulations to show running time improvements over alternative methods and compare the performance of various HD scheduling approaches in different SNR regimes.
AB - Computing the cut-set bound in half-duplex (HD) relay networks is a challenging optimization problem that involves an exponential number of variables and constraints (exponential in the number of nodes in the network). We present a general technique for efficiently computing the HD schedule that maximizes the cut-set bound (with i.i.d. input distribution) in layered Gaussian relay networks. We use simulations to show running time improvements over alternative methods and compare the performance of various HD scheduling approaches in different SNR regimes.
UR - https://www.scopus.com/pages/publications/84890396951
UR - https://www.scopus.com/pages/publications/84890396951#tab=citedBy
U2 - 10.1109/ISIT.2013.6620566
DO - 10.1109/ISIT.2013.6620566
M3 - Conference contribution
AN - SCOPUS:84890396951
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1949
EP - 1953
BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013
T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013
Y2 - 7 July 2013 through 12 July 2013
ER -