Quantization of memoryless and Gauss-Markov sources over binary Markov channels

From MaRDI portal





It is shown that in some cases the analysis of the signal and the transmitting channel may not be made independently. The authors analyze the joint source-channel coding. They consider the stationary memoryless or Gauss-Markov source. The channel has a memory that is described by an additive noise being the \(M\)th order Markov process. Two joint source-channel coding schemes are considered. The first one is a channel-optimized vector quantizer; it is optimized for both source and channel. The second scheme consists of a scalar quantizer and a maximum a posteriori detector. In this scheme, it is assumed that the scalar quantizer output has residual redundancy that can be exploited by the maximum a posteriori detector to combat the correlated channel noise. These two schemes are compared against two other schemes which use the channel interleaving. Numerical results show that the proposed schemes outperform the interleaving schemes.











This page was built for publication: Quantization of memoryless and Gauss-Markov sources over binary Markov channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355498)