TY - GEN
T1 - Robust uplink communications over fading channels with variable backhaul connectivity
AU - Karasik, Roy
AU - Simeone, Osvaldo
AU - Shitz, Shlomo Shamai
N1 - Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.
PY - 2013
Y1 - 2013
N2 - Two mobile users communicate with a central decoder via two base stations. Communication between the mobile users and the base stations takes place over a Gaussian interference channel with constant channel gains or quasi-static fading. Instead, the base stations are connected to the central decoder through orthogonal finite-capacity links, whose connectivity is subject to random fluctuations. There is only receive-side channel state information, and hence the mobile users are unaware of the channel state and of the backhaul connectivity state, while the base stations know the fading coefficients but are uncertain about the backhaul links' state. The base stations are oblivious to the mobile users' codebooks and employ compress-and-forward to relay information to the central decoder. Lower bounds on average achievable throughput are obtained by proposing strategies that combine the broadcast coding approach and layered distributed compression techniques. Numerical results confirm the advantages of the proposed approach with respect to conventional non-robust strategies in both scenarios with and without fading.
AB - Two mobile users communicate with a central decoder via two base stations. Communication between the mobile users and the base stations takes place over a Gaussian interference channel with constant channel gains or quasi-static fading. Instead, the base stations are connected to the central decoder through orthogonal finite-capacity links, whose connectivity is subject to random fluctuations. There is only receive-side channel state information, and hence the mobile users are unaware of the channel state and of the backhaul connectivity state, while the base stations know the fading coefficients but are uncertain about the backhaul links' state. The base stations are oblivious to the mobile users' codebooks and employ compress-and-forward to relay information to the central decoder. Lower bounds on average achievable throughput are obtained by proposing strategies that combine the broadcast coding approach and layered distributed compression techniques. Numerical results confirm the advantages of the proposed approach with respect to conventional non-robust strategies in both scenarios with and without fading.
UR - http://www.scopus.com/inward/record.url?scp=84890382369&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84890382369&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2013.6620411
DO - 10.1109/ISIT.2013.6620411
M3 - Conference contribution
AN - SCOPUS:84890382369
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1172
EP - 1176
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 -