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

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

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.

Original languageEnglish (US)
Article number5625618
Pages (from-to)5958-5983
Number of pages26
JournalIEEE Transactions on Information Theory
Volume56
Issue number12
DOIs
StatePublished - Dec 2010
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Keywords

  • Broadcast channels
  • capacity
  • channels with memory
  • cooperation
  • feedback
  • finite-state channels (FSCs)
  • network information theory
  • superposition codebook

Fingerprint Dive into the research topics of 'Capacity theorems for discrete, finite-state broadcast channels with feedback and unidirectional receiver cooperation'. Together they form a unique fingerprint.

Cite this