Conventionally, posterior matching is investigated in channel coding and block encoding contexts - the source symbols are equiprobably distributed and are entirely known by the encoder before the transmission. In this...
详细信息
ISBN:
(纸本)9781665421607;9781665421591
Conventionally, posterior matching is investigated in channel coding and block encoding contexts - the source symbols are equiprobably distributed and are entirely known by the encoder before the transmission. In this paper, we consider a streaming source, whose symbols progressively arrive at the encoder at a sequence of deterministic times. We derive the joint source-channel coding (JSCC) reliability function for streaming over a discrete memoryless channel (DMC) with feedback under regularity conditions. We propose a novel instantaneous encoding phase that operates during the symbol arriving period and that achieves the JSCC reliability function for streaming when followed by a block encoding scheme that achieves the JSCC reliability function for a classical source whose symbols are fully accessible before the transmission. The instantaneous encoding phase partitions the evolving message alphabet into groups whose priors are close to the capacity-achieving distribution, and randomizes the group indices to ensure that the transmitted group index has the capacity-achieving distribution. Surprisingly, the JSCC reliability function for streaming is equal to that for a fully accessible source, implying that the knowledge of the entire symbol sequence before the transmission offers no advantage in terms of the reliability function.
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...
详细信息
ISBN:
(纸本)9781479934119
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 ratesplitting is not necessarily optimal when coding for cooperative BC and solve an example where a multiple-binning coding scheme outperforms rate-splitting.
暂无评论