Sum capacity of multi-source linear finite-field relay networks with fading
Authors:
- 1 June 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1714-1718
Abstract
We study a fading linear finite-field relay network having multiple source-destination pairs. Because of the interference created by different unicast sessions, the problem of finding its capacity region is in general difficult. We observe that, since channels are time-varying, relays can deliver their received signals by waiting for appropriate channel realizations such that the destinations can decode their messages without interference. We propose a block Markov encoding and relaying scheme that exploits such channel variations. By deriving a general cut-set upper bound and an achievable rate region, we characterize the sum capacity for some classes of channel distributions and network topologies. For example, when the channels are uniformly distributed, the sum capacity is given by the minimum average rank of the channel matrices constructed by all cuts that separate the entire sources and destinations. We also describe other cases where the capacity is characterized.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Approximate capacity of a class of multi-source Gaussian relay networks2010
- Ergodic interference alignment2009
- Capacity of a class of multi-source relay networks2009
- Gaussian Interference Channel Capacity to Within One BitIEEE Transactions on Information Theory, 2008
- Transmission techniques for relay-interference networks2008
- Interference Alignment and Degrees of Freedom of the $K$-User Interference ChannelIEEE Transactions on Information Theory, 2008
- Unicast Transmission Over Multiple Access Erasure Networks: Capacity and Duality2007
- On Network Coding for Interference Networks2006
- 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