Capacity theorems for the finite-state broadcast channel with feedback

Ron Dabora; Andrea Goldsmith

doi:10.1109/ISIT.2008.4595281

Capacity theorems for the finite-state broadcast channel with feedback

Ron Dabora, Andrea Goldsmith

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

We consider the discrete, time-varying broadcast channel with memory under the assumption that the channel states belong to a set of finite cardinality. We study the achievable rates in two scenarios where feedback (and cooperation) is available. One scenario is the general finite-state broadcast channel (FSBC) where both receivers send feedback to the transmitter, and in addition one receiver sends his channel outputs to the other receiver through a cooperation link. The second scenario is the degraded FSBC where only the strong receiver sends feedback to the transmitter. We find the capacity regions for both cases. In both scenarios we consider non-indecomposable as well as a class of indecomposable FSBCs.

Original language	English
Title of host publication	Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages	1716-1720
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2008.4595281
State	Published - 29 Sep 2008
Externally published	Yes
Event	2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada Duration: 6 Jul 2008 → 11 Jul 2008

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8101

Conference

Conference	2008 IEEE International Symposium on Information Theory, ISIT 2008
Country/Territory	Canada
City	Toronto, ON
Period	6/07/08 → 11/07/08

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2008.4595281

Cite this

@inproceedings{50d54149f66a41feb1b9e09251ad0af8,

title = "Capacity theorems for the finite-state broadcast channel with feedback",

abstract = "We consider the discrete, time-varying broadcast channel with memory under the assumption that the channel states belong to a set of finite cardinality. We study the achievable rates in two scenarios where feedback (and cooperation) is available. One scenario is the general finite-state broadcast channel (FSBC) where both receivers send feedback to the transmitter, and in addition one receiver sends his channel outputs to the other receiver through a cooperation link. The second scenario is the degraded FSBC where only the strong receiver sends feedback to the transmitter. We find the capacity regions for both cases. In both scenarios we consider non-indecomposable as well as a class of indecomposable FSBCs.",

author = "Ron Dabora and Andrea Goldsmith",

year = "2008",

month = sep,

day = "29",

doi = "10.1109/ISIT.2008.4595281",

language = "English",

isbn = "9781424422579",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1716--1720",

booktitle = "Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008",

note = "2008 IEEE International Symposium on Information Theory, ISIT 2008 ; Conference date: 06-07-2008 Through 11-07-2008",

}

Dabora, R & Goldsmith, A 2008, Capacity theorems for the finite-state broadcast channel with feedback. in Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008., 4595281, IEEE International Symposium on Information Theory - Proceedings, pp. 1716-1720, 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, 6/07/08. https://doi.org/10.1109/ISIT.2008.4595281

Capacity theorems for the finite-state broadcast channel with feedback. / Dabora, Ron; Goldsmith, Andrea.
Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. 2008. p. 1716-1720 4595281 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Capacity theorems for the finite-state broadcast channel with feedback

AU - Dabora, Ron

AU - Goldsmith, Andrea

PY - 2008/9/29

Y1 - 2008/9/29

N2 - We consider the discrete, time-varying broadcast channel with memory under the assumption that the channel states belong to a set of finite cardinality. We study the achievable rates in two scenarios where feedback (and cooperation) is available. One scenario is the general finite-state broadcast channel (FSBC) where both receivers send feedback to the transmitter, and in addition one receiver sends his channel outputs to the other receiver through a cooperation link. The second scenario is the degraded FSBC where only the strong receiver sends feedback to the transmitter. We find the capacity regions for both cases. In both scenarios we consider non-indecomposable as well as a class of indecomposable FSBCs.

AB - We consider the discrete, time-varying broadcast channel with memory under the assumption that the channel states belong to a set of finite cardinality. We study the achievable rates in two scenarios where feedback (and cooperation) is available. One scenario is the general finite-state broadcast channel (FSBC) where both receivers send feedback to the transmitter, and in addition one receiver sends his channel outputs to the other receiver through a cooperation link. The second scenario is the degraded FSBC where only the strong receiver sends feedback to the transmitter. We find the capacity regions for both cases. In both scenarios we consider non-indecomposable as well as a class of indecomposable FSBCs.

UR - http://www.scopus.com/inward/record.url?scp=52349097433&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2008.4595281

DO - 10.1109/ISIT.2008.4595281

M3 - Conference contribution

AN - SCOPUS:52349097433

SN - 9781424422579

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1716

EP - 1720

BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008

T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008

Y2 - 6 July 2008 through 11 July 2008

ER -

Capacity theorems for the finite-state broadcast channel with feedback

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this