pith. sign in

arxiv: 0912.3981 · v1 · submitted 2009-12-20 · 💻 cs.IT · math.IT

Multiplexing Gain of Amplify-Forward Relaying in Wireless Multi-Antenna Relay Networks

classification 💻 cs.IT math.IT
keywords networkgainmultiplexingamplify-forwardmaximummulti-antennanodesrelaying
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.