Sum Capacity of Multi-Source Linear Finite-Field Relay Networks With Fading

Free registration required

Executive Summary

The authors 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. They 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. They 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, they characterize the sum capacity for some classes of channel distributions and network topologies.

  • Format: PDF
  • Size: 161.45 KB