TY - GEN
T1 - Flexible backhaul design and degrees of freedom for linear interference networks
AU - El Gamal, Aly
AU - Veeravalli, Venugopal V.
PY - 2014
Y1 - 2014
N2 - The considered problem is that of maximizing the degrees of freedom (DoF) in cellular downlink, under a backhaul load constraint that limits the number of messages that can be delivered from a centralized controller to the base station transmitters. A linear interference channel model is considered, where each transmitter is connected to the receiver having the same index as well as one succeeding receiver. The backhaul load is defined as the sum of all the messages available at all the transmitters normalized by the number of users. When the backhaul load is constrained to an integer level B, the asymptotic per user DoF is shown to equal equation, and it is shown that the optimal assignment of messages to transmitters is asymmetric and satisfies a local cooperation constraint and that the optimal coding scheme relies only on zero-forcing transmit beamforming. Finally, an extension of the presented coding scheme for the case where B = 1 is shown to apply for more general locally connected and two-dimensional networks.
AB - The considered problem is that of maximizing the degrees of freedom (DoF) in cellular downlink, under a backhaul load constraint that limits the number of messages that can be delivered from a centralized controller to the base station transmitters. A linear interference channel model is considered, where each transmitter is connected to the receiver having the same index as well as one succeeding receiver. The backhaul load is defined as the sum of all the messages available at all the transmitters normalized by the number of users. When the backhaul load is constrained to an integer level B, the asymptotic per user DoF is shown to equal equation, and it is shown that the optimal assignment of messages to transmitters is asymmetric and satisfies a local cooperation constraint and that the optimal coding scheme relies only on zero-forcing transmit beamforming. Finally, an extension of the presented coding scheme for the case where B = 1 is shown to apply for more general locally connected and two-dimensional networks.
UR - http://www.scopus.com/inward/record.url?scp=84906536026&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84906536026&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2014.6875323
DO - 10.1109/ISIT.2014.6875323
M3 - Conference contribution
AN - SCOPUS:84906536026
SN - 9781479951864
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2694
EP - 2698
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 -