Random-Coding Joint Source-Channel Bounds

The Joint Source-Channel Coding (JSCC) theorem consists of two parts. The direct part states that reliable transmission of a source over a channel is possible if the minimum achievable coding rate of a given source is strictly below the channel capacity. Random-coding exact characterizations and bounds to the error probability of joint source-channel coding are presented. In particular, upper bounds using maximum-a-posteriori and threshold decoding are derived as well as a lower bound motivated by Verdu-Hans lemma.

Provided by: University of California, Santa Cruz Topic: Networking Date Added: Jun 2011 Format: PDF

Find By Topic