Joint Source-channel Scheme Research Articles

Second Order Analysis for Joint Source-Channel Coding With General Channel and Markovian Source

We derive the optimal second-order rates in joint source-channel coding when the channel is a general discrete memoryless channel and the source is an irreducible and ergodic Markov process. In contrast, previous studies solved it only when the channel satisfies a certain unique-variance condition and the source is subject to an independent and identical distribution. We also compare the joint source-channel scheme with the separation scheme in the second-order regime, while a previous study made a notable comparison with numerical calculation. To discuss these two topics, we introduce two kinds of new distribution families, switched Gaussian convolution distribution and *-product distribution, which are defined by modifying the Gaussian distribution.

Joint turbo decoding and estimation of hidden Markov sources

We describe a joint source-channel scheme for modifying a turbo decoder in order to exploit the statistical characteristics of hidden Markov sources. The basic idea is to treat the trellis describing the hidden Markov source as another constituent decoder which exchanges information with the other constituent decoder blocks. The source block uses as extrinsic information the probability of the input bits that is provided by the constituent decoder blocks. On the other hand, it produces a new estimation of such a probability which will be used as extrinsic information by the constituent turbo decoders. The proposed joint source-channel decoding technique leads to significantly improved performance relative to systems in which source statistics are not exploited and avoids the need to perform any explicit source coding prior to transmission. Lack of a priori knowledge of the source parameters does not degrade the performance of the system, since these parameters can be jointly estimated with turbo decoding.