TY - GEN

T1 - Gaussian MIMO half-duplex relay networks

T2 - IEEE International Symposium on Information Theory, ISIT 2015

AU - Cardone, Martina

AU - Tuninetti, Daniela

AU - Knopp, Raymond

PY - 2015/9/28

Y1 - 2015/9/28

N2 - This paper considers a Gaussian network where N half-duplex multiple-antenna relays assist the communication between a source and a destination. A novel antenna switching policy is proposed, where each relays' antenna can be configured to either receive or transmit independently of the others. The rate achieved by noisy network coding is shown to be to within a constant gap from the cut-set bound, where the gap only depends on the total number of antennas in the system. Moreover, the optimal number of different relay antenna configurations needed to attain the constant gap is proved to be at most N + 1, that is, it only depends on the number of relays but not on the total number of antennas. Such a relay scheduling policy is referred to as simple. Through an example, it is shown that independently switching the antennas at the relays not only achieves in general strictly higher rates compared to using the antennas for the same purpose, but can actually provide a strictly larger pre-log factor. This implies that in broadband wireless networks with half-duplex multiple-antenna relays, the relay antennas should be dynamically configured to either transmit of receive depending on the channel conditions.

AB - This paper considers a Gaussian network where N half-duplex multiple-antenna relays assist the communication between a source and a destination. A novel antenna switching policy is proposed, where each relays' antenna can be configured to either receive or transmit independently of the others. The rate achieved by noisy network coding is shown to be to within a constant gap from the cut-set bound, where the gap only depends on the total number of antennas in the system. Moreover, the optimal number of different relay antenna configurations needed to attain the constant gap is proved to be at most N + 1, that is, it only depends on the number of relays but not on the total number of antennas. Such a relay scheduling policy is referred to as simple. Through an example, it is shown that independently switching the antennas at the relays not only achieves in general strictly higher rates compared to using the antennas for the same purpose, but can actually provide a strictly larger pre-log factor. This implies that in broadband wireless networks with half-duplex multiple-antenna relays, the relay antennas should be dynamically configured to either transmit of receive depending on the channel conditions.

KW - Approximate capacity

KW - half-duplex networks

KW - multiple-antenna nodes

KW - relay scheduling policies

UR - http://www.scopus.com/inward/record.url?scp=84969884839&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84969884839&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2015.7282659

DO - 10.1109/ISIT.2015.7282659

M3 - Conference contribution

AN - SCOPUS:84969884839

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1267

EP - 1271

BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 14 June 2015 through 19 June 2015

ER -