We consider the problem of joint source and channel coding of structured data such as natural language over a noisy channel. The typical approach to this problem in both theory and practice involves performing source coding to first compress the text and then channel coding to add robustness for the transmission across the channel. This approach is optimal in terms of minimizing end-to-end dist...

TANDEM CODING FOR SYSTEMS WITH MARKOVIAN MEMORY ? Yangfan Zhong, Fady Alajaji and L. Lorne Campbell Department of Mathematics and Statistics Queen’s University, Kingston, ON K7L 3N6, Canada fyangfan, fady, [email protected] ABSTRACT In this work, we explore the merits of joint source-channel coding (JSCC) versus traditional tandem coding, which consists of separately performing and conc...

We consider a network of two nodes separated by a noisy channel with two sided state information, in which the input and output signals have to be coordinated with the source and its reconstruction. In the case of non-causal encoding and decoding, we propose a joint source-channel coding scheme and develop inner and outer bounds for the strong coordination region. While the inner and outer boun...

Multiple description coding (MDC) provides error resilience by producing several descriptions of the source so that various quality reconstructions can be obtained from any subset of the descriptions. The use of correlating transforms within the MDC framework has been studied for “on-off” channels, such as packet-switched channels. Since this channel model is not appropriate for wireless system...

This paper presents a novel algorithm for the joint design of source and channel codes. In the algorithm, channel-optimized vector quantization (COVQ) and rate-punctured convolutional coding (RCPC) are used for design of the source code and the channel code, respectively. We employ the genetic algorithm (GA) to prevent the design of COVQ from falling into a poor local optimum. We also adopt the...

We consider the problem of distributed joint source-channel coding of correlated Gaussian sources over a Gaussian Multiple Access Channel (GMAC). There may be side information at the decoder and/or at the encoders. First we specialize a general result in [20] to obtain sufficient conditions for reliable transmission over a Gaussian MAC. This system does not satisfy the source-channel separation...

The aim of source coding is to represent information as accurately as possible using as few bits as possible and in order to do so redundancy from the source needs to be removed. The aim of channel coding is in some sense the contrary, namely to introduce redundancy that can be exploited to protect the information when being transmitted over a nonideal channel. Combining these two techniques le...

Joint source–channel coding for stationary memoryless and Gauss–Markov sources and binary Markov channels is considered. The channel is an additive-noise channel where the noise process is an M th-order Markov chain. Two joint source-channel coding schemes are considered. The first is a channel-optimized vector quantizer—optimized for both source and channel. The second scheme consists of a sca...