TY - GEN
T1 - The state-dependent broadcast channel with cooperation
AU - Dikstein, Lior
AU - Permuter, Haim H.
AU - Steinberg, Yossef
PY - 2013/1/1
Y1 - 2013/1/1
N2 - In this paper, we investigate problems of communication over physically-degraded, state-dependent broadcast channels (BC) with cooperating decoders. Three different setups are considered and their capacity regions are characterized. First, we study a setting where noncausal state information is available to the encoder and the strong decoder. Furthermore, the strong decoder can use a finite capacity link to send the weak decoder information regarding the messages or the channel state. Second, we examine a setting where the encoder and the strong decoder both have access to noncausal state information, while the weak decoder has access to rate-limited state information. This scenario can be interpreted as a special case, where the strong decoder can only cooperate to send the weak decoder rate-limited information about the state sequence. A third case we consider, is a cooperative setting where state information is available only to the encoder in a causal manner. Finally, we discuss the optimality of using rate-splitting when coding for cooperative BC. In particular, we prove that rate-splitting is not necessarily optimal when coding for cooperative BC and solve an example where a multiple-binning coding scheme outperforms rate-splitting.
AB - In this paper, we investigate problems of communication over physically-degraded, state-dependent broadcast channels (BC) with cooperating decoders. Three different setups are considered and their capacity regions are characterized. First, we study a setting where noncausal state information is available to the encoder and the strong decoder. Furthermore, the strong decoder can use a finite capacity link to send the weak decoder information regarding the messages or the channel state. Second, we examine a setting where the encoder and the strong decoder both have access to noncausal state information, while the weak decoder has access to rate-limited state information. This scenario can be interpreted as a special case, where the strong decoder can only cooperate to send the weak decoder rate-limited information about the state sequence. A third case we consider, is a cooperative setting where state information is available only to the encoder in a causal manner. Finally, we discuss the optimality of using rate-splitting when coding for cooperative BC. In particular, we prove that rate-splitting is not necessarily optimal when coding for cooperative BC and solve an example where a multiple-binning coding scheme outperforms rate-splitting.
KW - Binning
KW - broadcast channels
KW - causal coding
KW - channel capacity
KW - cooperative broadcast
KW - degraded broadcast channel
KW - noncausal coding
KW - partial side information
KW - side information
KW - state-dependent channels
UR - http://www.scopus.com/inward/record.url?scp=84897713762&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/Allerton.2013.6736677
DO - https://doi.org/10.1109/Allerton.2013.6736677
M3 - Conference contribution
SN - 9781479934096
T3 - 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
SP - 1307
EP - 1313
BT - 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
T2 - 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
Y2 - 2 October 2013 through 4 October 2013
ER -