Capacity theorems for discrete, finite-state broadcast channels with feedback and unidirectional receiver cooperation

  • Authors:
  • Ron Dabora;Andrea J. Goldsmith

  • Affiliations:
  • Department of Electrical and Computer Engineering, Ben-Gurion University, Be'er Sheva, Israel;Department of Electrical Engineering, Stanford University, CA

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2010

Quantified Score

Hi-index 754.84

Visualization

Abstract

In this paper, we consider the discrete, time-varying broadcast channel (BC) with memory under the assumption that the channel states belong to a set of finite cardinality. We study the achievable rates in several scenarios of feedback and full unidirectional receiver cooperation. In particular, we focus on two scenarios: the first scenario is the general finite-state broadcast channel (FSBC) where both receivers send feedback to the transmitter while one receiver also sends its channel output to the second receiver. The second scenario is the degraded FSBC where only the strong receiver sends feedback to the transmitter. Using a superposition codebook construction, we derive the capacity regions for both scenarios. Combining elements from these two basic results, we obtain the capacity regions for a number of additional broadcast scenarios with feedback and unidirectional receiver cooperation.