Multiplexing Gain of Amplify-Forward Relaying in Wireless Multi-Antenna Relay Networks
Information Theory
2009-12-22 v1 math.IT
Abstract
This paper studies the general multi-antenna multiple-relay network. Every two nodes of the network are either connected together through a Rayleigh fading channel or disconnected. We study the ergodic capacity of the network in the high SNR regime. We prove that the traditional amplify-forward relaying achieves the maximum multiplexing gain of the network. Furthermore, we show that the maximum multiplexing gain of the network is equal to the minimum vertex cut-set of the underlying graph of the network, which can be computed in polynomial time in terms of the number of network nodes. Finally, the argument is extended to the multicast and multi-access scenarios.
Keywords
Cite
@article{arxiv.0912.3981,
title = {Multiplexing Gain of Amplify-Forward Relaying in Wireless Multi-Antenna Relay Networks},
author = {Shahab Oveis Gharan and Amir K. Khandani},
journal= {arXiv preprint arXiv:0912.3981},
year = {2009}
}
Comments
Submitted to the IEEE transaction on Information Theory in Dec. 2009