Network Simplification: The Gaussian diamond network with multiple antennas

We consider the N-relay Gaussian diamond network when the source and the destination have n<inf>s</inf> ≥ 2 and n<inf>d</inf> ≥ 2 antennas respectively. We show that when n<inf>s</inf> = n<inf>d</inf> = 2 and when the individual MISO channels from the source to each relay and the SIMO channels from each relay to the destination have the same capacity, there exists a two relay sub-network that achieves approximately all the capacity of the network. To prove this result, we establish a simple relation between the joint entropies of three Gaussian random variables, which is not implied by standard Shannon-type entropy inequalities.<sup>1</sup>

[1]  Suhas N. Diggavi,et al.  Approximately achieving Gaussian relay network capacity with lattice codes , 2010, 2010 IEEE International Symposium on Information Theory.

[2]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[3]  Arogyaswami Paulraj,et al.  Receive antenna selection for MIMO flat-fading channels: theory and algorithms , 2003, IEEE Trans. Inf. Theory.

[4]  Moe Z. Win,et al.  Capacity of MIMO systems with antenna selection , 2001, IEEE Transactions on Wireless Communications.

[5]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[6]  Aria Nosratinia,et al.  Antenna selection in MIMO systems , 2004, IEEE Communications Magazine.

[7]  Suhas N. Diggavi,et al.  Wireless Network Information Flow: A Deterministic Approach , 2009, IEEE Transactions on Information Theory.

[8]  C. Pan,et al.  Rank-Revealing QR Factorizations and the Singular Value Decomposition , 1992 .

[9]  Yi Jiang,et al.  The RF-chain limited mimo system- part I: optimum diversity-multiplexing tradeoff , 2009, IEEE Transactions on Wireless Communications.

[10]  Arogyaswami Paulraj,et al.  Receive antenna selection for MIMO spatial multiplexing: theory and algorithms , 2003, IEEE Trans. Signal Process..