TY - JOUR
T1 - Capacity theorems for discrete, finite-state broadcast channels with feedback and unidirectional receiver cooperation
AU - Dabora, Ron
AU - Goldsmith, Andrea J.
N1 - Funding Information:
Manuscript received January 13, 2009; revised December 28, 2009. Date of current version November 19, 2010. This work was supported by the DARPA ITMANET program under Grant 1105741-1-TFIND. The material in this paper was presented in part at the IEEE International Symposium on Information Theory (ISIT), Toronto, ON, Canada, July 2008 and at the Information Theory Workshop (ITW), Volos, Greece, June 2009. 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, CA 94305 USA (e-mail: [email protected]). Communicated by M. C. Gastpar, Associate Editor for Shannon Theory. Color versions of one or more of the figures in this paper are available online at http://ieeexplore.ieee.org. Digital Object Identifier 10.1109/TIT.2010.2081010
PY - 2010/12
Y1 - 2010/12
N2 - 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.
AB - 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.
KW - Broadcast channels
KW - capacity
KW - channels with memory
KW - cooperation
KW - feedback
KW - finite-state channels (FSCs)
KW - network information theory
KW - superposition codebook
UR - http://www.scopus.com/inward/record.url?scp=78649382630&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78649382630&partnerID=8YFLogxK
U2 - 10.1109/TIT.2010.2081010
DO - 10.1109/TIT.2010.2081010
M3 - Article
AN - SCOPUS:78649382630
SN - 0018-9448
VL - 56
SP - 5958
EP - 5983
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 12
M1 - 5625618
ER -