Approximate capacity of a class of multi-source Gaussian relay networks
Authors:
- 1 August 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
We study K-user M-hop Gaussian relay networks with Km nodes in the m-th layer, where M is even and K = K1 = KM+1. We observe that the time-varying nature of wireless channels (fading) can be exploited to mitigate the inter-user interference. The proposed block Markov encoding and relaying scheme exploits such channel variations and works for any isotropically distributed channels including Rayleigh fading. We show a general achievable degrees of freedom (DoF) region of this class of Gaussian relay networks, which coincides with the cut-set outer bound if M/Kmin is an integer, where Kmin = minm {Km}. Therefore, we completely characterize the DoF region for the case where M/Kmin is an integer.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Degrees of freedom of multi-source relay networks2009
- Approximate capacity of a class of Gaussian relay-interference networks2009
- Ergodic interference alignment2009
- Sum capacity of multi-source linear finite-field relay networks with fading2009
- Gaussian Interference Channel Capacity to Within One BitIEEE Transactions on Information Theory, 2008
- Interference Alignment and Degrees of Freedom of the $K$-User Interference ChannelIEEE Transactions on Information Theory, 2008
- Approximate capacity of Gaussian relay networks2008
- The multicast capacity of deterministic relay networks with no interferenceIEEE Transactions on Information Theory, 2006
- Capacity of wireless erasure networksIEEE Transactions on Information Theory, 2006
- Communication on the Grassmann manifold: a geometric approach to the noncoherent multiple-antenna channelIEEE Transactions on Information Theory, 2002