On the capacity of MIMO relay channels

Bo Wang, Junshan Zhang, Anders Høst-Madsen

IEEE Transactions on Information Theory · 2005 · 828 citations · 29 references

Concepts

TL;DR

The paper studies the capacity of MIMO relay channels, investigates conditions for achieving ergodic capacity, and proposes a cooperative communication application in ad hoc networks. The authors analyze Gaussian and Rayleigh‑fading MIMO relay channels, deriving upper and lower capacity bounds via convex programming and providing algorithms to compute them. They find that the ergodic capacity bounds coincide under certain regularity conditions, allowing exact capacity characterization, and present numerical results illustrating these bounds.

Abstract

We study the capacity of multiple-input multiple- output (MIMO) relay channels. We first consider the Gaussian MIMO relay channel with fixed channel conditions, and derive upper bounds and lower bounds that can be obtained numerically by convex programming. We present algorithms to compute the bounds. Next, we generalize the study to the Rayleigh fading case. We find an upper bound and a lower bound on the ergodic capacity. It is somewhat surprising that the upper bound can meet the lower bound under certain regularity conditions (not necessarily degradedness), and therefore the capacity can be characterized exactly; previously this has been proven only for the degraded Gaussian relay channel. We investigate sufficient conditions for achieving the ergodic capacity; and in particular, for the case where all nodes have the same number of antennas, the capacity can be achieved under certain signal-to-noise ratio (SNR) conditions. Numerical results are also provided to illustrate the bounds on the ergodic capacity of the MIMO relay channel over Rayleigh fading. Finally, we present a potential application of the MIMO relay channel for cooperative communications in ad hoc networks.

References

29