TY - JOUR
T1 - The capacity region of the degraded finite-state broadcast channel
AU - Dabora, Ron
AU - Goldsmith, Andrea J.
N1 - Funding Information:
Manuscript received April 30, 2008; revised September 08, 2009. Current version published March 17, 2010. This work was supported in part by the DARPA ITMANET program by Grant 1105741-1-TFIND and the ARO under MURI award W911NF-05-1-0246. The material in this paper was presented in part at the IEEE Information Theory Workshop (ITW), Porto, Portugal, May 2008. R. Dabora is with the Department of Electrical and Computer Engineering, Ben-Gurion University, Be’er-Sheva 84105, Israel (e-mail: [email protected]). A. J. Goldsmith is with the Department of Electrical Engineering, Stanford University, Stanford, CA 94305 USA (e-mail: [email protected]). Communicated by G. Kramer, Associate Editor for Shannon Theory. Color versions of Figures 1 and 2 in this paper are available online at http:// ieeexplore.ieee.org. Digital Object Identifier 10.1109/TIT.2010.2040974
PY - 2010/4
Y1 - 2010/4
N2 - We introduce and study the discrete, finite-state broadcast channel (FSBC) with memory. For this class of channels we define physical degradedness and stochastic degradedness, and demonstrate these definitions with practical communication scenarios. We then show that a superposition codebook with memory achieves the capacity region of physically degraded FSBCs. This result is subsequently used to characterize the capacity region of stochastically degraded FSBCs. In both scenarios, we consider indecomposable as well as nonindecomposable channels.
AB - We introduce and study the discrete, finite-state broadcast channel (FSBC) with memory. For this class of channels we define physical degradedness and stochastic degradedness, and demonstrate these definitions with practical communication scenarios. We then show that a superposition codebook with memory achieves the capacity region of physically degraded FSBCs. This result is subsequently used to characterize the capacity region of stochastically degraded FSBCs. In both scenarios, we consider indecomposable as well as nonindecomposable channels.
KW - Broadcast channels
KW - Capacity
KW - Channels with memory
KW - Finite-state channels
KW - Indecomposable channels
KW - Network information theory
KW - Superposition codebook
UR - http://www.scopus.com/inward/record.url?scp=77950228257&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77950228257&partnerID=8YFLogxK
U2 - 10.1109/TIT.2010.2040974
DO - 10.1109/TIT.2010.2040974
M3 - Article
AN - SCOPUS:77950228257
SN - 0018-9448
VL - 56
SP - 1828
EP - 1851
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 4
M1 - 5437425
ER -