Asymptotic Capacity and Optimal Precoding in MIMO Multi-Hop Relay Networks

Nadia Fawaz (1) , Keyvan Zarifi (2) , Merouane Debbah (3) , David Gesbert (4)

1 MIT - Massachusetts Institute of Technology
2 Concordia University [Montreal]
3 Chaire Radio Flexible - Chaire Radio Flexible Alcatel-Lucent/Supélec
4 Eurecom [Sophia Antipolis]

A multi-hop relaying system is analyzed where data sent by a multi-antenna source is relayed by successive multiantenna relays until it reaches a multi-antenna destination. Assuming correlated fading at each hop, each relay receives a faded version of the signal from the previous level, performs linear precoding and retransmits it to the next level. Using free probability theory and assuming that the noise power at relays--but not at destination-- is negligible, the closed-form expression of the asymptotic instantaneous end-to-end mutual information is derived as the number of antennas at all levels grows large. The so-obtained deterministic expression is independent from the channel realizations while depending only on channel statistics. This expression is also shown to be equal to the asymptotic average end-to-end mutual information. The singular vectors of the optimal precoding matrices, maximizing the average mutual information with finite number of antennas at all levels, are also obtained. It turns out that these vectors are aligned to the eigenvectors of the channel correlation matrices. Thus they can be determined using only the channel statistics. As the structure of the singular vectors of the optimal precoders is independent from the system size, it is also optimal in the asymptotic regime.

Domains: Computer Science [cs]; Information Theory [cs.IT]; Mathematics [math]; Information Theory [math.IT]

Nadia Fawaz, Keyvan Zarifi, Merouane Debbah, David Gesbert. Asymptotic Capacity and Optimal Precoding in MIMO Multi-Hop Relay Networks. IEEE Transactions on Information Theory, 2011, 57 (4), pp.2050-2069. ⟨10.1109/TIT.2011.2111830⟩. ⟨hal-00647623⟩