[Paper Review] A Note on Broadcast Channels with Stale State Information at the Transmitter

Hyeji Kim, Yeow-Khiang Chia+1 more|arXiv (Cornell University)|Sep 28, 2013

Wireless Communication Security Techniques4 references4 citations

TL;DR

This paper demonstrates that the Maddah-Ali–Tse (MAT) scheme for broadcast channels with stale state information is a special case of the Shayevitz–Wigger scheme, which employs block Markov coding, compression, superposition coding, Marton coding, and coded time sharing. It derives a general expression for the maximum symmetric rate under symmetric broadcast channels with state and shows that incorporating superposition coding can yield higher rates than the MAT scheme in certain deterministic channel examples, though the symmetric capacity remains unknown for these cases.

ABSTRACT

This paper shows that the Maddah-Ali--Tse (MAT) scheme which establishes the symmetric capacity of two example broadcast channels with strictly causal state information at the transmitter is a simple special case of the Shayevitz--Wigger scheme for the broadcast channel with generalized feedback, which involves block Markov coding, compression, superposition coding, Marton coding, and coded time sharing. Focusing on the class of symmetric broadcast channels with state, we derive an expression for the maximum achievable symmetric rate using the Shayevitz--Wigger scheme. We show that the MAT results can be recovered by evaluating this expression for the special case in which superposition coding and Marton coding are not used. We then introduce a new broadcast channel example that shares many features of the MAT examples. We show that another special case of our maximum symmetric rate expression in which superposition coding is also used attains a higher symmetric rate than the MAT scheme. The symmetric capacity of this example is not known, however.

Motivation & Objective

• To establish a unified framework linking the Maddah-Ali–Tse (MAT) scheme to the broader Shayevitz–Wigger scheme for broadcast channels with stale state information.
• To derive a general expression for the maximum achievable symmetric rate in symmetric broadcast channels with state using the Shayevitz–Wigger scheme.
• To investigate whether the time-sharing scheme (without superposition and Marton coding) is optimal for symmetric deterministic broadcast channels with state.
• To construct a new example where superposition coding yields a higher symmetric rate than the MAT scheme, indicating potential limitations of the time-sharing approach.
• To explore whether the full Shayevitz–Wigger scheme achieves the symmetric capacity for symmetric deterministic channels with state, or if further optimization is needed.

Proposed method

• Adapts the Shayevitz–Wigger scheme—originally for generalized feedback—to broadcast channels with stale state information at the transmitter.
• Uses block Markov coding with backward decoding, where each block carries new messages and refinement information about previous messages.
• Applies compression of past codewords using a Gray-Wyner-like system with side information from the channel state.
• Employs Marton coding, superposition coding, and coded time sharing to encode messages and refinement information, enabling efficient rate splitting and decoding.
• Derives a general expression for the maximum symmetric rate using symmetric auxiliary random variables and structured Markov chains.
• Specializes the general expression to two cases: (1) time-sharing scheme (no superposition or Marton coding), and (2) superposition coding scheme, to compare achievable rates.

Experimental results

Research questions

• RQ1 Is the Maddah-Ali–Tse scheme a special case of the Shayevitz–Wigger scheme in the context of broadcast channels with stale state information?
• RQ2 Can the general Shayevitz–Wigger framework be used to derive the maximum symmetric rate for symmetric broadcast channels with state?
• RQ3 Does the time-sharing scheme (without superposition and Marton coding) achieve the optimal symmetric rate for all symmetric deterministic broadcast channels with state?
• RQ4 Can superposition coding in the Shayevitz–Wigger framework yield a higher symmetric rate than the MAT scheme in certain deterministic channel examples?
• RQ5 Is the full Shayevitz–Wigger scheme optimal for symmetric deterministic broadcast channels with state, or is the symmetric capacity still unknown?

Key findings

• The Maddah-Ali–Tse scheme is formally shown to be a special case of the Shayevitz–Wigger scheme, specifically when superposition and Marton coding are not used.
• A general expression for the maximum symmetric rate is derived using symmetric auxiliary random variables and the structure of the Shayevitz–Wigger scheme.
• For the Maddah-Ali–Tse examples, the time-sharing scheme (without superposition and Marton coding) achieves the symmetric capacity, confirming its optimality in those cases.
• In a new deterministic broadcast channel example that switches between a Blackwell channel and its skew-symmetric variant, the superposition coding scheme achieves a strictly higher symmetric rate than the time-sharing scheme.
• The symmetric capacity of the new example remains unknown, and it is not established whether the full Shayevitz–Wigger scheme achieves it, indicating open questions in the general case.